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.r355-tall-171683760000985.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 greatspnxred
Input is ShieldRVt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760000985
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 239K May 18 16:43 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 ShieldRVt-PT-020B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-020B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717078785176

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:19:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 14:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:19:46] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-30 14:19:46] [INFO ] Transformed 1003 places.
[2024-05-30 14:19:46] [INFO ] Transformed 1003 transitions.
[2024-05-30 14:19:46] [INFO ] Found NUPN structural information;
[2024-05-30 14:19:46] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-020B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 129 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 175 places :
Symmetric choice reduction at 0 with 175 rule applications. Total rules 175 place count 828 transition count 828
Iterating global reduction 0 with 175 rules applied. Total rules applied 350 place count 828 transition count 828
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 351 place count 827 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 352 place count 827 transition count 827
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 353 place count 826 transition count 826
Iterating global reduction 0 with 1 rules applied. Total rules applied 354 place count 826 transition count 826
Applied a total of 354 rules in 234 ms. Remains 826 /1003 variables (removed 177) and now considering 826/1003 (removed 177) transitions.
// Phase 1: matrix 826 rows 826 cols
[2024-05-30 14:19:47] [INFO ] Computed 81 invariants in 25 ms
[2024-05-30 14:19:47] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-30 14:19:47] [INFO ] Invariant cache hit.
[2024-05-30 14:19:48] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2024-05-30 14:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/826 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-30 14:20:07] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 13 ms to minimize.
[2024-05-30 14:20:08] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 2 ms to minimize.
[2024-05-30 14:20:08] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2024-05-30 14:20:09] [INFO ] Deduced a trap composed of 22 places in 516 ms of which 2 ms to minimize.
[2024-05-30 14:20:09] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:20:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:20:10] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 3 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 4 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:20:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:20:15] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-30 14:20:17] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:20:18] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 826/1652 variables, and 108 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/826 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/826 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 27/108 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-30 14:20:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:20:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:20:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:31] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:32] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:32] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:33] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 5 ms to minimize.
[2024-05-30 14:20:33] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:20:34] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:20:35] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:20:35] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-05-30 14:20:36] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-30 14:20:36] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-05-30 14:20:38] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 5 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:20:41] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:44] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:20:47] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:20:47] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-30 14:20:48] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 5 ms to minimize.
[2024-05-30 14:20:48] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/1652 variables, and 138 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/826 constraints, PredecessorRefiner: 0/825 constraints, Known Traps: 57/57 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 826/1003 places, 826/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61729 ms. Remains : 826/1003 places, 826/1003 transitions.
Support contains 129 out of 826 places after structural reductions.
[2024-05-30 14:20:48] [INFO ] Flatten gal took : 72 ms
[2024-05-30 14:20:48] [INFO ] Flatten gal took : 38 ms
[2024-05-30 14:20:48] [INFO ] Input system was already deterministic with 826 transitions.
Support contains 124 out of 826 places (down from 129) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2833 ms. (14 steps per ms) remains 13/74 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
[2024-05-30 14:20:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 437/462 variables, 43/43 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 364/826 variables, 38/81 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 826/1652 variables, 826/907 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1652 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/1652 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 907 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 826/826 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 239/261 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 14:20:51] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/23 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 565/826 variables, 59/82 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-30 14:20:51] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:20:52] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:20:52] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-30 14:20:52] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:20:52] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-30 14:20:52] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 6/88 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 826/1652 variables, 826/914 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1652 variables, 11/925 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 4 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1652 variables, 13/938 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1652 variables, 2/940 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1652 variables, 2/942 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
SMT process timed out in 6144ms, After SMT, problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 826/826 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 826 transition count 613
Reduce places removed 213 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 218 rules applied. Total rules applied 431 place count 613 transition count 608
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 436 place count 608 transition count 608
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 436 place count 608 transition count 472
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 708 place count 472 transition count 472
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 736 place count 444 transition count 444
Iterating global reduction 3 with 28 rules applied. Total rules applied 764 place count 444 transition count 444
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 764 place count 444 transition count 425
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 802 place count 425 transition count 425
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1158 place count 247 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 247 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1161 place count 246 transition count 245
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1269 place count 192 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1270 place count 192 transition count 291
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1273 place count 192 transition count 288
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1276 place count 189 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1277 place count 189 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1278 place count 188 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1279 place count 187 transition count 286
Applied a total of 1279 rules in 179 ms. Remains 187 /826 variables (removed 639) and now considering 286/826 (removed 540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 187/826 places, 286/826 transitions.
RANDOM walk for 40000 steps (29 resets) in 664 ms. (60 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
// Phase 1: matrix 286 rows 187 cols
[2024-05-30 14:20:57] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:20:57] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/70 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 102/172 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/201 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/203 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 28/231 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/253 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 22/275 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/275 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/275 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 22/297 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/297 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/297 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 21/318 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/318 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/318 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 21/339 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/339 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/339 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 1/340 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/340 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/340 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 23/363 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/363 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/363 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 1/364 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/364 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/364 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 24/388 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/388 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/388 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 21/409 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/409 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/409 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 21/430 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/430 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/430 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/430 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 2/432 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/432 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 22/454 variables, 10/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/454 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/454 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 2/456 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/456 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 14/470 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/470 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/470 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 3/473 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/473 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/473 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 0/473 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 187/187 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/70 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 102/172 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/201 variables, 10/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/203 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 28/231 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 22/253 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/253 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 22/275 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/275 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/275 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 22/297 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/297 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/297 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 21/318 variables, 8/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/318 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/318 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 21/339 variables, 8/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/339 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/339 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/340 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/340 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/340 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 23/363 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/363 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/363 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 1/364 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/364 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/364 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 24/388 variables, 9/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/388 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/388 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 21/409 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/409 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/409 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 21/430 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/430 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/430 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/430 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/432 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/432 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 22/454 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/454 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/456 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 14/470 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/470 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/470 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 3/473 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/473 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/473 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 0/473 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 322 constraints, problems are : Problem set: 0 solved, 2 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 187/187 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1028ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 286/286 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 187 transition count 279
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 180 transition count 279
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 180 transition count 275
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 176 transition count 275
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 172 transition count 271
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 167 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 167 transition count 278
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 164 transition count 275
Applied a total of 44 rules in 35 ms. Remains 164 /187 variables (removed 23) and now considering 275/286 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 164/187 places, 275/286 transitions.
RANDOM walk for 38897 steps (19 resets) in 221 ms. (175 steps per ms) remains 0/2 properties
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 31 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 31 ms
[2024-05-30 14:20:58] [INFO ] Input system was already deterministic with 826 transitions.
Computed a total of 248 stabilizing places and 248 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 784 transition count 784
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 784 transition count 784
Applied a total of 84 rules in 48 ms. Remains 784 /826 variables (removed 42) and now considering 784/826 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 784/826 places, 784/826 transitions.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:20:58] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 786 transition count 786
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 786 transition count 786
Applied a total of 80 rules in 44 ms. Remains 786 /826 variables (removed 40) and now considering 786/826 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 786/826 places, 786/826 transitions.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 22 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 22 ms
[2024-05-30 14:20:58] [INFO ] Input system was already deterministic with 786 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 782 transition count 782
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 782 transition count 782
Applied a total of 88 rules in 35 ms. Remains 782 /826 variables (removed 44) and now considering 782/826 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 782/826 places, 782/826 transitions.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:20:58] [INFO ] Input system was already deterministic with 782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 783 transition count 783
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 783 transition count 783
Applied a total of 86 rules in 30 ms. Remains 783 /826 variables (removed 43) and now considering 783/826 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 783/826 places, 783/826 transitions.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:20:58] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 826 transition count 601
Reduce places removed 225 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 226 rules applied. Total rules applied 451 place count 601 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 452 place count 600 transition count 600
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 452 place count 600 transition count 461
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 730 place count 461 transition count 461
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 759 place count 432 transition count 432
Iterating global reduction 3 with 29 rules applied. Total rules applied 788 place count 432 transition count 432
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 788 place count 432 transition count 411
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 830 place count 411 transition count 411
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 1158 place count 247 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 247 transition count 246
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1161 place count 246 transition count 245
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1162 place count 246 transition count 245
Applied a total of 1162 rules in 71 ms. Remains 246 /826 variables (removed 580) and now considering 245/826 (removed 581) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 246/826 places, 245/826 transitions.
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:20:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 783 transition count 783
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 783 transition count 783
Applied a total of 86 rules in 38 ms. Remains 783 /826 variables (removed 43) and now considering 783/826 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 783/826 places, 783/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 19 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 784 transition count 784
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 784 transition count 784
Applied a total of 84 rules in 25 ms. Remains 784 /826 variables (removed 42) and now considering 784/826 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 784/826 places, 784/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 784 transition count 784
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 784 transition count 784
Applied a total of 84 rules in 25 ms. Remains 784 /826 variables (removed 42) and now considering 784/826 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 784/826 places, 784/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 825 transition count 603
Reduce places removed 222 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 225 rules applied. Total rules applied 447 place count 603 transition count 600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 450 place count 600 transition count 600
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 450 place count 600 transition count 463
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 724 place count 463 transition count 463
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 752 place count 435 transition count 435
Iterating global reduction 3 with 28 rules applied. Total rules applied 780 place count 435 transition count 435
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 780 place count 435 transition count 417
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 816 place count 417 transition count 417
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 1140 place count 255 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1141 place count 255 transition count 254
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1143 place count 254 transition count 253
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1145 place count 252 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1146 place count 251 transition count 251
Applied a total of 1146 rules in 63 ms. Remains 251 /826 variables (removed 575) and now considering 251/826 (removed 575) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 251/826 places, 251/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 251 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 825 transition count 598
Reduce places removed 227 places and 0 transitions.
Iterating post reduction 1 with 227 rules applied. Total rules applied 454 place count 598 transition count 598
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 138 Pre rules applied. Total rules applied 454 place count 598 transition count 460
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 730 place count 460 transition count 460
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 758 place count 432 transition count 432
Iterating global reduction 2 with 28 rules applied. Total rules applied 786 place count 432 transition count 432
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 786 place count 432 transition count 412
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 826 place count 412 transition count 412
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 1156 place count 247 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1157 place count 247 transition count 246
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1159 place count 246 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 244 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1162 place count 243 transition count 243
Applied a total of 1162 rules in 50 ms. Remains 243 /826 variables (removed 583) and now considering 243/826 (removed 583) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 243/826 places, 243/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 784 transition count 784
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 784 transition count 784
Applied a total of 84 rules in 25 ms. Remains 784 /826 variables (removed 42) and now considering 784/826 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 784/826 places, 784/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 783 transition count 783
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 783 transition count 783
Applied a total of 86 rules in 34 ms. Remains 783 /826 variables (removed 43) and now considering 783/826 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 783/826 places, 783/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 784 transition count 784
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 784 transition count 784
Applied a total of 84 rules in 24 ms. Remains 784 /826 variables (removed 42) and now considering 784/826 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 784/826 places, 784/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 825 transition count 599
Reduce places removed 226 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 227 rules applied. Total rules applied 453 place count 599 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 598 transition count 598
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 454 place count 598 transition count 459
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 732 place count 459 transition count 459
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 762 place count 429 transition count 429
Iterating global reduction 3 with 30 rules applied. Total rules applied 792 place count 429 transition count 429
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 792 place count 429 transition count 407
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 836 place count 407 transition count 407
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 1158 place count 246 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 246 transition count 245
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1161 place count 245 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1163 place count 243 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1164 place count 242 transition count 242
Applied a total of 1164 rules in 55 ms. Remains 242 /826 variables (removed 584) and now considering 242/826 (removed 584) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 242/826 places, 242/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:20:59] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 826/826 places, 826/826 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 786 transition count 786
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 786 transition count 786
Applied a total of 80 rules in 35 ms. Remains 786 /826 variables (removed 40) and now considering 786/826 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 786/826 places, 786/826 transitions.
[2024-05-30 14:20:59] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:00] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:00] [INFO ] Input system was already deterministic with 786 transitions.
[2024-05-30 14:21:00] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:00] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:00] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-30 14:21:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 826 places, 826 transitions and 2012 arcs took 5 ms.
Total runtime 73736 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-020B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 826
TRANSITIONS: 826
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.007s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 810
MODEL NAME: /home/mcc/execution/407/model
826 places, 826 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-PT-020B, 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 r355-tall-171683760000985"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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