MCC'2024- Execution of r069-tall-171620503600026

About the Execution of GreatSPN+red for CANConstruction-PT-030

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
12100.399	3600000.00	5062795.00	8526.60	[undef]	Time out reached

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.r069-tall-171620503600026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CANConstruction-PT-030, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 1.4M 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 CANConstruction-PT-030-CTLFireability-2024-00
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-01
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-02
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-03
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-04
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-05
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-06
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-07
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-08
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-09
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-10
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2024-11
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-12
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-13
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-14
FORMULA_NAME CANConstruction-PT-030-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716362631121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:23:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:23:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:23:52] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-22 07:23:52] [INFO ] Transformed 2162 places.
[2024-05-22 07:23:52] [INFO ] Transformed 3840 transitions.
[2024-05-22 07:23:52] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 119 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 792 places :
Symmetric choice reduction at 0 with 792 rule applications. Total rules 792 place count 1370 transition count 2256
Iterating global reduction 0 with 792 rules applied. Total rules applied 1584 place count 1370 transition count 2256
Applied a total of 1584 rules in 263 ms. Remains 1370 /2162 variables (removed 792) and now considering 2256/3840 (removed 1584) transitions.
// Phase 1: matrix 2256 rows 1370 cols
[2024-05-22 07:23:53] [INFO ] Computed 61 invariants in 45 ms
[2024-05-22 07:23:53] [INFO ] Implicit Places using invariants in 920 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 320, 334, 348, 362, 376, 404, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 952 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1342/2162 places, 2256/3840 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1314 transition count 2228
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1314 transition count 2228
Applied a total of 56 rules in 157 ms. Remains 1314 /1342 variables (removed 28) and now considering 2228/2256 (removed 28) transitions.
// Phase 1: matrix 2228 rows 1314 cols
[2024-05-22 07:23:54] [INFO ] Computed 33 invariants in 18 ms
[2024-05-22 07:23:54] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-22 07:23:54] [INFO ] Invariant cache hit.
[2024-05-22 07:23:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 07:24:02] [INFO ] Implicit Places using invariants and state equation in 7532 ms returned []
Implicit Place search using SMT with State Equation took 8333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1314/2162 places, 2228/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9723 ms. Remains : 1314/2162 places, 2228/3840 transitions.
Support contains 119 out of 1314 places after structural reductions.
[2024-05-22 07:24:02] [INFO ] Flatten gal took : 150 ms
[2024-05-22 07:24:02] [INFO ] Flatten gal took : 106 ms
[2024-05-22 07:24:03] [INFO ] Input system was already deterministic with 2228 transitions.
RANDOM walk for 40000 steps (72 resets) in 2501 ms. (15 steps per ms) remains 6/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
[2024-05-22 07:24:04] [INFO ] Invariant cache hit.
[2024-05-22 07:24:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1276/1298 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1298 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 13/1311 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/1313 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2228/3541 variables, 1313/1346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3541 variables, 1770/3116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3541 variables, 0/3116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3542 variables, 1/3117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3542 variables, 0/3117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3542 variables, 0/3117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3542/3542 variables, and 3117 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2590 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1314/1314 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1276/1298 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:24:07] [INFO ] Deduced a trap composed of 5 places in 647 ms of which 63 ms to minimize.
[2024-05-22 07:24:07] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 9 ms to minimize.
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1298 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 13/1311 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 6 ms to minimize.
[2024-05-22 07:24:09] [INFO ] Deduced a trap composed of 42 places in 423 ms of which 6 ms to minimize.
[2024-05-22 07:24:10] [INFO ] Deduced a trap composed of 51 places in 459 ms of which 7 ms to minimize.
[2024-05-22 07:24:10] [INFO ] Deduced a trap composed of 43 places in 441 ms of which 7 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 43 places in 401 ms of which 6 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 45 places in 391 ms of which 7 ms to minimize.
[2024-05-22 07:24:11] [INFO ] Deduced a trap composed of 47 places in 376 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/3542 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1314 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 7670ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 1314 transition count 2055
Reduce places removed 173 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 174 rules applied. Total rules applied 347 place count 1141 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 348 place count 1140 transition count 2054
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 348 place count 1140 transition count 2026
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 404 place count 1112 transition count 2026
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 448 place count 1068 transition count 1938
Iterating global reduction 3 with 44 rules applied. Total rules applied 492 place count 1068 transition count 1938
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 514 place count 1068 transition count 1916
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 536 place count 1046 transition count 1916
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 590 place count 1019 transition count 1889
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 594 place count 1019 transition count 1885
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 598 place count 1015 transition count 1885
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 604 place count 1015 transition count 1879
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 610 place count 1009 transition count 1879
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 620 place count 1009 transition count 1879
Applied a total of 620 rules in 698 ms. Remains 1009 /1314 variables (removed 305) and now considering 1879/2228 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 1009/1314 places, 1879/2228 transitions.
RANDOM walk for 40000 steps (191 resets) in 787 ms. (50 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
// Phase 1: matrix 1879 rows 1009 cols
[2024-05-22 07:24:12] [INFO ] Computed 33 invariants in 20 ms
[2024-05-22 07:24:12] [INFO ] State equation strengthened by 1772 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 973/990 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/990 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/1006 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1006 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/1008 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1879/2887 variables, 1008/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2887 variables, 1772/2813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2887 variables, 0/2813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/2888 variables, 1/2814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2888 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2888 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2888/2888 variables, and 2814 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1709 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1009/1009 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 973/990 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 2 places in 324 ms of which 5 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/990 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:15] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 5 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 7 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:24:16] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:24:17] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 7 ms to minimize.
[2024-05-22 07:24:18] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/990 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:24:19] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/990 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/990 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 16/1006 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 33 places in 403 ms of which 6 ms to minimize.
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 6 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-22 07:24:21] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 6 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 6 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 351 ms of which 6 ms to minimize.
[2024-05-22 07:24:22] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 14 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 6 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 37 places in 342 ms of which 6 ms to minimize.
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 34 places in 335 ms of which 6 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 5 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 6 ms to minimize.
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 39 places in 343 ms of which 6 ms to minimize.
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 12 ms to minimize.
[2024-05-22 07:24:25] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 6 ms to minimize.
[2024-05-22 07:24:26] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 5 ms to minimize.
[2024-05-22 07:24:26] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 6 ms to minimize.
[2024-05-22 07:24:26] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 5 ms to minimize.
[2024-05-22 07:24:27] [INFO ] Deduced a trap composed of 40 places in 353 ms of which 5 ms to minimize.
[2024-05-22 07:24:27] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:27] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 5 ms to minimize.
[2024-05-22 07:24:28] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2024-05-22 07:24:28] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 6 ms to minimize.
[2024-05-22 07:24:28] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 5 ms to minimize.
[2024-05-22 07:24:29] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 5 ms to minimize.
[2024-05-22 07:24:29] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:29] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 6 ms to minimize.
[2024-05-22 07:24:30] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 5 ms to minimize.
[2024-05-22 07:24:30] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 5 ms to minimize.
[2024-05-22 07:24:30] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-22 07:24:31] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 9 ms to minimize.
[2024-05-22 07:24:31] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 9 ms to minimize.
[2024-05-22 07:24:31] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 6 ms to minimize.
[2024-05-22 07:24:32] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 6 ms to minimize.
[2024-05-22 07:24:32] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 5 ms to minimize.
[2024-05-22 07:24:32] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 9 ms to minimize.
[2024-05-22 07:24:33] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 5 ms to minimize.
[2024-05-22 07:24:33] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:24:33] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:34] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:34] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 5 ms to minimize.
[2024-05-22 07:24:34] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-05-22 07:24:35] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 5 ms to minimize.
[2024-05-22 07:24:35] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:35] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 6 ms to minimize.
[2024-05-22 07:24:36] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 8 ms to minimize.
[2024-05-22 07:24:36] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 5 ms to minimize.
[2024-05-22 07:24:36] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 5 ms to minimize.
[2024-05-22 07:24:37] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:24:37] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 5 ms to minimize.
[2024-05-22 07:24:37] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 5 ms to minimize.
[2024-05-22 07:24:37] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 5 ms to minimize.
[2024-05-22 07:24:38] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 5 ms to minimize.
[2024-05-22 07:24:38] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 5 ms to minimize.
[2024-05-22 07:24:38] [INFO ] Deduced a trap composed of 33 places in 305 ms of which 5 ms to minimize.
[2024-05-22 07:24:39] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 5 ms to minimize.
[2024-05-22 07:24:39] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 6 ms to minimize.
[2024-05-22 07:24:39] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 5 ms to minimize.
[2024-05-22 07:24:40] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 5 ms to minimize.
[2024-05-22 07:24:40] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:40] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-05-22 07:24:41] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-22 07:24:41] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 5 ms to minimize.
[2024-05-22 07:24:41] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 5 ms to minimize.
[2024-05-22 07:24:42] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 5 ms to minimize.
[2024-05-22 07:24:42] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 5 ms to minimize.
[2024-05-22 07:24:42] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 5 ms to minimize.
[2024-05-22 07:24:43] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 5 ms to minimize.
[2024-05-22 07:24:43] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 5 ms to minimize.
[2024-05-22 07:24:43] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 5 ms to minimize.
[2024-05-22 07:24:44] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 5 ms to minimize.
[2024-05-22 07:24:44] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 5 ms to minimize.
[2024-05-22 07:24:44] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 5 ms to minimize.
[2024-05-22 07:24:44] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 5 ms to minimize.
[2024-05-22 07:24:45] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 5 ms to minimize.
[2024-05-22 07:24:45] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 5 ms to minimize.
[2024-05-22 07:24:45] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 5 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 4 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 5 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1006 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:47] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 5 ms to minimize.
[2024-05-22 07:24:47] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 5 ms to minimize.
[2024-05-22 07:24:47] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 5 ms to minimize.
[2024-05-22 07:24:48] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-22 07:24:48] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 5 ms to minimize.
[2024-05-22 07:24:48] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 5 ms to minimize.
[2024-05-22 07:24:48] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 5 ms to minimize.
[2024-05-22 07:24:49] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 4 ms to minimize.
[2024-05-22 07:24:49] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 5 ms to minimize.
[2024-05-22 07:24:49] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 5 ms to minimize.
[2024-05-22 07:24:50] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:24:50] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 5 ms to minimize.
[2024-05-22 07:24:50] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 5 ms to minimize.
[2024-05-22 07:24:51] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 5 ms to minimize.
[2024-05-22 07:24:51] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 5 ms to minimize.
[2024-05-22 07:24:51] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 5 ms to minimize.
[2024-05-22 07:24:52] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 5 ms to minimize.
[2024-05-22 07:24:52] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 5 ms to minimize.
[2024-05-22 07:24:52] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 13 ms to minimize.
[2024-05-22 07:24:52] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:53] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 6 ms to minimize.
[2024-05-22 07:24:53] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 5 ms to minimize.
[2024-05-22 07:24:53] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 5 ms to minimize.
[2024-05-22 07:24:54] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 5 ms to minimize.
[2024-05-22 07:24:54] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 5 ms to minimize.
[2024-05-22 07:24:54] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 5 ms to minimize.
[2024-05-22 07:24:55] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 5 ms to minimize.
[2024-05-22 07:24:55] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 5 ms to minimize.
[2024-05-22 07:24:55] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 5 ms to minimize.
[2024-05-22 07:24:56] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 9 ms to minimize.
[2024-05-22 07:24:56] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 5 ms to minimize.
[2024-05-22 07:24:56] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 5 ms to minimize.
[2024-05-22 07:24:56] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 5 ms to minimize.
[2024-05-22 07:24:57] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 4 ms to minimize.
[2024-05-22 07:24:57] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 5 ms to minimize.
[2024-05-22 07:24:57] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 5 ms to minimize.
[2024-05-22 07:24:58] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 5 ms to minimize.
[2024-05-22 07:24:58] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 5 ms to minimize.
[2024-05-22 07:24:58] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 5 ms to minimize.
[2024-05-22 07:24:59] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:24:59] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 5 ms to minimize.
[2024-05-22 07:24:59] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-05-22 07:24:59] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 5 ms to minimize.
SMT process timed out in 46985ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 1879/1879 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1009 transition count 1878
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1008 transition count 1877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1007 transition count 1877
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 1006 transition count 1876
Applied a total of 6 rules in 143 ms. Remains 1006 /1009 variables (removed 3) and now considering 1876/1879 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1006/1009 places, 1876/1879 transitions.
RANDOM walk for 40000 steps (188 resets) in 843 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
// Phase 1: matrix 1876 rows 1006 cols
[2024-05-22 07:25:00] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 07:25:00] [INFO ] State equation strengthened by 1772 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 970/985 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/985 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/1003 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/1005 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1876/2881 variables, 1005/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2881 variables, 1772/2810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2881 variables, 0/2810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/2882 variables, 1/2811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2882 variables, 0/2811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2882 variables, 0/2811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 2811 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1395 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1006/1006 constraints, ReadFeed: 1772/1772 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 970/985 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:02] [INFO ] Deduced a trap composed of 2 places in 361 ms of which 6 ms to minimize.
[2024-05-22 07:25:02] [INFO ] Deduced a trap composed of 2 places in 347 ms of which 5 ms to minimize.
[2024-05-22 07:25:03] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/985 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/985 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 18/1003 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:03] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 6 ms to minimize.
[2024-05-22 07:25:04] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 5 ms to minimize.
[2024-05-22 07:25:04] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 5 ms to minimize.
[2024-05-22 07:25:04] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
[2024-05-22 07:25:05] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 6 ms to minimize.
[2024-05-22 07:25:05] [INFO ] Deduced a trap composed of 33 places in 388 ms of which 6 ms to minimize.
[2024-05-22 07:25:06] [INFO ] Deduced a trap composed of 33 places in 403 ms of which 5 ms to minimize.
[2024-05-22 07:25:06] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 5 ms to minimize.
[2024-05-22 07:25:06] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 6 ms to minimize.
[2024-05-22 07:25:07] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 5 ms to minimize.
[2024-05-22 07:25:07] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:25:08] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 5 ms to minimize.
[2024-05-22 07:25:08] [INFO ] Deduced a trap composed of 33 places in 388 ms of which 6 ms to minimize.
[2024-05-22 07:25:09] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 5 ms to minimize.
[2024-05-22 07:25:09] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 6 ms to minimize.
[2024-05-22 07:25:09] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 5 ms to minimize.
[2024-05-22 07:25:10] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 6 ms to minimize.
[2024-05-22 07:25:10] [INFO ] Deduced a trap composed of 40 places in 410 ms of which 5 ms to minimize.
[2024-05-22 07:25:11] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 7 ms to minimize.
[2024-05-22 07:25:11] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:11] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 5 ms to minimize.
[2024-05-22 07:25:12] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 5 ms to minimize.
[2024-05-22 07:25:12] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:25:13] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 5 ms to minimize.
[2024-05-22 07:25:13] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 5 ms to minimize.
[2024-05-22 07:25:14] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 6 ms to minimize.
[2024-05-22 07:25:14] [INFO ] Deduced a trap composed of 34 places in 371 ms of which 6 ms to minimize.
[2024-05-22 07:25:14] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 6 ms to minimize.
[2024-05-22 07:25:15] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 6 ms to minimize.
[2024-05-22 07:25:15] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 5 ms to minimize.
[2024-05-22 07:25:16] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 6 ms to minimize.
[2024-05-22 07:25:16] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 6 ms to minimize.
[2024-05-22 07:25:16] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 5 ms to minimize.
[2024-05-22 07:25:17] [INFO ] Deduced a trap composed of 33 places in 388 ms of which 6 ms to minimize.
[2024-05-22 07:25:17] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 5 ms to minimize.
[2024-05-22 07:25:18] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:25:18] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:25:18] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 5 ms to minimize.
[2024-05-22 07:25:19] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 6 ms to minimize.
[2024-05-22 07:25:19] [INFO ] Deduced a trap composed of 34 places in 388 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:20] [INFO ] Deduced a trap composed of 37 places in 405 ms of which 5 ms to minimize.
[2024-05-22 07:25:20] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 5 ms to minimize.
[2024-05-22 07:25:20] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 5 ms to minimize.
[2024-05-22 07:25:21] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 6 ms to minimize.
[2024-05-22 07:25:21] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 6 ms to minimize.
[2024-05-22 07:25:22] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 6 ms to minimize.
[2024-05-22 07:25:22] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 6 ms to minimize.
[2024-05-22 07:25:22] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 7 ms to minimize.
[2024-05-22 07:25:23] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 5 ms to minimize.
[2024-05-22 07:25:23] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 5 ms to minimize.
[2024-05-22 07:25:23] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 6 ms to minimize.
[2024-05-22 07:25:24] [INFO ] Deduced a trap composed of 33 places in 371 ms of which 5 ms to minimize.
[2024-05-22 07:25:24] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 5 ms to minimize.
[2024-05-22 07:25:25] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 6 ms to minimize.
[2024-05-22 07:25:25] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 5 ms to minimize.
[2024-05-22 07:25:25] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 9 ms to minimize.
[2024-05-22 07:25:26] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 6 ms to minimize.
[2024-05-22 07:25:26] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 5 ms to minimize.
[2024-05-22 07:25:26] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 6 ms to minimize.
[2024-05-22 07:25:27] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:27] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 5 ms to minimize.
[2024-05-22 07:25:28] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 6 ms to minimize.
[2024-05-22 07:25:28] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 6 ms to minimize.
[2024-05-22 07:25:28] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 6 ms to minimize.
[2024-05-22 07:25:29] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 5 ms to minimize.
[2024-05-22 07:25:29] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 5 ms to minimize.
[2024-05-22 07:25:29] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 6 ms to minimize.
[2024-05-22 07:25:30] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 5 ms to minimize.
[2024-05-22 07:25:30] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 6 ms to minimize.
[2024-05-22 07:25:31] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 5 ms to minimize.
[2024-05-22 07:25:31] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 6 ms to minimize.
[2024-05-22 07:25:31] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 9 ms to minimize.
[2024-05-22 07:25:32] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 6 ms to minimize.
[2024-05-22 07:25:32] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 6 ms to minimize.
[2024-05-22 07:25:32] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 6 ms to minimize.
[2024-05-22 07:25:33] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 6 ms to minimize.
[2024-05-22 07:25:33] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 6 ms to minimize.
[2024-05-22 07:25:33] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 5 ms to minimize.
[2024-05-22 07:25:34] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 5 ms to minimize.
[2024-05-22 07:25:34] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:35] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 6 ms to minimize.
[2024-05-22 07:25:35] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 5 ms to minimize.
[2024-05-22 07:25:35] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 6 ms to minimize.
[2024-05-22 07:25:36] [INFO ] Deduced a trap composed of 33 places in 371 ms of which 6 ms to minimize.
[2024-05-22 07:25:36] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 5 ms to minimize.
[2024-05-22 07:25:36] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 5 ms to minimize.
[2024-05-22 07:25:37] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 5 ms to minimize.
[2024-05-22 07:25:37] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 6 ms to minimize.
[2024-05-22 07:25:38] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 5 ms to minimize.
[2024-05-22 07:25:38] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2024-05-22 07:25:38] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 5 ms to minimize.
[2024-05-22 07:25:39] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 5 ms to minimize.
[2024-05-22 07:25:39] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 5 ms to minimize.
[2024-05-22 07:25:39] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 5 ms to minimize.
[2024-05-22 07:25:40] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 5 ms to minimize.
[2024-05-22 07:25:40] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 5 ms to minimize.
[2024-05-22 07:25:40] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 5 ms to minimize.
[2024-05-22 07:25:41] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 5 ms to minimize.
[2024-05-22 07:25:41] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 5 ms to minimize.
[2024-05-22 07:25:41] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:42] [INFO ] Deduced a trap composed of 36 places in 377 ms of which 5 ms to minimize.
[2024-05-22 07:25:42] [INFO ] Deduced a trap composed of 34 places in 343 ms of which 5 ms to minimize.
[2024-05-22 07:25:42] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 5 ms to minimize.
[2024-05-22 07:25:43] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 5 ms to minimize.
[2024-05-22 07:25:43] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 5 ms to minimize.
[2024-05-22 07:25:43] [INFO ] Deduced a trap composed of 34 places in 292 ms of which 5 ms to minimize.
[2024-05-22 07:25:44] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 5 ms to minimize.
[2024-05-22 07:25:44] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 5 ms to minimize.
[2024-05-22 07:25:44] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 5 ms to minimize.
[2024-05-22 07:25:45] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 5 ms to minimize.
[2024-05-22 07:25:45] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 5 ms to minimize.
[2024-05-22 07:25:45] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 4 ms to minimize.
[2024-05-22 07:25:46] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 5 ms to minimize.
[2024-05-22 07:25:46] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 5 ms to minimize.
[2024-05-22 07:25:46] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 5 ms to minimize.
[2024-05-22 07:25:47] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 5 ms to minimize.
[2024-05-22 07:25:47] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 5 ms to minimize.
[2024-05-22 07:25:47] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 5 ms to minimize.
[2024-05-22 07:25:48] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 5 ms to minimize.
[2024-05-22 07:25:48] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1003 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:48] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 5 ms to minimize.
[2024-05-22 07:25:49] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 4 ms to minimize.
[2024-05-22 07:25:49] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 4 ms to minimize.
[2024-05-22 07:25:49] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 5 ms to minimize.
[2024-05-22 07:25:49] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2024-05-22 07:25:50] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 5 ms to minimize.
[2024-05-22 07:25:50] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 5 ms to minimize.
[2024-05-22 07:25:50] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 5 ms to minimize.
[2024-05-22 07:25:51] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 5 ms to minimize.
[2024-05-22 07:25:51] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 5 ms to minimize.
[2024-05-22 07:25:51] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 5 ms to minimize.
[2024-05-22 07:25:52] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-05-22 07:25:52] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 5 ms to minimize.
[2024-05-22 07:25:52] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 4 ms to minimize.
[2024-05-22 07:25:52] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 4 ms to minimize.
[2024-05-22 07:25:53] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 4 ms to minimize.
[2024-05-22 07:25:53] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 5 ms to minimize.
[2024-05-22 07:25:53] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 5 ms to minimize.
[2024-05-22 07:25:54] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 5 ms to minimize.
[2024-05-22 07:25:54] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1003 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:54] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 5 ms to minimize.
[2024-05-22 07:25:55] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 5 ms to minimize.
[2024-05-22 07:25:55] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 5 ms to minimize.
[2024-05-22 07:25:55] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 4 ms to minimize.
[2024-05-22 07:25:55] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-22 07:25:56] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 5 ms to minimize.
[2024-05-22 07:25:56] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 4 ms to minimize.
[2024-05-22 07:25:56] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 4 ms to minimize.
[2024-05-22 07:25:57] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 4 ms to minimize.
[2024-05-22 07:25:57] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 4 ms to minimize.
[2024-05-22 07:25:57] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 5 ms to minimize.
[2024-05-22 07:25:57] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 4 ms to minimize.
[2024-05-22 07:25:58] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:25:58] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:25:58] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 4 ms to minimize.
[2024-05-22 07:25:58] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-22 07:25:58] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:25:59] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:25:59] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:25:59] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1003 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:25:59] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 4 ms to minimize.
[2024-05-22 07:26:00] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 4 ms to minimize.
[2024-05-22 07:26:00] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 4 ms to minimize.
[2024-05-22 07:26:00] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:26:00] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 4 ms to minimize.
[2024-05-22 07:26:01] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 4 ms to minimize.
[2024-05-22 07:26:01] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:26:01] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:26:02] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 5 ms to minimize.
[2024-05-22 07:26:02] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 4 ms to minimize.
[2024-05-22 07:26:02] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 4 ms to minimize.
[2024-05-22 07:26:02] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:26:02] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-22 07:26:03] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 5 ms to minimize.
[2024-05-22 07:26:03] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 4 ms to minimize.
[2024-05-22 07:26:03] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 4 ms to minimize.
[2024-05-22 07:26:04] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 4 ms to minimize.
[2024-05-22 07:26:04] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 5 ms to minimize.
[2024-05-22 07:26:04] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
[2024-05-22 07:26:04] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:26:05] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:26:05] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 4 ms to minimize.
[2024-05-22 07:26:05] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 5 ms to minimize.
[2024-05-22 07:26:05] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 4 ms to minimize.
[2024-05-22 07:26:06] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:26:06] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:26:06] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 4 ms to minimize.
[2024-05-22 07:26:06] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 4 ms to minimize.
[2024-05-22 07:26:06] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 3 ms to minimize.
[2024-05-22 07:26:07] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:26:07] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-22 07:26:07] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:26:07] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2024-05-22 07:26:08] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-05-22 07:26:08] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:26:08] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:26:08] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-05-22 07:26:08] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 3 ms to minimize.
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:26:10] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2024-05-22 07:26:10] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 4 ms to minimize.
[2024-05-22 07:26:10] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:26:10] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-05-22 07:26:10] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 18 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 4 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:26:12] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:26:12] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:26:12] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 3 ms to minimize.
[2024-05-22 07:26:12] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:26:12] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:26:14] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:26:14] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 4 ms to minimize.
[2024-05-22 07:26:14] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 4 ms to minimize.
[2024-05-22 07:26:14] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 4 ms to minimize.
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 4 ms to minimize.
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 11/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 4 ms to minimize.
[2024-05-22 07:26:16] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-22 07:26:16] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 5 ms to minimize.
[2024-05-22 07:26:16] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 4 ms to minimize.
[2024-05-22 07:26:17] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 4 ms to minimize.
[2024-05-22 07:26:17] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 76697ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 1876/1876 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 1874
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 1874
Applied a total of 2 rules in 109 ms. Remains 1005 /1006 variables (removed 1) and now considering 1874/1876 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1005/1006 places, 1874/1876 transitions.
[2024-05-22 07:26:17] [INFO ] Flatten gal took : 130 ms
[2024-05-22 07:26:17] [INFO ] Flatten gal took : 91 ms
[2024-05-22 07:26:17] [INFO ] Input system was already deterministic with 2228 transitions.
Computed a total of 93 stabilizing places and 122 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 210 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-22 07:26:18] [INFO ] Flatten gal took : 67 ms
[2024-05-22 07:26:18] [INFO ] Flatten gal took : 58 ms
[2024-05-22 07:26:18] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1273 transition count 2146
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1273 transition count 2146
Applied a total of 82 rules in 112 ms. Remains 1273 /1314 variables (removed 41) and now considering 2146/2228 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 1273/1314 places, 2146/2228 transitions.
[2024-05-22 07:26:18] [INFO ] Flatten gal took : 52 ms
[2024-05-22 07:26:18] [INFO ] Flatten gal took : 53 ms
[2024-05-22 07:26:18] [INFO ] Input system was already deterministic with 2146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 1314 transition count 2048
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 360 place count 1134 transition count 2048
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 360 place count 1134 transition count 2019
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 418 place count 1105 transition count 2019
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 465 place count 1058 transition count 1925
Iterating global reduction 2 with 47 rules applied. Total rules applied 512 place count 1058 transition count 1925
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 537 place count 1058 transition count 1900
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 562 place count 1033 transition count 1900
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 616 place count 1006 transition count 1873
Applied a total of 616 rules in 338 ms. Remains 1006 /1314 variables (removed 308) and now considering 1873/2228 (removed 355) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 339 ms. Remains : 1006/1314 places, 1873/2228 transitions.
[2024-05-22 07:26:19] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:26:19] [INFO ] Flatten gal took : 48 ms
[2024-05-22 07:26:19] [INFO ] Input system was already deterministic with 1873 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1273 transition count 2146
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1273 transition count 2146
Applied a total of 82 rules in 189 ms. Remains 1273 /1314 variables (removed 41) and now considering 2146/2228 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 1273/1314 places, 2146/2228 transitions.
[2024-05-22 07:26:19] [INFO ] Flatten gal took : 91 ms
[2024-05-22 07:26:19] [INFO ] Flatten gal took : 101 ms
[2024-05-22 07:26:20] [INFO ] Input system was already deterministic with 2146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 424 place count 1102 transition count 2016
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 470 place count 1056 transition count 1924
Iterating global reduction 2 with 46 rules applied. Total rules applied 516 place count 1056 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 24 rules applied. Total rules applied 540 place count 1056 transition count 1900
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 564 place count 1032 transition count 1900
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 628 place count 1000 transition count 1868
Applied a total of 628 rules in 359 ms. Remains 1000 /1314 variables (removed 314) and now considering 1868/2228 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 360 ms. Remains : 1000/1314 places, 1868/2228 transitions.
[2024-05-22 07:26:20] [INFO ] Flatten gal took : 82 ms
[2024-05-22 07:26:20] [INFO ] Flatten gal took : 93 ms
[2024-05-22 07:26:20] [INFO ] Input system was already deterministic with 1868 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1267 transition count 2134
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1267 transition count 2134
Applied a total of 94 rules in 160 ms. Remains 1267 /1314 variables (removed 47) and now considering 2134/2228 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 1267/1314 places, 2134/2228 transitions.
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 66 ms
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 98 ms
[2024-05-22 07:26:21] [INFO ] Input system was already deterministic with 2134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 131 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 76 ms
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 50 ms
[2024-05-22 07:26:21] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1271 transition count 2142
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1271 transition count 2142
Applied a total of 86 rules in 82 ms. Remains 1271 /1314 variables (removed 43) and now considering 2142/2228 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1271/1314 places, 2142/2228 transitions.
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:26:21] [INFO ] Flatten gal took : 48 ms
[2024-05-22 07:26:22] [INFO ] Input system was already deterministic with 2142 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 1314 transition count 2047
Reduce places removed 181 places and 0 transitions.
Iterating post reduction 1 with 181 rules applied. Total rules applied 362 place count 1133 transition count 2047
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 362 place count 1133 transition count 2019
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 418 place count 1105 transition count 2019
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 465 place count 1058 transition count 1925
Iterating global reduction 2 with 47 rules applied. Total rules applied 512 place count 1058 transition count 1925
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 26 rules applied. Total rules applied 538 place count 1058 transition count 1899
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 564 place count 1032 transition count 1899
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 618 place count 1005 transition count 1872
Applied a total of 618 rules in 239 ms. Remains 1005 /1314 variables (removed 309) and now considering 1872/2228 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 239 ms. Remains : 1005/1314 places, 1872/2228 transitions.
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 71 ms
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 60 ms
[2024-05-22 07:26:22] [INFO ] Input system was already deterministic with 1872 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1269 transition count 2138
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1269 transition count 2138
Applied a total of 90 rules in 62 ms. Remains 1269 /1314 variables (removed 45) and now considering 2138/2228 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 1269/1314 places, 2138/2228 transitions.
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 53 ms
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 54 ms
[2024-05-22 07:26:22] [INFO ] Input system was already deterministic with 2138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1274 transition count 2148
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1274 transition count 2148
Applied a total of 80 rules in 63 ms. Remains 1274 /1314 variables (removed 40) and now considering 2148/2228 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1274/1314 places, 2148/2228 transitions.
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 38 ms
[2024-05-22 07:26:22] [INFO ] Flatten gal took : 43 ms
[2024-05-22 07:26:23] [INFO ] Input system was already deterministic with 2148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 424 place count 1102 transition count 2016
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 471 place count 1055 transition count 1922
Iterating global reduction 2 with 47 rules applied. Total rules applied 518 place count 1055 transition count 1922
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 543 place count 1055 transition count 1897
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 568 place count 1030 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 630 place count 999 transition count 1866
Applied a total of 630 rules in 251 ms. Remains 999 /1314 variables (removed 315) and now considering 1866/2228 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 252 ms. Remains : 999/1314 places, 1866/2228 transitions.
[2024-05-22 07:26:23] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:26:23] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:26:23] [INFO ] Input system was already deterministic with 1866 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2044
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2044
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 368 place count 1130 transition count 2016
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 424 place count 1102 transition count 2016
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 471 place count 1055 transition count 1922
Iterating global reduction 2 with 47 rules applied. Total rules applied 518 place count 1055 transition count 1922
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 543 place count 1055 transition count 1897
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 568 place count 1030 transition count 1897
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 628 place count 1000 transition count 1867
Applied a total of 628 rules in 166 ms. Remains 1000 /1314 variables (removed 314) and now considering 1867/2228 (removed 361) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 1000/1314 places, 1867/2228 transitions.
[2024-05-22 07:26:23] [INFO ] Flatten gal took : 35 ms
[2024-05-22 07:26:23] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:26:23] [INFO ] Input system was already deterministic with 1867 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1314 transition count 2046
Reduce places removed 182 places and 0 transitions.
Iterating post reduction 1 with 182 rules applied. Total rules applied 364 place count 1132 transition count 2046
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 364 place count 1132 transition count 2018
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 420 place count 1104 transition count 2018
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 467 place count 1057 transition count 1924
Iterating global reduction 2 with 47 rules applied. Total rules applied 514 place count 1057 transition count 1924
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 2 with 25 rules applied. Total rules applied 539 place count 1057 transition count 1899
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 564 place count 1032 transition count 1899
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 620 place count 1004 transition count 1871
Applied a total of 620 rules in 119 ms. Remains 1004 /1314 variables (removed 310) and now considering 1871/2228 (removed 357) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 119 ms. Remains : 1004/1314 places, 1871/2228 transitions.
[2024-05-22 07:26:23] [INFO ] Flatten gal took : 34 ms
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 38 ms
[2024-05-22 07:26:24] [INFO ] Input system was already deterministic with 1871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1271 transition count 2142
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1271 transition count 2142
Applied a total of 86 rules in 65 ms. Remains 1271 /1314 variables (removed 43) and now considering 2142/2228 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 1271/1314 places, 2142/2228 transitions.
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 36 ms
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:26:24] [INFO ] Input system was already deterministic with 2142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 2228/2228 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1268 transition count 2136
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1268 transition count 2136
Applied a total of 92 rules in 62 ms. Remains 1268 /1314 variables (removed 46) and now considering 2136/2228 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1268/1314 places, 2136/2228 transitions.
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:26:24] [INFO ] Input system was already deterministic with 2136 transitions.
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 41 ms
[2024-05-22 07:26:24] [INFO ] Flatten gal took : 44 ms
[2024-05-22 07:26:24] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-05-22 07:26:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1314 places, 2228 transitions and 8064 arcs took 20 ms.
Total runtime 152456 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-030

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1314
TRANSITIONS: 2228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.003s]

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

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

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

Process ID: 1800
MODEL NAME: /home/mcc/execution/422/model
1314 places, 2228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-030"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANConstruction-PT-030, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503600026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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