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-171640604100745.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100745
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 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 67K 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-07-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717201105230

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:18:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:18:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:18:26] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 00:18:26] [INFO ] Transformed 155 places.
[2024-06-01 00:18:26] [INFO ] Transformed 320 transitions.
[2024-06-01 00:18:26] [INFO ] Found NUPN structural information;
[2024-06-01 00:18:26] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 117 transition count 224
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 117 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 116 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 116 transition count 222
Applied a total of 78 rules in 24 ms. Remains 116 /155 variables (removed 39) and now considering 222/295 (removed 73) transitions.
[2024-06-01 00:18:26] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
// Phase 1: matrix 215 rows 116 cols
[2024-06-01 00:18:26] [INFO ] Computed 13 invariants in 18 ms
[2024-06-01 00:18:26] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 00:18:26] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-06-01 00:18:26] [INFO ] Invariant cache hit.
[2024-06-01 00:18:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 00:18:27] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-06-01 00:18:27] [INFO ] Invariant cache hit.
[2024-06-01 00:18:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 12 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:18:28] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:18:29] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 3 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:30] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:18:31] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 7 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 19/102 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:36] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:37] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 214/330 variables, 116/229 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:41] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (OVERLAPS) 1/331 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/331 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/331 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 22 (OVERLAPS) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 236 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27442 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:56] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 214/330 variables, 116/242 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 221/463 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:18:59] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:19:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/331 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 00:19:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (OVERLAPS) 0/331 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 467 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28946 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 116/116 constraints]
After SMT, in 56536ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 56554ms
Starting structural reductions in LTL mode, iteration 1 : 116/155 places, 222/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56979 ms. Remains : 116/155 places, 222/295 transitions.
Support contains 80 out of 116 places after structural reductions.
[2024-06-01 00:19:23] [INFO ] Flatten gal took : 38 ms
[2024-06-01 00:19:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:19:23] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 76 out of 116 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (2118 resets) in 2304 ms. (17 steps per ms) remains 24/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (27 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (29 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2024-06-01 00:19:24] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-06-01 00:19:24] [INFO ] Invariant cache hit.
[2024-06-01 00:19:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 38/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 40/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 5/27 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 214/330 variables, 116/143 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/331 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/331 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 144 constraints, problems are : Problem set: 1 solved, 23 unsolved in 1606 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 38/75 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 9/17 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/19 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 41/116 variables, 8/29 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 11/40 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 20/60 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 11/71 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 3/74 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 9/83 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 214/330 variables, 116/199 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 23/222 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 1/331 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/331 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 0/331 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 224 constraints, problems are : Problem set: 1 solved, 23 unsolved in 4985 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/24 constraints, Known Traps: 71/71 constraints]
After SMT, in 6625ms problems are : Problem set: 1 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 18 properties in 1788 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 150 edges and 116 vertex of which 10 / 116 are part of one of the 5 SCC in 2 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 462 edges and 111 vertex of which 107 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 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 107 transition count 200
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 103 transition count 196
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 102 transition count 195
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 102 transition count 192
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 24 place count 97 transition count 192
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 66 place count 55 transition count 108
Iterating global reduction 3 with 42 rules applied. Total rules applied 108 place count 55 transition count 108
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 48 transition count 94
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 48 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 131 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 133 place count 46 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 46 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 44 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 75
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 144 place count 44 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 43 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 43 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
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 38 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 160 place count 38 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 163 place count 38 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 166 place count 35 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 35 transition count 91
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 35 transition count 91
Applied a total of 169 rules in 80 ms. Remains 35 /116 variables (removed 81) and now considering 91/222 (removed 131) transitions.
Running 83 sub problems to find dead transitions.
[2024-06-01 00:19:33] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
// Phase 1: matrix 85 rows 35 cols
[2024-06-01 00:19:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:19:33] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD90 is UNSAT
At refinement iteration 4 (OVERLAPS) 85/120 variables, 35/42 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 29/71 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 71 constraints, problems are : Problem set: 1 solved, 82 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 2/35 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 85/120 variables, 35/42 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 29/71 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 82/153 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 153 constraints, problems are : Problem set: 1 solved, 82 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 82/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2842ms problems are : Problem set: 1 solved, 82 unsolved
Search for dead transitions found 1 dead transitions in 2843ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 35/116 places, 90/222 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 35 transition count 90
Applied a total of 10 rules in 20 ms. Remains 35 /35 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2944 ms. Remains : 35/116 places, 90/222 transitions.
RANDOM walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 6675 steps, run visited all 5 properties in 41 ms. (steps per millisecond=162 )
Probabilistic random walk after 6675 steps, saw 1674 distinct states, run finished after 44 ms. (steps per millisecond=151 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:19:36] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 71 transition count 136
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 71 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 67 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 67 transition count 128
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 105 place count 67 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 66 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 66 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 65 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 65 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 111 place count 65 transition count 114
Applied a total of 111 rules in 15 ms. Remains 65 /116 variables (removed 51) and now considering 114/222 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 65/116 places, 114/222 transitions.
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:19:36] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 163 edges and 116 vertex of which 14 / 116 are part of one of the 7 SCC in 15 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 60 transition count 122
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 60 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 104 place count 53 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 111 place count 53 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 120 place count 53 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 51 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 49 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 49 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 134 place count 49 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 49 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 43 transition count 70
Applied a total of 149 rules in 47 ms. Remains 43 /116 variables (removed 73) and now considering 70/222 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 43/116 places, 70/222 transitions.
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:36] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 66 transition count 126
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 66 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 59 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 59 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 123 place count 59 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 56 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 56 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 53 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 144 place count 53 transition count 79
Applied a total of 144 rules in 7 ms. Remains 53 /116 variables (removed 63) and now considering 79/222 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 53/116 places, 79/222 transitions.
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:36] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:36] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 63 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 63 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 57 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 57 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 124 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 145 place count 51 transition count 78
Applied a total of 145 rules in 22 ms. Remains 51 /116 variables (removed 65) and now considering 78/222 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 51/116 places, 78/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 74 transition count 142
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 74 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 69 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 69 transition count 132
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 69 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 68 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 68 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 67 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 67 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 67 transition count 120
Applied a total of 105 rules in 14 ms. Remains 67 /116 variables (removed 49) and now considering 120/222 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 67/116 places, 120/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 67 transition count 128
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 67 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 63 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 63 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 112 place count 63 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 62 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 62 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 61 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 61 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 119 place count 61 transition count 106
Applied a total of 119 rules in 4 ms. Remains 61 /116 variables (removed 55) and now considering 106/222 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/116 places, 106/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 64 transition count 122
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 64 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 57 transition count 108
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 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 54 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 51 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 148 place count 51 transition count 75
Applied a total of 148 rules in 4 ms. Remains 51 /116 variables (removed 65) and now considering 75/222 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/116 places, 75/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 70 transition count 134
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 70 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 64 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 64 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 64 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 61 transition count 110
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 61 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 58 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 58 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 58 transition count 97
Applied a total of 126 rules in 4 ms. Remains 58 /116 variables (removed 58) and now considering 97/222 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/116 places, 97/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 69 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 69 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 65 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 64 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 64 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 63 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 63 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 63 transition count 116
Applied a total of 108 rules in 4 ms. Remains 63 /116 variables (removed 53) and now considering 116/222 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/116 places, 116/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 163 edges and 116 vertex of which 14 / 116 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 59 transition count 120
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 59 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 106 place count 52 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 52 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 122 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 50 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 48 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 48 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 48 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 48 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 147 place count 46 transition count 72
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 42 transition count 68
Applied a total of 151 rules in 15 ms. Remains 42 /116 variables (removed 74) and now considering 68/222 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 42/116 places, 68/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 37328 steps (3771 resets) in 217 ms. (171 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-07-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 63 transition count 119
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 63 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 56 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 56 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 129 place count 56 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 53 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 53 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 51 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 51 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 145 place count 51 transition count 77
Applied a total of 145 rules in 14 ms. Remains 51 /116 variables (removed 65) and now considering 77/222 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 51/116 places, 77/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 68 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 68 transition count 129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 62 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 58 transition count 98
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 58 transition count 92
Applied a total of 131 rules in 14 ms. Remains 58 /116 variables (removed 58) and now considering 92/222 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 58/116 places, 92/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 153 edges and 116 vertex of which 14 / 116 are part of one of the 7 SCC in 8 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 61 transition count 124
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 61 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 101 place count 55 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 107 place count 55 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 112 place count 55 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 49 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 133 place count 49 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 49 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 43 transition count 70
Applied a total of 148 rules in 38 ms. Remains 43 /116 variables (removed 73) and now considering 70/222 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 43/116 places, 70/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 64 transition count 122
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 64 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 57 transition count 108
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 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 53 transition count 85
Applied a total of 138 rules in 15 ms. Remains 53 /116 variables (removed 63) and now considering 85/222 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 53/116 places, 85/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 71 transition count 135
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 71 transition count 135
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 66 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 66 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 66 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 64 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 63 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 63 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 63 transition count 110
Applied a total of 113 rules in 4 ms. Remains 63 /116 variables (removed 53) and now considering 110/222 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/116 places, 110/222 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:37] [INFO ] Input system was already deterministic with 110 transitions.
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:19:37] [INFO ] Flatten gal took : 21 ms
[2024-06-01 00:19:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 00:19:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 222 transitions and 626 arcs took 2 ms.
Total runtime 71168 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-07-CTLCardinality-2024-00
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-01
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-02
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-03
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-04
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-05
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-06
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-07
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-08
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2024-10
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2023-12
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2023-13
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2023-14
Could not compute solution for formula : HealthRecord-PT-07-CTLCardinality-2023-15

BK_STOP 1717201177957

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1097/ctl_0_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1097/ctl_1_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1097/ctl_2_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1097/ctl_3_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1097/ctl_4_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1097/ctl_5_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1097/ctl_6_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1097/ctl_7_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1097/ctl_8_
ctl formula name HealthRecord-PT-07-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1097/ctl_9_
ctl formula name HealthRecord-PT-07-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1097/ctl_10_
ctl formula name HealthRecord-PT-07-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1097/ctl_11_
ctl formula name HealthRecord-PT-07-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1097/ctl_12_
ctl formula name HealthRecord-PT-07-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1097/ctl_13_
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-07"
export BK_EXAMINATION="CTLCardinality"
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-07, examination is CTLCardinality"
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-171640604100745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-07.tgz
mv HealthRecord-PT-07 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;