fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734901400313
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-19

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
977.039 144749.00 200300.00 403.40 ??T??????T???F?? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901400313.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 FireWire-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 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 FireWire-PT-19-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357660170

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:47:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:47:41] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 19:47:41] [INFO ] Transformed 602 places.
[2024-06-02 19:47:41] [INFO ] Transformed 944 transitions.
[2024-06-02 19:47:41] [INFO ] Found NUPN structural information;
[2024-06-02 19:47:41] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 124 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 597 transition count 944
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 508 transition count 855
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 508 transition count 855
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 197 place count 494 transition count 836
Iterating global reduction 1 with 14 rules applied. Total rules applied 211 place count 494 transition count 836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 494 transition count 834
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 492 transition count 832
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 492 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 491 transition count 831
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 491 transition count 831
Applied a total of 219 rules in 120 ms. Remains 491 /602 variables (removed 111) and now considering 831/944 (removed 113) transitions.
// Phase 1: matrix 831 rows 491 cols
[2024-06-02 19:47:41] [INFO ] Computed 10 invariants in 23 ms
[2024-06-02 19:47:42] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-02 19:47:42] [INFO ] Invariant cache hit.
[2024-06-02 19:47:42] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-02 19:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 19:47:55] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 14 ms to minimize.
[2024-06-02 19:47:55] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:47:57] [INFO ] Deduced a trap composed of 108 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:47:57] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:47:58] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:47:58] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:47:59] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:47:59] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:47:59] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:48:00] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:48:00] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:48:00] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:48:00] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:48:01] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 3 ms to minimize.
[2024-06-02 19:48:04] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:48:06] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 19:48:07] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:48:09] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:48:10] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:48:11] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:48:11] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:48:11] [INFO ] Deduced a trap composed of 186 places in 164 ms of which 2 ms to minimize.
[2024-06-02 19:48:12] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 2 ms to minimize.
[2024-06-02 19:48:12] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1322 variables, and 37 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 19:48:20] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 19:48:30] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:48:32] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:48:33] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1322 variables, and 42 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 32/32 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Starting structural reductions in LTL mode, iteration 1 : 491/602 places, 831/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61536 ms. Remains : 491/602 places, 831/944 transitions.
Support contains 124 out of 491 places after structural reductions.
[2024-06-02 19:48:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:48:43] [INFO ] Flatten gal took : 87 ms
[2024-06-02 19:48:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:48:43] [INFO ] Flatten gal took : 46 ms
[2024-06-02 19:48:43] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 94 out of 491 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2113 ms. (18 steps per ms) remains 37/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
[2024-06-02 19:48:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/417 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 11/428 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 778/1206 variables, 428/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 51/1257 variables, 26/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 0/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 38/1295 variables, 21/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 17/1312 variables, 10/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1312 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 9/1321 variables, 5/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 1/1322 variables, 1/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 501 constraints, problems are : Problem set: 2 solved, 35 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 353/405 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 23/428 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 19:48:50] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:48:50] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:48:50] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 19:48:51] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 778/1206 variables, 428/445 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 31/476 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 19:48:52] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:48:53] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:48:53] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:48:53] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1206 variables, 4/480 constraints. Problems are: Problem set: 2 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1322 variables, and 480 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 428/491 constraints, PredecessorRefiner: 31/37 constraints, Known Traps: 11/11 constraints]
After SMT, in 9810ms problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 316 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1406 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 472 transition count 732
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 79 rules applied. Total rules applied 159 place count 395 transition count 730
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 394 transition count 722
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 178 place count 386 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 385 transition count 720
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 179 place count 385 transition count 691
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 237 place count 356 transition count 691
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 247 place count 346 transition count 681
Iterating global reduction 5 with 10 rules applied. Total rules applied 257 place count 346 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 346 transition count 680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 258 place count 346 transition count 678
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 262 place count 344 transition count 678
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 265 place count 341 transition count 675
Iterating global reduction 6 with 3 rules applied. Total rules applied 268 place count 341 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 270 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 340 transition count 673
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 369 place count 291 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 370 place count 290 transition count 594
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 290 transition count 594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 429 place count 261 transition count 702
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 433 place count 261 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 455 place count 261 transition count 676
Free-agglomeration rule applied 34 times.
Iterating global reduction 9 with 34 rules applied. Total rules applied 489 place count 261 transition count 642
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 38 rules applied. Total rules applied 527 place count 227 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 10 with 114 rules applied. Total rules applied 641 place count 227 transition count 524
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 646 place count 227 transition count 524
Applied a total of 646 rules in 259 ms. Remains 227 /491 variables (removed 264) and now considering 524/831 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 227/491 places, 524/831 transitions.
RANDOM walk for 40000 steps (1002 resets) in 866 ms. (46 steps per ms) remains 16/35 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
[2024-06-02 19:48:54] [INFO ] Flow matrix only has 512 transitions (discarded 12 similar events)
// Phase 1: matrix 512 rows 227 cols
[2024-06-02 19:48:54] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:48:54] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 177/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/216 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 509/725 variables, 216/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 83/309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 11/736 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/738 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/738 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/739 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 322 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 177/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 14/216 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 509/725 variables, 216/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 83/316 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 12/328 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:57] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:57] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/725 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 14 (OVERLAPS) 11/736 variables, 9/339 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/736 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 2/738 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/738 variables, 2/344 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/738 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 1/739 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/739 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/739 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 345 constraints, problems are : Problem set: 1 solved, 14 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 4498ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 11 properties in 6696 ms.
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 524/524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 227 transition count 507
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 210 transition count 507
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 34 place count 210 transition count 503
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 42 place count 206 transition count 503
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 206 transition count 502
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 202 transition count 495
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 202 transition count 495
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 202 transition count 494
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 201 transition count 494
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 83 place count 186 transition count 478
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 90 place count 186 transition count 471
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 116 place count 173 transition count 486
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 122 place count 173 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 159 place count 173 transition count 443
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 173 transition count 440
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 165 place count 170 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 170 transition count 439
Applied a total of 166 rules in 71 ms. Remains 170 /227 variables (removed 57) and now considering 439/524 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 170/227 places, 439/524 transitions.
RANDOM walk for 40000 steps (1532 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (316 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (322 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (322 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 655238 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :1 out of 3
Probabilistic random walk after 655238 steps, saw 217399 distinct states, run finished after 3005 ms. (steps per millisecond=218 ) properties seen :1
[2024-06-02 19:49:09] [INFO ] Flow matrix only has 384 transitions (discarded 55 similar events)
// Phase 1: matrix 384 rows 170 cols
[2024-06-02 19:49:09] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:49:09] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/164 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 383/547 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 84/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/553 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/554 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/554 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/164 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:49:09] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:49:09] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 383/547 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 84/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/553 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:49:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:49:09] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/554 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 819ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 439/439 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 168 transition count 434
Applied a total of 6 rules in 28 ms. Remains 168 /170 variables (removed 2) and now considering 434/439 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 168/170 places, 434/439 transitions.
RANDOM walk for 40000 steps (1578 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (332 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (329 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 599998 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 2
Probabilistic random walk after 599998 steps, saw 203045 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2024-06-02 19:49:13] [INFO ] Flow matrix only has 380 transitions (discarded 54 similar events)
// Phase 1: matrix 380 rows 168 cols
[2024-06-02 19:49:13] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 19:49:13] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/162 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 379/541 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 83/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/547 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/548 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/548 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/548 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/162 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 379/541 variables, 162/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 83/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/547 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/548 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 268 ms.
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 168/168 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 19:49:14] [INFO ] Flow matrix only has 380 transitions (discarded 54 similar events)
[2024-06-02 19:49:14] [INFO ] Invariant cache hit.
[2024-06-02 19:49:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:49:14] [INFO ] Flow matrix only has 380 transitions (discarded 54 similar events)
[2024-06-02 19:49:14] [INFO ] Invariant cache hit.
[2024-06-02 19:49:14] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 19:49:14] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 19:49:14] [INFO ] Redundant transitions in 32 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 19:49:14] [INFO ] Flow matrix only has 380 transitions (discarded 54 similar events)
[2024-06-02 19:49:14] [INFO ] Invariant cache hit.
[2024-06-02 19:49:14] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:49:18] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:49:19] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 380/548 variables, 168/184 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 85/269 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 269 constraints, problems are : Problem set: 0 solved, 430 unsolved in 18511 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 380/548 variables, 168/184 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 85/269 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 430/699 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 699 constraints, problems are : Problem set: 0 solved, 430 unsolved in 28978 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 6/6 constraints]
After SMT, in 47794ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 47803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48292 ms. Remains : 168/168 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 152 edges and 168 vertex of which 23 / 168 are part of one of the 4 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (complete) has 624 edges and 149 vertex of which 146 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 146 transition count 323
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 142 transition count 319
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 142 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 142 transition count 315
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 140 transition count 313
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 138 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 138 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 48 place count 138 transition count 290
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 52 place count 138 transition count 286
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 58 place count 134 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 133 transition count 284
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 6 with 8 rules applied. Total rules applied 67 place count 129 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 72 place count 129 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 74 place count 129 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 76 place count 128 transition count 272
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 85 place count 128 transition count 263
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 95 place count 119 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 97 place count 119 transition count 260
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 119 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 99 place count 118 transition count 259
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 106 place count 118 transition count 259
Applied a total of 106 rules in 41 ms. Remains 118 /168 variables (removed 50) and now considering 259/434 (removed 175) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:50:02] [INFO ] Flow matrix only has 257 transitions (discarded 2 similar events)
// Phase 1: matrix 257 rows 118 cols
[2024-06-02 19:50:02] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:50:02] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:50:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:50:02] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 19:50:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 19:50:02] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:50:02] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:50:02] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 261 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA FireWire-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:50:02] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:50:02] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:50:02] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 72 out of 491 places (down from 76) after GAL structural reductions.
Computed a total of 83 stabilizing places and 86 stable transitions
Graph (complete) has 1426 edges and 491 vertex of which 487 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 385 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 471 transition count 709
Reduce places removed 105 places and 0 transitions.
Ensure Unique test 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 1 with 109 rules applied. Total rules applied 216 place count 366 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 364 transition count 705
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 364 transition count 677
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 336 transition count 677
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 298 place count 312 transition count 650
Iterating global reduction 3 with 24 rules applied. Total rules applied 322 place count 312 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 324 place count 312 transition count 648
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 324 place count 312 transition count 640
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 340 place count 304 transition count 640
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 345 place count 299 transition count 605
Iterating global reduction 4 with 5 rules applied. Total rules applied 350 place count 299 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 352 place count 299 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 298 transition count 603
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 423 place count 263 transition count 568
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 426 place count 260 transition count 534
Iterating global reduction 6 with 3 rules applied. Total rules applied 429 place count 260 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 430 place count 260 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 431 place count 260 transition count 533
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 433 place count 258 transition count 531
Applied a total of 433 rules in 80 ms. Remains 258 /491 variables (removed 233) and now considering 531/831 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 258/491 places, 531/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 442 transition count 782
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 442 transition count 782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 430 transition count 741
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 430 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 430 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 428 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 428 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 426 transition count 735
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 426 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 733
Applied a total of 132 rules in 25 ms. Remains 424 /491 variables (removed 67) and now considering 733/831 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 424/491 places, 733/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 733 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 112 place count 426 transition count 734
Iterating global reduction 1 with 14 rules applied. Total rules applied 126 place count 426 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 128 place count 426 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Applied a total of 140 rules in 24 ms. Remains 420 /491 variables (removed 71) and now considering 726/831 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 420/491 places, 726/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 726 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 52 place count 439 transition count 779
Iterating global reduction 1 with 48 rules applied. Total rules applied 100 place count 439 transition count 779
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 115 place count 424 transition count 732
Iterating global reduction 1 with 15 rules applied. Total rules applied 130 place count 424 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 418 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 418 transition count 724
Applied a total of 144 rules in 25 ms. Remains 418 /491 variables (removed 73) and now considering 724/831 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 418/491 places, 724/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 387 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test 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 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 301 place count 311 transition count 648
Iterating global reduction 4 with 23 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 326 place count 311 transition count 639
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 340 place count 304 transition count 639
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 345 place count 299 transition count 604
Iterating global reduction 5 with 5 rules applied. Total rules applied 350 place count 299 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 352 place count 299 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 353 place count 298 transition count 602
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 423 place count 263 transition count 567
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 426 place count 260 transition count 533
Iterating global reduction 7 with 3 rules applied. Total rules applied 429 place count 260 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 430 place count 260 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 431 place count 259 transition count 531
Applied a total of 431 rules in 53 ms. Remains 259 /491 variables (removed 232) and now considering 531/831 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 259/491 places, 531/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 473 transition count 710
Reduce places removed 105 places and 0 transitions.
Ensure Unique test 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 1 with 109 rules applied. Total rules applied 216 place count 368 transition count 706
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 366 transition count 706
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 366 transition count 678
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 338 transition count 678
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 296 place count 316 transition count 652
Iterating global reduction 3 with 22 rules applied. Total rules applied 318 place count 316 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 316 transition count 651
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 319 place count 316 transition count 644
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 333 place count 309 transition count 644
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 337 place count 305 transition count 611
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 305 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 343 place count 305 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 304 transition count 609
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 420 place count 266 transition count 571
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 423 place count 263 transition count 537
Iterating global reduction 6 with 3 rules applied. Total rules applied 426 place count 263 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 263 transition count 536
Applied a total of 427 rules in 44 ms. Remains 263 /491 variables (removed 228) and now considering 536/831 (removed 295) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 263/491 places, 536/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 536 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 113 place count 425 transition count 733
Iterating global reduction 1 with 15 rules applied. Total rules applied 128 place count 425 transition count 733
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 130 place count 425 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 423 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 423 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 421 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 421 transition count 727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 419 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 419 transition count 725
Applied a total of 142 rules in 24 ms. Remains 419 /491 variables (removed 72) and now considering 725/831 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 419/491 places, 725/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 725 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 50 place count 441 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 97 place count 441 transition count 780
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 110 place count 428 transition count 735
Iterating global reduction 1 with 13 rules applied. Total rules applied 123 place count 428 transition count 735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 428 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 426 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 426 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 424 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 424 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 422 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 422 transition count 727
Applied a total of 137 rules in 24 ms. Remains 422 /491 variables (removed 69) and now considering 727/831 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 422/491 places, 727/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:50:03] [INFO ] Input system was already deterministic with 727 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 441 transition count 781
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 441 transition count 781
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 109 place count 428 transition count 736
Iterating global reduction 1 with 13 rules applied. Total rules applied 122 place count 428 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 428 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 426 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 426 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 424 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 422 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 422 transition count 729
Applied a total of 135 rules in 24 ms. Remains 422 /491 variables (removed 69) and now considering 729/831 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 422/491 places, 729/831 transitions.
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:50:03] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:50:04] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 388 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 471 transition count 707
Reduce places removed 107 places and 0 transitions.
Ensure Unique test 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 1 with 111 rules applied. Total rules applied 220 place count 364 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 302 place count 310 transition count 647
Iterating global reduction 3 with 24 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 328 place count 310 transition count 638
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 256 transition count 528
Applied a total of 437 rules in 59 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:50:04] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test 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 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 363 transition count 704
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 220 place count 363 transition count 676
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 300 place count 311 transition count 648
Iterating global reduction 3 with 24 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 326 place count 311 transition count 638
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 425 place count 262 transition count 566
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 428 place count 259 transition count 532
Iterating global reduction 6 with 3 rules applied. Total rules applied 431 place count 259 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 259 transition count 531
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 257 transition count 529
Applied a total of 434 rules in 53 ms. Remains 257 /491 variables (removed 234) and now considering 529/831 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 257/491 places, 529/831 transitions.
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:50:04] [INFO ] Input system was already deterministic with 529 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 447 transition count 788
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 447 transition count 788
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 436 transition count 747
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 436 transition count 747
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 436 transition count 745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 435 transition count 744
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 435 transition count 744
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 434 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 434 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 433 transition count 742
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 433 transition count 742
Applied a total of 115 rules in 23 ms. Remains 433 /491 variables (removed 58) and now considering 742/831 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 433/491 places, 742/831 transitions.
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:50:04] [INFO ] Input system was already deterministic with 742 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test 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 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 222 place count 362 transition count 676
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 301 place count 310 transition count 647
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 328 place count 310 transition count 637
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 344 place count 302 transition count 637
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 349 place count 297 transition count 602
Iterating global reduction 5 with 5 rules applied. Total rules applied 354 place count 297 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 356 place count 297 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 296 transition count 600
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 14 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 436 place count 256 transition count 528
Applied a total of 436 rules in 68 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:50:04] [INFO ] Input system was already deterministic with 528 transitions.
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:50:04] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:50:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 831 transitions and 2522 arcs took 6 ms.
Total runtime 143281 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 : FireWire-PT-19-CTLCardinality-2024-00
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-04
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-11
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-14
Could not compute solution for formula : FireWire-PT-19-CTLCardinality-2024-15

BK_STOP 1717357804919

--------------------
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 FireWire-PT-19-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/763/ctl_0_
ctl formula name FireWire-PT-19-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/763/ctl_1_
ctl formula name FireWire-PT-19-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/763/ctl_2_
ctl formula name FireWire-PT-19-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/763/ctl_3_
ctl formula name FireWire-PT-19-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/763/ctl_4_
ctl formula name FireWire-PT-19-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/763/ctl_5_
ctl formula name FireWire-PT-19-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/763/ctl_6_
ctl formula name FireWire-PT-19-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/763/ctl_7_
ctl formula name FireWire-PT-19-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/763/ctl_8_
ctl formula name FireWire-PT-19-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/763/ctl_9_
ctl formula name FireWire-PT-19-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/763/ctl_10_
ctl formula name FireWire-PT-19-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/763/ctl_11_
ctl formula name FireWire-PT-19-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/763/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="FireWire-PT-19"
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 FireWire-PT-19, 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 r553-tall-171734901400313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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