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.r476-tall-171620505200105.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 CANInsertWithFailure-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717186583031

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:16:24] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-31 20:16:24] [INFO ] Transformed 1044 places.
[2024-05-31 20:16:24] [INFO ] Transformed 2520 transitions.
[2024-05-31 20:16:24] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 142 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 97 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:16:24] [INFO ] Computed 22 invariants in 103 ms
[2024-05-31 20:16:25] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-31 20:16:25] [INFO ] Invariant cache hit.
[2024-05-31 20:16:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:16:28] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 4333 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:16:29] [INFO ] Invariant cache hit.
[2024-05-31 20:16:29] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 31066ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 31105ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35579 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 142 out of 1043 places after structural reductions.
[2024-05-31 20:17:00] [INFO ] Flatten gal took : 150 ms
[2024-05-31 20:17:00] [INFO ] Flatten gal took : 94 ms
[2024-05-31 20:17:00] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 138 out of 1043 places (down from 142) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 2689 ms. (14 steps per ms) remains 11/76 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
[2024-05-31 20:17:01] [INFO ] Invariant cache hit.
[2024-05-31 20:17:01] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 979/1005 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1005 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 34/1039 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/1041 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2520/3561 variables, 1041/1063 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 780/1843 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 0/1843 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3563 variables, 2/1845 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3563 variables, 0/1845 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/3563 variables, 0/1845 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3563/3563 variables, and 1845 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1043/1043 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 980/1005 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 20:17:05] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 12 ms to minimize.
[2024-05-31 20:17:05] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1005 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1005 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 34/1039 variables, 17/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 40 places in 369 ms of which 6 ms to minimize.
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 5 ms to minimize.
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 4 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 4 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 4 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 3 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 2 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
SMT process timed out in 7896ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 138 rules applied. Total rules applied 274 place count 907 transition count 2382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 368 Post agglomeration using F-continuation condition.Transition count delta: 368
Deduced a syphon composed of 368 places in 1 ms
Reduce places removed 368 places and 0 transitions.
Iterating global reduction 3 with 736 rules applied. Total rules applied 1012 place count 537 transition count 2014
Drop transitions (Redundant composition of simpler transitions.) removed 332 transitions
Redundant transition composition rules discarded 332 transitions
Iterating global reduction 3 with 332 rules applied. Total rules applied 1344 place count 537 transition count 1682
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1346 place count 537 transition count 1680
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1348 place count 535 transition count 1680
Partial Free-agglomeration rule applied 409 times.
Drop transitions (Partial Free agglomeration) removed 409 transitions
Iterating global reduction 4 with 409 rules applied. Total rules applied 1757 place count 535 transition count 1680
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1777 place count 535 transition count 1680
Applied a total of 1777 rules in 378 ms. Remains 535 /1043 variables (removed 508) and now considering 1680/2520 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 535/1043 places, 1680/2520 transitions.
RANDOM walk for 40000 steps (398 resets) in 620 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 53 ms. (740 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
// Phase 1: matrix 1680 rows 535 cols
[2024-05-31 20:17:10] [INFO ] Computed 22 invariants in 26 ms
[2024-05-31 20:17:10] [INFO ] State equation strengthened by 1535 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 477/495 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 36/531 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/533 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1680/2213 variables, 533/555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2213 variables, 1535/2090 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2213 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/2215 variables, 2/2092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2215 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/2215 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2215/2215 variables, and 2092 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 535/535 constraints, ReadFeed: 1535/1535 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 477/495 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:17:12] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 36/531 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/533 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:17:13] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1680/2213 variables, 533/557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2213 variables, 1535/2092 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2213 variables, 9/2101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2213 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/2215 variables, 2/2103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2215 variables, 0/2103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/2215 variables, 0/2103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2215/2215 variables, and 2103 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 535/535 constraints, ReadFeed: 1535/1535 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 15860ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 858 ms.
Support contains 16 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 1680/1680 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 529 transition count 1674
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 529 transition count 1673
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 529 transition count 1673
Applied a total of 17 rules in 112 ms. Remains 529 /535 variables (removed 6) and now considering 1673/1680 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 529/535 places, 1673/1680 transitions.
RANDOM walk for 40000 steps (409 resets) in 567 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (16 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 349461 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 8
Probabilistic random walk after 349461 steps, saw 50603 distinct states, run finished after 3005 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1673 rows 529 cols
[2024-05-31 20:17:31] [INFO ] Computed 22 invariants in 16 ms
[2024-05-31 20:17:31] [INFO ] State equation strengthened by 1566 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 473/489 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 36/525 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/527 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1673/2200 variables, 527/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2200 variables, 1566/2115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2200 variables, 0/2115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/2202 variables, 2/2117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2202 variables, 0/2117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/2202 variables, 0/2117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 2117 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 529/529 constraints, ReadFeed: 1566/1566 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 473/489 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:17:32] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 36/525 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/527 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:17:33] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-05-31 20:17:33] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1673/2200 variables, 527/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2200 variables, 1566/2118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2200 variables, 8/2126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2200 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/2202 variables, 2/2128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2202 variables, 0/2128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/2202 variables, 0/2128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 2128 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8580 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 529/529 constraints, ReadFeed: 1566/1566 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 10141ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 16 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 1673/1673 transitions.
Applied a total of 0 rules in 27 ms. Remains 529 /529 variables (removed 0) and now considering 1673/1673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 529/529 places, 1673/1673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 1673/1673 transitions.
Applied a total of 0 rules in 26 ms. Remains 529 /529 variables (removed 0) and now considering 1673/1673 (removed 0) transitions.
[2024-05-31 20:17:41] [INFO ] Invariant cache hit.
[2024-05-31 20:17:42] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-31 20:17:42] [INFO ] Invariant cache hit.
[2024-05-31 20:17:42] [INFO ] State equation strengthened by 1566 read => feed constraints.
[2024-05-31 20:17:46] [INFO ] Implicit Places using invariants and state equation in 4243 ms returned []
Implicit Place search using SMT with State Equation took 4717 ms to find 0 implicit places.
[2024-05-31 20:17:46] [INFO ] Redundant transitions in 90 ms returned []
Running 1653 sub problems to find dead transitions.
[2024-05-31 20:17:46] [INFO ] Invariant cache hit.
[2024-05-31 20:17:46] [INFO ] State equation strengthened by 1566 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:00] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:18:00] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-31 20:18:00] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-31 20:18:01] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 3 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:18:02] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:18:03] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 2 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 6 ms to minimize.
[2024-05-31 20:18:04] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 6 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:18:05] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/2202 variables, and 62 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/529 constraints, ReadFeed: 0/1566 constraints, PredecessorRefiner: 1653/1653 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:18] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:18:18] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:18:18] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:18:18] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:18:18] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 2 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:18:19] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:18:20] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:18:21] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:18:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:18:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-31 20:18:24] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-31 20:18:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:25] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:18:25] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:18:26] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:18:27] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 3 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:28] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:18:29] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:18:30] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:18:31] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:18:32] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:32] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:18:32] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:18:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:18:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:35] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 2 ms to minimize.
[2024-05-31 20:18:36] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:18:37] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:18:38] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:18:38] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:18:38] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-31 20:18:38] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-31 20:18:38] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:18:39] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:18:41] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:18:42] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:18:42] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-31 20:18:42] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:18:42] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:18:42] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:18:43] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:18:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:18:45] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:18:46] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 1653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/2202 variables, and 302 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/529 constraints, ReadFeed: 0/1566 constraints, PredecessorRefiner: 0/1653 constraints, Known Traps: 280/280 constraints]
After SMT, in 60774ms problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65642 ms. Remains : 529/529 places, 1673/1673 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 62 ms
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 62 ms
[2024-05-31 20:18:47] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 133 out of 1043 places (down from 137) after GAL structural reductions.
Computed a total of 82 stabilizing places and 140 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 278 place count 904 transition count 2380
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 318 place count 884 transition count 2361
Applied a total of 318 rules in 94 ms. Remains 884 /1043 variables (removed 159) and now considering 2361/2520 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 884/1043 places, 2361/2520 transitions.
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 49 ms
[2024-05-31 20:18:47] [INFO ] Input system was already deterministic with 2361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 18 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 46 ms
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:18:48] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 274 place count 906 transition count 2382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 314 place count 886 transition count 2363
Applied a total of 314 rules in 117 ms. Remains 886 /1043 variables (removed 157) and now considering 2363/2520 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 127 ms. Remains : 886/1043 places, 2363/2520 transitions.
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 57 ms
[2024-05-31 20:18:48] [INFO ] Input system was already deterministic with 2363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 50 ms
[2024-05-31 20:18:48] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 45 ms
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 90 ms
[2024-05-31 20:18:48] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 883 transition count 2360
Applied a total of 320 rules in 66 ms. Remains 883 /1043 variables (removed 160) and now considering 2360/2520 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 883/1043 places, 2360/2520 transitions.
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 60 ms
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 72 ms
[2024-05-31 20:18:49] [INFO ] Input system was already deterministic with 2360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 316 place count 885 transition count 2362
Applied a total of 316 rules in 79 ms. Remains 885 /1043 variables (removed 158) and now considering 2362/2520 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 885/1043 places, 2362/2520 transitions.
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 58 ms
[2024-05-31 20:18:49] [INFO ] Input system was already deterministic with 2362 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 314 place count 886 transition count 2363
Applied a total of 314 rules in 61 ms. Remains 886 /1043 variables (removed 157) and now considering 2363/2520 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 886/1043 places, 2363/2520 transitions.
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 43 ms
[2024-05-31 20:18:49] [INFO ] Input system was already deterministic with 2363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 43 ms
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 44 ms
[2024-05-31 20:18:49] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:49] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 42 ms
[2024-05-31 20:18:50] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 51 ms
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 42 ms
[2024-05-31 20:18:50] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 40 ms
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 43 ms
[2024-05-31 20:18:50] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1043/1043 places, 2520/2520 transitions.
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 37 ms
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:18:50] [INFO ] Input system was already deterministic with 2520 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1043 transition count 2390
Reduce places removed 130 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 134 rules applied. Total rules applied 264 place count 913 transition count 2386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 909 transition count 2386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 268 place count 909 transition count 2384
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 272 place count 907 transition count 2384
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 304 place count 891 transition count 2368
Applied a total of 304 rules in 69 ms. Remains 891 /1043 variables (removed 152) and now considering 2368/2520 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 891/1043 places, 2368/2520 transitions.
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 34 ms
[2024-05-31 20:18:50] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:18:50] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 883 transition count 2360
Applied a total of 320 rules in 59 ms. Remains 883 /1043 variables (removed 160) and now considering 2360/2520 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 883/1043 places, 2360/2520 transitions.
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 34 ms
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 37 ms
[2024-05-31 20:18:51] [INFO ] Input system was already deterministic with 2360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 883 transition count 2360
Applied a total of 320 rules in 53 ms. Remains 883 /1043 variables (removed 160) and now considering 2360/2520 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 883/1043 places, 2360/2520 transitions.
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 35 ms
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:18:51] [INFO ] Input system was already deterministic with 2360 transitions.
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 39 ms
[2024-05-31 20:18:51] [INFO ] Flatten gal took : 38 ms
[2024-05-31 20:18:51] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2024-05-31 20:18:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1043 places, 2520 transitions and 6760 arcs took 10 ms.
Total runtime 147357 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 : CANInsertWithFailure-PT-020-CTLCardinality-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-020-CTLCardinality-2023-15

BK_STOP 1717186731842

--------------------
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 CANInsertWithFailure-PT-020-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1475/ctl_0_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1475/ctl_1_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1475/ctl_2_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1475/ctl_3_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1475/ctl_4_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1475/ctl_5_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1475/ctl_6_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1475/ctl_7_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1475/ctl_8_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1475/ctl_9_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1475/ctl_10_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1475/ctl_11_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1475/ctl_12_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1475/ctl_13_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1475/ctl_14_
ctl formula name CANInsertWithFailure-PT-020-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1475/ctl_15_
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="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, 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 r476-tall-171620505200105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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