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.r480-tall-171624189900753.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 DES-PT-60b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K 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 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-60b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-60b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-60b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-60b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-60b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717199711884

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:55:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:55:13] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-31 23:55:13] [INFO ] Transformed 519 places.
[2024-05-31 23:55:13] [INFO ] Transformed 470 transitions.
[2024-05-31 23:55:13] [INFO ] Found NUPN structural information;
[2024-05-31 23:55:13] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DES-PT-60b-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 82 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 517 transition count 470
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 500 transition count 453
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 500 transition count 453
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 491 transition count 444
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 491 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 491 transition count 438
Applied a total of 60 rules in 135 ms. Remains 491 /519 variables (removed 28) and now considering 438/470 (removed 32) transitions.
// Phase 1: matrix 438 rows 491 cols
[2024-05-31 23:55:13] [INFO ] Computed 63 invariants in 47 ms
[2024-05-31 23:55:14] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-31 23:55:14] [INFO ] Invariant cache hit.
[2024-05-31 23:55:15] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-31 23:55:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 2/491 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (OVERLAPS) 438/929 variables, 491/554 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:55:24] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 35 ms to minimize.
[2024-05-31 23:55:24] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:55:33] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:55:34] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:55:35] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:55:36] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:55:37] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-31 23:55:39] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:55:39] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:55:40] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:55:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:55:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:55:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:55:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 929/929 variables, and 573 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 2/491 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:55:49] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:55:49] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:55:49] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:55:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:55:54] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:55:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-31 23:55:54] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:55:55] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 23:56:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:56:03] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 9 (OVERLAPS) 438/929 variables, 491/603 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 437/1040 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 929/929 variables, and 1040 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 49/49 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 491/519 places, 438/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62118 ms. Remains : 491/519 places, 438/470 transitions.
Support contains 82 out of 491 places after structural reductions.
[2024-05-31 23:56:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 23:56:15] [INFO ] Flatten gal took : 62 ms
FORMULA DES-PT-60b-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:56:15] [INFO ] Flatten gal took : 47 ms
[2024-05-31 23:56:16] [INFO ] Input system was already deterministic with 438 transitions.
Support contains 61 out of 491 places (down from 82) after GAL structural reductions.
RANDOM walk for 40000 steps (338 resets) in 1885 ms. (21 steps per ms) remains 19/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
[2024-05-31 23:56:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 69/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 119/222 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 259/481 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 3/484 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 431/915 variables, 484/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 6/921 variables, 3/550 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 4/925 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/925 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 2/927 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 2/929 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/929 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/929 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 929/929 variables, and 554 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3500 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 69/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 119/222 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 259/481 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 3/484 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 431/915 variables, 484/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 19/566 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:56:23] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:56:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:56:23] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 8 ms to minimize.
[2024-05-31 23:56:25] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 9/575 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/929 variables, and 575 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 484/491 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 9/9 constraints]
After SMT, in 8536ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 482 transition count 416
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 467 transition count 416
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 467 transition count 407
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 458 transition count 407
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 454 transition count 403
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 454 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 454 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 454 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 453 transition count 401
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 450 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 450 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 72 place count 450 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 449 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 73 place count 449 transition count 392
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 447 transition count 392
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 225 place count 373 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 373 transition count 317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 232 place count 370 transition count 335
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 370 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 369 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 368 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 367 transition count 333
Applied a total of 236 rules in 243 ms. Remains 367 /491 variables (removed 124) and now considering 333/438 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 367/491 places, 333/438 transitions.
RANDOM walk for 40000 steps (1345 resets) in 690 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (22 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (24 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 646910 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 19
Probabilistic random walk after 646910 steps, saw 86126 distinct states, run finished after 3006 ms. (steps per millisecond=215 ) properties seen :0
// Phase 1: matrix 333 rows 367 cols
[2024-05-31 23:56:29] [INFO ] Computed 60 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 196/264 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 27/291 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 19/310 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 5/315 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 333/648 variables, 315/375 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 52/700 variables, 52/427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/700 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/700 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 427 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 32/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 196/264 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:56:31] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 27/291 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 19/310 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 5/315 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 333/648 variables, 315/376 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 12/388 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:56:33] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:56:33] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:56:33] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:56:34] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:56:34] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:56:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:56:35] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-31 23:56:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/648 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 52/700 variables, 52/448 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/700 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:56:39] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/700 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/700 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 0/700 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 456 constraints, problems are : Problem set: 0 solved, 19 unsolved in 13404 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 10/10 constraints]
After SMT, in 15335ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 5694 ms.
Support contains 34 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 367 /367 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 367/367 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 367 /367 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2024-05-31 23:56:50] [INFO ] Invariant cache hit.
[2024-05-31 23:56:50] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-31 23:56:50] [INFO ] Invariant cache hit.
[2024-05-31 23:56:50] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-31 23:56:50] [INFO ] Redundant transitions in 20 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-31 23:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 1/363 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 3/366 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 333/699 variables, 366/426 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:57:06] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 5/431 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-31 23:57:10] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:57:10] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:57:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 3/434 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-31 23:57:16] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (OVERLAPS) 1/700 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 700/700 variables, and 436 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 1/363 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 3/366 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 333/699 variables, 366/435 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 328/763 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/700 variables, and 763 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 366/367 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 9/9 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61053 ms. Remains : 367/367 places, 333/333 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 367 /367 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Running SMT prover for 19 properties.
[2024-05-31 23:57:51] [INFO ] Invariant cache hit.
[2024-05-31 23:57:51] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-31 23:57:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:57:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:57:52] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
TRAPS : Iteration 0
[2024-05-31 23:57:52] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-31 23:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-31 23:57:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:57:52] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:57:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 1
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
TRAPS : Iteration 2
[2024-05-31 23:57:55] [INFO ] After 3382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
[2024-05-31 23:57:55] [INFO ] After 4165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Over-approximation ignoring read arcs solved 0 properties in 4350 ms.
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 25 ms
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 41 ms
[2024-05-31 23:57:55] [INFO ] Input system was already deterministic with 438 transitions.
Computed a total of 297 stabilizing places and 289 stable transitions
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 483 transition count 431
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 483 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 483 transition count 430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 478 transition count 425
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 478 transition count 425
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 478 transition count 421
Applied a total of 30 rules in 26 ms. Remains 478 /491 variables (removed 13) and now considering 421/438 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 478/491 places, 421/438 transitions.
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 20 ms
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 21 ms
[2024-05-31 23:57:55] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 483 transition count 430
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 483 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 483 transition count 429
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 477 transition count 423
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 477 transition count 423
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 477 transition count 417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 476 transition count 416
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 476 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 476 transition count 415
Applied a total of 38 rules in 27 ms. Remains 476 /491 variables (removed 15) and now considering 415/438 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 476/491 places, 415/438 transitions.
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 20 ms
[2024-05-31 23:57:55] [INFO ] Flatten gal took : 20 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 481 transition count 419
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 468 transition count 419
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 468 transition count 409
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 458 transition count 409
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 450 transition count 401
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 450 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 450 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 450 transition count 399
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 449 transition count 399
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 443 transition count 393
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 443 transition count 393
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 86 place count 443 transition count 385
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 441 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 89 place count 441 transition count 382
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 93 place count 439 transition count 382
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 235 place count 368 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 366 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 365 transition count 309
Applied a total of 238 rules in 129 ms. Remains 365 /491 variables (removed 126) and now considering 309/438 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 365/491 places, 309/438 transitions.
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 481 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 481 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 481 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 474 transition count 421
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 474 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 38 ms. Remains 473 /491 variables (removed 18) and now considering 413/438 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 473/491 places, 413/438 transitions.
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 482 transition count 430
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 482 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 482 transition count 429
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 476 transition count 423
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 476 transition count 423
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 476 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 475 transition count 417
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 475 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 475 transition count 416
Applied a total of 38 rules in 28 ms. Remains 475 /491 variables (removed 16) and now considering 416/438 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 475/491 places, 416/438 transitions.
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 481 transition count 419
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 468 transition count 419
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 468 transition count 409
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 458 transition count 409
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 452 transition count 403
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 452 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 452 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 452 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 451 transition count 401
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 447 transition count 397
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 447 transition count 397
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 76 place count 447 transition count 391
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 79 place count 445 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 445 transition count 389
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 81 place count 444 transition count 389
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 223 place count 373 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 371 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 370 transition count 316
Applied a total of 226 rules in 93 ms. Remains 370 /491 variables (removed 121) and now considering 316/438 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 370/491 places, 316/438 transitions.
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 481 transition count 419
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 468 transition count 419
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 468 transition count 409
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 458 transition count 409
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 450 transition count 401
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 450 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 450 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 450 transition count 399
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 449 transition count 399
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 443 transition count 393
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 443 transition count 393
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 86 place count 443 transition count 385
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 441 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 89 place count 441 transition count 382
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 93 place count 439 transition count 382
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 231 place count 370 transition count 313
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 368 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 367 transition count 311
Applied a total of 234 rules in 60 ms. Remains 367 /491 variables (removed 124) and now considering 311/438 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 367/491 places, 311/438 transitions.
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:57:56] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:57:56] [INFO ] Input system was already deterministic with 311 transitions.
RANDOM walk for 40000 steps (1194 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (232 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1339874 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1339874 steps, saw 182884 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
// Phase 1: matrix 311 rows 367 cols
[2024-05-31 23:57:59] [INFO ] Computed 58 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/220 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/255 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/284 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/291 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 240/531 variables, 291/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/549 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/549 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/550 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 68/618 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/618 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/618 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 60/678 variables, 60/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/678 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/678 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 678/678 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/220 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/255 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/284 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/291 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 240/531 variables, 291/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:58:00] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/549 variables, 10/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/550 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 68/618 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/618 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/618 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 60/678 variables, 60/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/678 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/678 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 678/678 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 256 ms.
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 311/311 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 367 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 365 transition count 307
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 14 place count 361 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 359 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 359 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 358 transition count 304
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 358 transition count 304
Applied a total of 21 rules in 34 ms. Remains 358 /367 variables (removed 9) and now considering 304/311 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 358/367 places, 304/311 transitions.
RANDOM walk for 4000000 steps (174340 resets) in 15356 ms. (260 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (37139 resets) in 5141 ms. (777 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6663836 steps, run timeout after 15001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 6663836 steps, saw 914945 distinct states, run finished after 15015 ms. (steps per millisecond=443 ) properties seen :0
// Phase 1: matrix 304 rows 358 cols
[2024-05-31 23:58:21] [INFO ] Computed 60 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/231 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/262 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/285 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/292 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/603 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/603 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 59/662 variables, 59/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/231 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/262 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/285 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/292 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 66/603 variables, 7/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/603 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/603 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 59/662 variables, 59/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 245 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-31 23:58:22] [INFO ] Invariant cache hit.
[2024-05-31 23:58:22] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 23:58:22] [INFO ] Invariant cache hit.
[2024-05-31 23:58:22] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-05-31 23:58:22] [INFO ] Redundant transitions in 5 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-31 23:58:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 2/357 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 304/661 variables, 357/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-31 23:58:35] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:58:35] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:58:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:58:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-31 23:58:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:58:39] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:58:40] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-31 23:58:46] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
(s3 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (OVERLAPS) 1/662 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/662 variables, and 426 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/355 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 2/357 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 304/661 variables, 357/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 300/725 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/662 variables, and 725 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/358 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60923 ms. Remains : 358/358 places, 304/304 transitions.
RANDOM walk for 400000 steps (17458 resets) in 2207 ms. (181 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 23:59:23] [INFO ] Invariant cache hit.
[2024-05-31 23:59:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:59:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:59:23] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:59:23] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 23:59:23] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (174218 resets) in 15062 ms. (265 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (37394 resets) in 5266 ms. (759 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6681285 steps, run timeout after 15001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 6681285 steps, saw 917915 distinct states, run finished after 15001 ms. (steps per millisecond=445 ) properties seen :0
[2024-05-31 23:59:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/231 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/262 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 23/285 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/292 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/603 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/603 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 59/662 variables, 59/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/231 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/262 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:59:44] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/285 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/292 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 245/537 variables, 292/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/603 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/603 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/603 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/662 variables, 59/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/662 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/662 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 252 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 358/358 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Applied a total of 0 rules in 6 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-31 23:59:44] [INFO ] Invariant cache hit.
[2024-05-31 23:59:45] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-31 23:59:45] [INFO ] Invariant cache hit.
[2024-05-31 23:59:45] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-31 23:59:45] [INFO ] Redundant transitions in 5 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-31 23:59:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 2/357 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 304/661 variables, 357/417 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-31 23:59:58] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:59:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-31 23:59:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-31 23:59:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 00:00:02] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:00:02] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:00:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 00:00:10] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SMT process timed out in 30251ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30905 ms. Remains : 358/358 places, 304/304 transitions.
RANDOM walk for 400000 steps (17479 resets) in 1506 ms. (265 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 00:00:16] [INFO ] Invariant cache hit.
[2024-06-01 00:00:16] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:00:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:00:16] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:00:16] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-01 00:00:16] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1721 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (353 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1346551 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1346551 steps, saw 187025 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-06-01 00:00:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/254 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/260 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/285 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/292 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/603 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 59/662 variables, 59/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/662 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/254 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/260 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/285 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/292 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 245/537 variables, 292/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/603 variables, 7/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 59/662 variables, 59/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/662 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 245 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 304/304 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 357 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 356 transition count 302
Applied a total of 3 rules in 25 ms. Remains 356 /358 variables (removed 2) and now considering 302/304 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 356/358 places, 302/304 transitions.
RANDOM walk for 40000 steps (1938 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (363 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1333580 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1333580 steps, saw 183805 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:00:23] [INFO ] Computed 60 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/252 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/277 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 238/522 variables, 284/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/535 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/537 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/599 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/599 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 59/658 variables, 59/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/658 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/252 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:00:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/277 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/284 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 238/522 variables, 284/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/522 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/535 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/537 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/599 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/599 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/658 variables, 59/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:00:24] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/658 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 725ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 247 ms.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-01 00:00:24] [INFO ] Invariant cache hit.
[2024-06-01 00:00:24] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 00:00:24] [INFO ] Invariant cache hit.
[2024-06-01 00:00:25] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-06-01 00:00:25] [INFO ] Redundant transitions in 2 ms returned []
Running 299 sub problems to find dead transitions.
[2024-06-01 00:00:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:00:33] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:00:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:00:33] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:00:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 1/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:00:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:00:48] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-06-01 00:00:48] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:00:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/658 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 424 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 302/657 variables, 355/423 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 299/722 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 722 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 8/8 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60975 ms. Remains : 356/356 places, 302/302 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 356 transition count 302
Applied a total of 1 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:01:25] [INFO ] Computed 60 invariants in 5 ms
[2024-06-01 00:01:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:01:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:01:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:01:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:01:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:01:25] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:01:25] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:01:25] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 358 transition count 304
Applied a total of 1 rules in 15 ms. Remains 358 /358 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 304 rows 358 cols
[2024-06-01 00:01:25] [INFO ] Computed 60 invariants in 8 ms
[2024-06-01 00:01:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:01:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:01:25] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:01:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:01:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:01:26] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:01:26] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:01:26] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 373 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 481 transition count 420
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 469 transition count 420
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 25 place count 469 transition count 410
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 45 place count 459 transition count 410
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 451 transition count 402
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 451 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 451 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 451 transition count 400
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 64 place count 450 transition count 400
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 444 transition count 394
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 444 transition count 394
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 84 place count 444 transition count 386
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 87 place count 442 transition count 383
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 440 transition count 383
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 233 place count 369 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 367 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 366 transition count 310
Applied a total of 236 rules in 57 ms. Remains 366 /491 variables (removed 125) and now considering 310/438 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 366/491 places, 310/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 310 transitions.
RANDOM walk for 878 steps (26 resets) in 9 ms. (87 steps per ms) remains 0/1 properties
FORMULA DES-PT-60b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 483 transition count 431
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 483 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 483 transition count 430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 478 transition count 425
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 478 transition count 425
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 478 transition count 421
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 477 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 477 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 477 transition count 419
Applied a total of 33 rules in 26 ms. Remains 477 /491 variables (removed 14) and now considering 419/438 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 477/491 places, 419/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 481 transition count 419
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 468 transition count 419
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 468 transition count 409
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 458 transition count 409
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 451 transition count 402
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 451 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 451 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 451 transition count 400
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 450 transition count 400
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 444 transition count 394
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 444 transition count 394
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 84 place count 444 transition count 386
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 442 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 87 place count 442 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 440 transition count 383
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 231 place count 370 transition count 313
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 370 transition count 313
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 368 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 367 transition count 311
Applied a total of 236 rules in 58 ms. Remains 367 /491 variables (removed 124) and now considering 311/438 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 367/491 places, 311/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 481 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 481 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 481 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 474 transition count 421
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 474 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 24 ms. Remains 473 /491 variables (removed 18) and now considering 413/438 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 473/491 places, 413/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Graph (complete) has 1164 edges and 491 vertex of which 482 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 481 transition count 419
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 468 transition count 419
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 468 transition count 409
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 458 transition count 409
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 450 transition count 401
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 450 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 450 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 450 transition count 399
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 66 place count 449 transition count 399
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 443 transition count 393
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 443 transition count 393
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 86 place count 443 transition count 385
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 441 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 89 place count 441 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 93 place count 439 transition count 382
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 233 place count 369 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 367 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 366 transition count 310
Applied a total of 236 rules in 53 ms. Remains 366 /491 variables (removed 125) and now considering 310/438 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 366/491 places, 310/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 482 transition count 430
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 482 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 482 transition count 429
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 476 transition count 423
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 476 transition count 423
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 476 transition count 418
Applied a total of 35 rules in 19 ms. Remains 476 /491 variables (removed 15) and now considering 418/438 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 476/491 places, 418/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 438/438 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 481 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 481 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 481 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 474 transition count 421
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 474 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 49 ms. Remains 473 /491 variables (removed 18) and now considering 413/438 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 473/491 places, 413/438 transitions.
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 24 ms
[2024-06-01 00:01:26] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:01:26] [INFO ] Input system was already deterministic with 413 transitions.
[2024-06-01 00:01:27] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:01:27] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:01:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 00:01:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 438 transitions and 1541 arcs took 3 ms.
Total runtime 373838 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 : DES-PT-60b-CTLCardinality-2024-00
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-01
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-02
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-03
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-04
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-05
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-06
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-09
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-10
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2024-11
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2023-12
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2023-13
Could not compute solution for formula : DES-PT-60b-CTLCardinality-2023-15

BK_STOP 1717200087403

--------------------
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 DES-PT-60b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1078/ctl_0_
ctl formula name DES-PT-60b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1078/ctl_1_
ctl formula name DES-PT-60b-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1078/ctl_2_
ctl formula name DES-PT-60b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1078/ctl_3_
ctl formula name DES-PT-60b-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1078/ctl_4_
ctl formula name DES-PT-60b-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1078/ctl_5_
ctl formula name DES-PT-60b-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1078/ctl_6_
ctl formula name DES-PT-60b-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1078/ctl_7_
ctl formula name DES-PT-60b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1078/ctl_8_
ctl formula name DES-PT-60b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1078/ctl_9_
ctl formula name DES-PT-60b-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1078/ctl_10_
ctl formula name DES-PT-60b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1078/ctl_11_
ctl formula name DES-PT-60b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1078/ctl_12_
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="DES-PT-60b"
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 DES-PT-60b, 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 r480-tall-171624189900753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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