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

About the Execution of GreatSPN+red for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12338.924 3600000.00 13396999.00 810.30 ??????????????T? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716949527243

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 02:25:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 02:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:25:28] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2024-05-29 02:25:29] [INFO ] Transformed 7003 places.
[2024-05-29 02:25:29] [INFO ] Transformed 6503 transitions.
[2024-05-29 02:25:29] [INFO ] Found NUPN structural information;
[2024-05-29 02:25:29] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 675 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 101 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1081 places :
Symmetric choice reduction at 0 with 1081 rule applications. Total rules 1081 place count 5922 transition count 5422
Iterating global reduction 0 with 1081 rules applied. Total rules applied 2162 place count 5922 transition count 5422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2163 place count 5921 transition count 5421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2164 place count 5921 transition count 5421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2165 place count 5920 transition count 5420
Iterating global reduction 0 with 1 rules applied. Total rules applied 2166 place count 5920 transition count 5420
Applied a total of 2166 rules in 4089 ms. Remains 5920 /7003 variables (removed 1083) and now considering 5420/6503 (removed 1083) transitions.
// Phase 1: matrix 5420 rows 5920 cols
[2024-05-29 02:25:33] [INFO ] Computed 901 invariants in 65 ms
[2024-05-29 02:25:35] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2024-05-29 02:25:35] [INFO ] Invariant cache hit.
[2024-05-29 02:25:43] [INFO ] Implicit Places using invariants and state equation in 7324 ms returned []
Implicit Place search using SMT with State Equation took 9710 ms to find 0 implicit places.
Running 5419 sub problems to find dead transitions.
[2024-05-29 02:25:43] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5919/11340 variables, and 0 constraints, problems are : Problem set: 0 solved, 5419 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5920 constraints, PredecessorRefiner: 5419/5419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5419 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5919/11340 variables, and 0 constraints, problems are : Problem set: 0 solved, 5419 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5920 constraints, PredecessorRefiner: 0/5419 constraints, Known Traps: 0/0 constraints]
After SMT, in 63106ms problems are : Problem set: 0 solved, 5419 unsolved
Search for dead transitions found 0 dead transitions in 63182ms
Starting structural reductions in LTL mode, iteration 1 : 5920/7003 places, 5420/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77027 ms. Remains : 5920/7003 places, 5420/6503 transitions.
Support contains 101 out of 5920 places after structural reductions.
[2024-05-29 02:26:46] [INFO ] Flatten gal took : 306 ms
[2024-05-29 02:26:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 02:26:47] [INFO ] Flatten gal took : 172 ms
[2024-05-29 02:26:47] [INFO ] Input system was already deterministic with 5420 transitions.
Support contains 83 out of 5920 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2355 ms. (16 steps per ms) remains 28/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
[2024-05-29 02:26:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 648/692 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 5228/5920 variables, 836/901 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5920 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 5420/11340 variables, 5920/6821 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11340/11340 variables, and 6821 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 5920/5920 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 648/692 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 5228/5920 variables, 836/901 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-29 02:26:56] [INFO ] Deduced a trap composed of 44 places in 812 ms of which 95 ms to minimize.
[2024-05-29 02:26:57] [INFO ] Deduced a trap composed of 40 places in 737 ms of which 12 ms to minimize.
[2024-05-29 02:26:58] [INFO ] Deduced a trap composed of 17 places in 693 ms of which 11 ms to minimize.
[2024-05-29 02:26:58] [INFO ] Deduced a trap composed of 28 places in 698 ms of which 11 ms to minimize.
SMT process timed out in 10211ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 5920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1173 transitions
Trivial Post-agglo rules discarded 1173 transitions
Performed 1173 trivial Post agglomeration. Transition count delta: 1173
Iterating post reduction 0 with 1173 rules applied. Total rules applied 1173 place count 5920 transition count 4247
Reduce places removed 1173 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1183 rules applied. Total rules applied 2356 place count 4747 transition count 4237
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2366 place count 4737 transition count 4237
Performed 787 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 787 Pre rules applied. Total rules applied 2366 place count 4737 transition count 3450
Deduced a syphon composed of 787 places in 13 ms
Reduce places removed 787 places and 0 transitions.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 3940 place count 3950 transition count 3450
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 3951 place count 3939 transition count 3439
Iterating global reduction 3 with 11 rules applied. Total rules applied 3962 place count 3939 transition count 3439
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 3962 place count 3939 transition count 3430
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 3980 place count 3930 transition count 3430
Performed 1682 Post agglomeration using F-continuation condition.Transition count delta: 1682
Deduced a syphon composed of 1682 places in 13 ms
Reduce places removed 1682 places and 0 transitions.
Iterating global reduction 3 with 3364 rules applied. Total rules applied 7344 place count 2248 transition count 1748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7345 place count 2248 transition count 1747
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7347 place count 2247 transition count 1746
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7549 place count 2146 transition count 1809
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7751 place count 2045 transition count 1874
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 7927 place count 1957 transition count 1932
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7928 place count 1957 transition count 1931
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 7929 place count 1957 transition count 1930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7930 place count 1956 transition count 1930
Partial Free-agglomeration rule applied 97 times.
Drop transitions (Partial Free agglomeration) removed 97 transitions
Iterating global reduction 6 with 97 rules applied. Total rules applied 8027 place count 1956 transition count 1930
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8028 place count 1955 transition count 1929
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8030 place count 1953 transition count 1929
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8030 place count 1953 transition count 1928
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8032 place count 1952 transition count 1928
Applied a total of 8032 rules in 2144 ms. Remains 1952 /5920 variables (removed 3968) and now considering 1928/5420 (removed 3492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2144 ms. Remains : 1952/5920 places, 1928/5420 transitions.
RANDOM walk for 40000 steps (8 resets) in 1332 ms. (30 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
// Phase 1: matrix 1928 rows 1952 cols
[2024-05-29 02:27:02] [INFO ] Computed 899 invariants in 7 ms
[2024-05-29 02:27:02] [INFO ] State equation strengthened by 843 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 99/133 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1786/1919 variables, 842/883 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1919 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1897/3816 variables, 1919/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3816 variables, 842/3644 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3816 variables, 0/3644 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 11/3827 variables, 4/3648 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3827 variables, 2/3650 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3827 variables, 0/3650 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 17/3844 variables, 8/3658 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3844 variables, 3/3661 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3844 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 1/3845 variables, 1/3662 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3845 variables, 1/3663 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3845 variables, 0/3663 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 2/3847 variables, 1/3664 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3847 variables, 0/3664 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 16/3863 variables, 10/3674 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3863 variables, 4/3678 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3863 variables, 0/3678 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 9/3872 variables, 4/3682 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3872 variables, 1/3683 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3872 variables, 1/3684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 0/3684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (OVERLAPS) 1/3873 variables, 1/3685 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3873 variables, 1/3686 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3873 variables, 0/3686 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (OVERLAPS) 1/3874 variables, 1/3687 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3874 variables, 1/3688 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3874 variables, 0/3688 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (OVERLAPS) 6/3880 variables, 4/3692 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3880 variables, 2/3694 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3880 variables, 0/3694 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (OVERLAPS) 0/3880 variables, 0/3694 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3880/3880 variables, and 3694 constraints, problems are : Problem set: 0 solved, 24 unsolved in 33187 ms.
Refiners :[Positive P Invariants (semi-flows): 899/899 constraints, State Equation: 1952/1952 constraints, ReadFeed: 843/843 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 99/133 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1786/1919 variables, 842/883 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1919 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1919 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1897/3816 variables, 1919/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3816 variables, 842/3646 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3816 variables, 24/3670 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3816 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 11/3827 variables, 4/3674 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3827 variables, 2/3676 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3827 variables, 0/3676 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 17/3844 variables, 8/3684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3844 variables, 3/3687 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3844 variables, 0/3687 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 1/3845 variables, 1/3688 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3845 variables, 1/3689 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3845 variables, 0/3689 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 2/3847 variables, 1/3690 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3847 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 16/3863 variables, 10/3700 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3863 variables, 4/3704 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3863 variables, 0/3704 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (OVERLAPS) 9/3872 variables, 4/3708 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 1/3709 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 1/3710 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 0/3710 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 1/3873 variables, 1/3711 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3873 variables, 1/3712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3873 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 1/3874 variables, 1/3713 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3874 variables, 1/3714 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3874/3880 variables, and 3714 constraints, problems are : Problem set: 0 solved, 24 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 897/899 constraints, State Equation: 1948/1952 constraints, ReadFeed: 843/843 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 78252ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1928/1928 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 1952 transition count 1927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1951 transition count 1927
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1951 transition count 1924
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1948 transition count 1924
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 1939 transition count 1915
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 1937 transition count 1917
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 1936 transition count 1916
Applied a total of 31 rules in 255 ms. Remains 1936 /1952 variables (removed 16) and now considering 1916/1928 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 1936/1952 places, 1916/1928 transitions.
RANDOM walk for 40000 steps (8 resets) in 1388 ms. (28 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 53556 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 24
Probabilistic random walk after 53556 steps, saw 33787 distinct states, run finished after 3006 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 1916 rows 1936 cols
[2024-05-29 02:28:24] [INFO ] Computed 899 invariants in 7 ms
[2024-05-29 02:28:24] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 96/130 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 16/146 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 223/369 variables, 146/195 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 451/820 variables, 216/415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 97/512 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 9/829 variables, 10/526 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/829 variables, 9/535 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/829 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 16/845 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/845 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 632/1477 variables, 314/857 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1477 variables, 132/989 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1477 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 12/1489 variables, 17/1006 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1489 variables, 12/1018 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1489 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 14/1503 variables, 7/1025 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1503 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 479/1982 variables, 240/1265 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1982 variables, 96/1361 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1982 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 15/1997 variables, 17/1378 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1997 variables, 15/1393 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1997 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 26/2023 variables, 13/1406 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2023 variables, 0/1406 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (OVERLAPS) 435/2458 variables, 238/1644 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2458 variables, 85/1729 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2458 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (OVERLAPS) 12/2470 variables, 21/1750 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2470 variables, 12/1762 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2470 variables, 0/1762 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 39 (OVERLAPS) 6/2476 variables, 3/1765 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2476 variables, 0/1765 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 41 (OVERLAPS) 295/2771 variables, 158/1923 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2771 variables, 60/1983 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2771 variables, 0/1983 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 44 (OVERLAPS) 10/2781 variables, 16/1999 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2781 variables, 10/2009 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2781 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 47 (OVERLAPS) 8/2789 variables, 4/2013 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2789 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 49 (OVERLAPS) 229/3018 variables, 122/2135 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3018 variables, 44/2179 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3018 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 52 (OVERLAPS) 7/3025 variables, 13/2192 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3025 variables, 7/2199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3025 variables, 0/2199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 55 (OVERLAPS) 2/3027 variables, 1/2200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3027 variables, 0/2200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 57 (OVERLAPS) 143/3170 variables, 78/2278 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3170 variables, 32/2310 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3170 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 60 (OVERLAPS) 3/3173 variables, 6/2316 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/3173 variables, 3/2319 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3173 variables, 0/2319 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 63 (OVERLAPS) 132/3305 variables, 64/2383 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3305 variables, 22/2405 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/3305 variables, 0/2405 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 66 (OVERLAPS) 5/3310 variables, 10/2415 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/3310 variables, 5/2420 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3310 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 69 (OVERLAPS) 102/3412 variables, 54/2474 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3412 variables, 23/2497 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3412 variables, 0/2497 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 72 (OVERLAPS) 2/3414 variables, 4/2501 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3414 variables, 2/2503 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3414 variables, 0/2503 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 75 (OVERLAPS) 87/3501 variables, 46/2549 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3501 variables, 15/2564 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3501 variables, 0/2564 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 78 (OVERLAPS) 4/3505 variables, 8/2572 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3505 variables, 4/2576 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3505 variables, 0/2576 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 81 (OVERLAPS) 33/3538 variables, 20/2596 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3538 variables, 8/2604 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/3538 variables, 0/2604 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 84 (OVERLAPS) 1/3539 variables, 2/2606 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3539 variables, 1/2607 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/3539 variables, 0/2607 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 87 (OVERLAPS) 24/3563 variables, 12/2619 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3563 variables, 4/2623 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/3563 variables, 0/2623 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 90 (OVERLAPS) 1/3564 variables, 2/2625 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3564 variables, 1/2626 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/3564 variables, 0/2626 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 93 (OVERLAPS) 15/3579 variables, 8/2634 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3579 variables, 4/2638 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/3579 variables, 0/2638 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 96 (OVERLAPS) 22/3601 variables, 10/2648 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3601 variables, 3/2651 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/3601 variables, 0/2651 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 99 (OVERLAPS) 1/3602 variables, 2/2653 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3602 variables, 1/2654 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/3602 variables, 0/2654 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 102 (OVERLAPS) 15/3617 variables, 8/2662 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3617 variables, 4/2666 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3617 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 105 (OVERLAPS) 22/3639 variables, 10/2676 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/3639 variables, 3/2679 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3639 variables, 0/2679 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 108 (OVERLAPS) 1/3640 variables, 2/2681 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3640 variables, 1/2682 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/3640 variables, 0/2682 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 111 (OVERLAPS) 15/3655 variables, 8/2690 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3655 variables, 4/2694 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/3655 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 114 (OVERLAPS) 22/3677 variables, 10/2704 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3677 variables, 3/2707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/3677 variables, 0/2707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 117 (OVERLAPS) 1/3678 variables, 2/2709 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3678 variables, 1/2710 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/3678 variables, 0/2710 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 120 (OVERLAPS) 15/3693 variables, 8/2718 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3693 variables, 4/2722 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3693 variables, 0/2722 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 123 (OVERLAPS) 22/3715 variables, 10/2732 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3715 variables, 3/2735 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3715 variables, 0/2735 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 126 (OVERLAPS) 1/3716 variables, 2/2737 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/3716 variables, 1/2738 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3716 variables, 0/2738 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 129 (OVERLAPS) 15/3731 variables, 8/2746 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/3731 variables, 4/2750 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3731 variables, 0/2750 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 132 (OVERLAPS) 22/3753 variables, 10/2760 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/3753 variables, 3/2763 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/3753 variables, 0/2763 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 135 (OVERLAPS) 1/3754 variables, 2/2765 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/3754 variables, 1/2766 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3754 variables, 0/2766 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 138 (OVERLAPS) 15/3769 variables, 8/2774 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/3769 variables, 4/2778 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3769 variables, 0/2778 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 141 (OVERLAPS) 22/3791 variables, 10/2788 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/3791 variables, 3/2791 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/3791 variables, 0/2791 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 144 (OVERLAPS) 1/3792 variables, 2/2793 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/3792 variables, 1/2794 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/3792 variables, 0/2794 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 147 (OVERLAPS) 15/3807 variables, 8/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/3807 variables, 4/2806 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/3807 variables, 0/2806 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 150 (OVERLAPS) 20/3827 variables, 10/2816 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/3827 variables, 3/2819 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/3827 variables, 0/2819 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 153 (OVERLAPS) 1/3828 variables, 2/2821 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/3828 variables, 1/2822 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/3828 variables, 0/2822 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 156 (OVERLAPS) 11/3839 variables, 6/2828 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/3839 variables, 3/2831 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/3839 variables, 0/2831 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 159 (OVERLAPS) 9/3848 variables, 4/2835 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/3848 variables, 1/2836 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/3848 variables, 1/2837 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/3848 variables, 0/2837 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 163 (OVERLAPS) 1/3849 variables, 1/2838 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/3849 variables, 1/2839 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/3849 variables, 0/2839 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 166 (OVERLAPS) 1/3850 variables, 1/2840 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/3850 variables, 1/2841 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/3850 variables, 0/2841 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 169 (OVERLAPS) 2/3852 variables, 2/2843 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/3852 variables, 1/2844 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/3852 variables, 0/2844 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 172 (OVERLAPS) 0/3852 variables, 0/2844 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3852/3852 variables, and 2844 constraints, problems are : Problem set: 0 solved, 24 unsolved in 72414 ms.
Refiners :[Positive P Invariants (semi-flows): 899/899 constraints, State Equation: 1936/1936 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 96/130 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 16/146 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 223/369 variables, 146/196 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 451/820 variables, 216/424 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 97/521 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 16/541 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/820 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/820 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 9/829 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/829 variables, 9/565 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/829 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 16/845 variables, 8/573 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/845 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 632/1477 variables, 314/887 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1477 variables, 132/1019 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1477 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 12/1489 variables, 17/1036 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1489 variables, 12/1048 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1489 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 14/1503 variables, 7/1055 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1503 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (OVERLAPS) 479/1982 variables, 240/1295 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1982 variables, 96/1391 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1982 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (OVERLAPS) 15/1997 variables, 17/1408 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1997 variables, 15/1423 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1997 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (OVERLAPS) 26/2023 variables, 13/1436 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2023 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 38 (OVERLAPS) 435/2458 variables, 238/1674 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2458 variables, 85/1759 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2458 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 41 (OVERLAPS) 12/2470 variables, 21/1780 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2470 variables, 12/1792 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2470 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 44 (OVERLAPS) 6/2476 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2476 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 46 (OVERLAPS) 295/2771 variables, 158/1953 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2771 variables, 60/2013 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2771 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 49 (OVERLAPS) 10/2781 variables, 16/2029 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2781 variables, 10/2039 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2781 variables, 0/2039 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 52 (OVERLAPS) 8/2789 variables, 4/2043 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2789 variables, 0/2043 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 54 (OVERLAPS) 229/3018 variables, 122/2165 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3018 variables, 44/2209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3018 variables, 0/2209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 57 (OVERLAPS) 7/3025 variables, 13/2222 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3025 variables, 7/2229 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3025 variables, 0/2229 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 60 (OVERLAPS) 2/3027 variables, 1/2230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/3027 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 62 (OVERLAPS) 143/3170 variables, 78/2308 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3170 variables, 32/2340 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3170 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 65 (OVERLAPS) 3/3173 variables, 6/2346 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3173 variables, 3/2349 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/3173 variables, 0/2349 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 68 (OVERLAPS) 132/3305 variables, 64/2413 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3305 variables, 22/2435 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3305 variables, 0/2435 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 71 (OVERLAPS) 5/3310 variables, 10/2445 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3310 variables, 5/2450 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3310 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 74 (OVERLAPS) 102/3412 variables, 54/2504 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/3412 variables, 23/2527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3412 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 77 (OVERLAPS) 2/3414 variables, 4/2531 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/3414 variables, 2/2533 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3414 variables, 0/2533 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 80 (OVERLAPS) 87/3501 variables, 46/2579 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3501 variables, 15/2594 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3501 variables, 0/2594 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 83 (OVERLAPS) 4/3505 variables, 8/2602 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3505 variables, 4/2606 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3505 variables, 0/2606 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 86 (OVERLAPS) 33/3538 variables, 20/2626 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/3538 variables, 8/2634 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3538 variables, 0/2634 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 89 (OVERLAPS) 1/3539 variables, 2/2636 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/3539 variables, 1/2637 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3539 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 92 (OVERLAPS) 24/3563 variables, 12/2649 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/3563 variables, 4/2653 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3563 variables, 0/2653 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 95 (OVERLAPS) 1/3564 variables, 2/2655 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/3564 variables, 1/2656 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3564 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 98 (OVERLAPS) 15/3579 variables, 8/2664 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/3579 variables, 4/2668 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3579 variables, 0/2668 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 101 (OVERLAPS) 22/3601 variables, 10/2678 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/3601 variables, 3/2681 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3601 variables, 0/2681 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 104 (OVERLAPS) 1/3602 variables, 2/2683 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/3602 variables, 1/2684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/3602 variables, 0/2684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 107 (OVERLAPS) 15/3617 variables, 8/2692 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3617 variables, 4/2696 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3617 variables, 0/2696 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 110 (OVERLAPS) 22/3639 variables, 10/2706 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3639 variables, 3/2709 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3639 variables, 0/2709 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 113 (OVERLAPS) 1/3640 variables, 2/2711 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3640 variables, 1/2712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3640 variables, 0/2712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 116 (OVERLAPS) 15/3655 variables, 8/2720 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3655 variables, 4/2724 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3655 variables, 0/2724 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 119 (OVERLAPS) 22/3677 variables, 10/2734 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3677 variables, 3/2737 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3677 variables, 0/2737 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 122 (OVERLAPS) 1/3678 variables, 2/2739 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3678 variables, 1/2740 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/3678 variables, 0/2740 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 125 (OVERLAPS) 15/3693 variables, 8/2748 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3693 variables, 4/2752 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/3693 variables, 0/2752 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 128 (OVERLAPS) 22/3715 variables, 10/2762 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3715 variables, 3/2765 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/3715 variables, 0/2765 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 131 (OVERLAPS) 1/3716 variables, 2/2767 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/3716 variables, 1/2768 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/3716 variables, 0/2768 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 134 (OVERLAPS) 15/3731 variables, 8/2776 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3731 variables, 4/2780 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/3731 variables, 0/2780 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 137 (OVERLAPS) 22/3753 variables, 10/2790 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/3753 variables, 3/2793 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/3753 variables, 0/2793 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 140 (OVERLAPS) 1/3754 variables, 2/2795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/3754 variables, 1/2796 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/3754 variables, 0/2796 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 143 (OVERLAPS) 15/3769 variables, 8/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/3769 variables, 4/2808 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/3769 variables, 0/2808 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 146 (OVERLAPS) 22/3791 variables, 10/2818 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/3791 variables, 3/2821 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/3791 variables, 0/2821 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 149 (OVERLAPS) 1/3792 variables, 2/2823 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/3792 variables, 1/2824 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/3792 variables, 0/2824 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 152 (OVERLAPS) 15/3807 variables, 8/2832 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/3807 variables, 4/2836 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/3807 variables, 0/2836 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 155 (OVERLAPS) 20/3827 variables, 10/2846 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/3827 variables, 3/2849 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/3827 variables, 0/2849 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 158 (OVERLAPS) 1/3828 variables, 2/2851 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/3828 variables, 1/2852 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/3828 variables, 0/2852 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 161 (OVERLAPS) 11/3839 variables, 6/2858 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/3839 variables, 3/2861 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3839/3852 variables, and 2861 constraints, problems are : Problem set: 0 solved, 24 unsolved in 75008 ms.
Refiners :[Positive P Invariants (semi-flows): 895/899 constraints, State Equation: 1928/1936 constraints, ReadFeed: 8/9 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 6/6 constraints]
After SMT, in 147450ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1936/1936 places, 1916/1916 transitions.
Applied a total of 0 rules in 70 ms. Remains 1936 /1936 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1936/1936 places, 1916/1916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1936/1936 places, 1916/1916 transitions.
Applied a total of 0 rules in 59 ms. Remains 1936 /1936 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
[2024-05-29 02:30:52] [INFO ] Invariant cache hit.
[2024-05-29 02:30:53] [INFO ] Implicit Places using invariants in 1078 ms returned [1925]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1935/1936 places, 1916/1916 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1934 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1934 transition count 1915
Applied a total of 2 rules in 104 ms. Remains 1934 /1935 variables (removed 1) and now considering 1915/1916 (removed 1) transitions.
// Phase 1: matrix 1915 rows 1934 cols
[2024-05-29 02:30:53] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 02:30:54] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2024-05-29 02:30:54] [INFO ] Invariant cache hit.
[2024-05-29 02:30:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 02:30:56] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 3545 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1934/1936 places, 1915/1916 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4789 ms. Remains : 1934/1936 places, 1915/1916 transitions.
[2024-05-29 02:30:56] [INFO ] Flatten gal took : 130 ms
[2024-05-29 02:30:57] [INFO ] Flatten gal took : 127 ms
[2024-05-29 02:30:57] [INFO ] Input system was already deterministic with 5420 transitions.
Computed a total of 1604 stabilizing places and 1604 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5919 transition count 4221
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4721 transition count 4220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4720 transition count 4220
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 2398 place count 4720 transition count 3429
Deduced a syphon composed of 791 places in 9 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 3980 place count 3929 transition count 3429
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 3996 place count 3913 transition count 3413
Iterating global reduction 3 with 16 rules applied. Total rules applied 4012 place count 3913 transition count 3413
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 4012 place count 3913 transition count 3401
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 4036 place count 3901 transition count 3401
Performed 1591 Post agglomeration using F-continuation condition.Transition count delta: 1591
Deduced a syphon composed of 1591 places in 4 ms
Reduce places removed 1591 places and 0 transitions.
Iterating global reduction 3 with 3182 rules applied. Total rules applied 7218 place count 2310 transition count 1810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7219 place count 2310 transition count 1809
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7221 place count 2309 transition count 1808
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7223 place count 2307 transition count 1806
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 7225 place count 2305 transition count 1806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 7225 place count 2305 transition count 1805
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7227 place count 2304 transition count 1805
Applied a total of 7227 rules in 1455 ms. Remains 2304 /5920 variables (removed 3616) and now considering 1805/5420 (removed 3615) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1456 ms. Remains : 2304/5920 places, 1805/5420 transitions.
[2024-05-29 02:30:58] [INFO ] Flatten gal took : 89 ms
[2024-05-29 02:30:59] [INFO ] Flatten gal took : 85 ms
[2024-05-29 02:30:59] [INFO ] Input system was already deterministic with 1805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5905 transition count 5405
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5905 transition count 5405
Applied a total of 30 rules in 1798 ms. Remains 5905 /5920 variables (removed 15) and now considering 5405/5420 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1799 ms. Remains : 5905/5920 places, 5405/5420 transitions.
[2024-05-29 02:31:01] [INFO ] Flatten gal took : 110 ms
[2024-05-29 02:31:01] [INFO ] Flatten gal took : 113 ms
[2024-05-29 02:31:01] [INFO ] Input system was already deterministic with 5405 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5901 transition count 5401
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5901 transition count 5401
Applied a total of 38 rules in 1798 ms. Remains 5901 /5920 variables (removed 19) and now considering 5401/5420 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1799 ms. Remains : 5901/5920 places, 5401/5420 transitions.
[2024-05-29 02:31:03] [INFO ] Flatten gal took : 105 ms
[2024-05-29 02:31:03] [INFO ] Flatten gal took : 112 ms
[2024-05-29 02:31:03] [INFO ] Input system was already deterministic with 5401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5901 transition count 5401
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5901 transition count 5401
Applied a total of 38 rules in 1806 ms. Remains 5901 /5920 variables (removed 19) and now considering 5401/5420 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 5901/5920 places, 5401/5420 transitions.
[2024-05-29 02:31:05] [INFO ] Flatten gal took : 98 ms
[2024-05-29 02:31:05] [INFO ] Flatten gal took : 103 ms
[2024-05-29 02:31:05] [INFO ] Input system was already deterministic with 5401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5902 transition count 5402
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5902 transition count 5402
Applied a total of 36 rules in 1883 ms. Remains 5902 /5920 variables (removed 18) and now considering 5402/5420 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 5902/5920 places, 5402/5420 transitions.
[2024-05-29 02:31:07] [INFO ] Flatten gal took : 111 ms
[2024-05-29 02:31:08] [INFO ] Flatten gal took : 119 ms
[2024-05-29 02:31:08] [INFO ] Input system was already deterministic with 5402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 5903 transition count 5403
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 5903 transition count 5403
Applied a total of 34 rules in 1838 ms. Remains 5903 /5920 variables (removed 17) and now considering 5403/5420 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1838 ms. Remains : 5903/5920 places, 5403/5420 transitions.
[2024-05-29 02:31:10] [INFO ] Flatten gal took : 100 ms
[2024-05-29 02:31:10] [INFO ] Flatten gal took : 107 ms
[2024-05-29 02:31:10] [INFO ] Input system was already deterministic with 5403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5901 transition count 5401
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5901 transition count 5401
Applied a total of 38 rules in 1845 ms. Remains 5901 /5920 variables (removed 19) and now considering 5401/5420 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1846 ms. Remains : 5901/5920 places, 5401/5420 transitions.
[2024-05-29 02:31:12] [INFO ] Flatten gal took : 100 ms
[2024-05-29 02:31:12] [INFO ] Flatten gal took : 108 ms
[2024-05-29 02:31:12] [INFO ] Input system was already deterministic with 5401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 5903 transition count 5403
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 5903 transition count 5403
Applied a total of 34 rules in 1842 ms. Remains 5903 /5920 variables (removed 17) and now considering 5403/5420 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1842 ms. Remains : 5903/5920 places, 5403/5420 transitions.
[2024-05-29 02:31:14] [INFO ] Flatten gal took : 103 ms
[2024-05-29 02:31:14] [INFO ] Flatten gal took : 107 ms
[2024-05-29 02:31:15] [INFO ] Input system was already deterministic with 5403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5901 transition count 5401
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5901 transition count 5401
Applied a total of 38 rules in 1906 ms. Remains 5901 /5920 variables (removed 19) and now considering 5401/5420 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1907 ms. Remains : 5901/5920 places, 5401/5420 transitions.
[2024-05-29 02:31:17] [INFO ] Flatten gal took : 97 ms
[2024-05-29 02:31:17] [INFO ] Flatten gal took : 106 ms
[2024-05-29 02:31:17] [INFO ] Input system was already deterministic with 5401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5904 transition count 5404
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5904 transition count 5404
Applied a total of 32 rules in 1829 ms. Remains 5904 /5920 variables (removed 16) and now considering 5404/5420 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1830 ms. Remains : 5904/5920 places, 5404/5420 transitions.
[2024-05-29 02:31:19] [INFO ] Flatten gal took : 97 ms
[2024-05-29 02:31:19] [INFO ] Flatten gal took : 103 ms
[2024-05-29 02:31:19] [INFO ] Input system was already deterministic with 5404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5902 transition count 5402
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5902 transition count 5402
Applied a total of 36 rules in 1793 ms. Remains 5902 /5920 variables (removed 18) and now considering 5402/5420 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1795 ms. Remains : 5902/5920 places, 5402/5420 transitions.
[2024-05-29 02:31:21] [INFO ] Flatten gal took : 97 ms
[2024-05-29 02:31:21] [INFO ] Flatten gal took : 105 ms
[2024-05-29 02:31:21] [INFO ] Input system was already deterministic with 5402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1201 place count 5919 transition count 4218
Reduce places removed 1201 places and 0 transitions.
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2402 place count 4718 transition count 4218
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2402 place count 4718 transition count 3426
Deduced a syphon composed of 792 places in 10 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3986 place count 3926 transition count 3426
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 4002 place count 3910 transition count 3410
Iterating global reduction 2 with 16 rules applied. Total rules applied 4018 place count 3910 transition count 3410
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4018 place count 3910 transition count 3398
Deduced a syphon composed of 12 places in 10 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 4042 place count 3898 transition count 3398
Performed 1593 Post agglomeration using F-continuation condition.Transition count delta: 1593
Deduced a syphon composed of 1593 places in 4 ms
Reduce places removed 1593 places and 0 transitions.
Iterating global reduction 2 with 3186 rules applied. Total rules applied 7228 place count 2305 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7229 place count 2305 transition count 1804
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7231 place count 2304 transition count 1803
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7233 place count 2302 transition count 1801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7235 place count 2300 transition count 1801
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 7235 place count 2300 transition count 1800
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7237 place count 2299 transition count 1800
Applied a total of 7237 rules in 1438 ms. Remains 2299 /5920 variables (removed 3621) and now considering 1800/5420 (removed 3620) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1438 ms. Remains : 2299/5920 places, 1800/5420 transitions.
[2024-05-29 02:31:23] [INFO ] Flatten gal took : 39 ms
[2024-05-29 02:31:23] [INFO ] Flatten gal took : 42 ms
[2024-05-29 02:31:23] [INFO ] Input system was already deterministic with 1800 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5919 transition count 4220
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4720 transition count 4220
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2398 place count 4720 transition count 3429
Deduced a syphon composed of 791 places in 13 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3980 place count 3929 transition count 3429
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 3997 place count 3912 transition count 3412
Iterating global reduction 2 with 17 rules applied. Total rules applied 4014 place count 3912 transition count 3412
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 4014 place count 3912 transition count 3399
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 4040 place count 3899 transition count 3399
Performed 1594 Post agglomeration using F-continuation condition.Transition count delta: 1594
Deduced a syphon composed of 1594 places in 4 ms
Reduce places removed 1594 places and 0 transitions.
Iterating global reduction 2 with 3188 rules applied. Total rules applied 7228 place count 2305 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7229 place count 2305 transition count 1804
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7231 place count 2304 transition count 1803
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7233 place count 2302 transition count 1801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7235 place count 2300 transition count 1801
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 7235 place count 2300 transition count 1800
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7237 place count 2299 transition count 1800
Applied a total of 7237 rules in 1392 ms. Remains 2299 /5920 variables (removed 3621) and now considering 1800/5420 (removed 3620) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1393 ms. Remains : 2299/5920 places, 1800/5420 transitions.
[2024-05-29 02:31:24] [INFO ] Flatten gal took : 39 ms
[2024-05-29 02:31:25] [INFO ] Flatten gal took : 42 ms
[2024-05-29 02:31:25] [INFO ] Input system was already deterministic with 1800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 5901 transition count 5401
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 5901 transition count 5401
Applied a total of 38 rules in 1818 ms. Remains 5901 /5920 variables (removed 19) and now considering 5401/5420 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 5901/5920 places, 5401/5420 transitions.
[2024-05-29 02:31:27] [INFO ] Flatten gal took : 98 ms
[2024-05-29 02:31:27] [INFO ] Flatten gal took : 105 ms
[2024-05-29 02:31:27] [INFO ] Input system was already deterministic with 5401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5920/5920 places, 5420/5420 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5902 transition count 5402
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5902 transition count 5402
Applied a total of 36 rules in 1829 ms. Remains 5902 /5920 variables (removed 18) and now considering 5402/5420 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1830 ms. Remains : 5902/5920 places, 5402/5420 transitions.
[2024-05-29 02:31:29] [INFO ] Flatten gal took : 101 ms
[2024-05-29 02:31:29] [INFO ] Flatten gal took : 107 ms
[2024-05-29 02:31:29] [INFO ] Input system was already deterministic with 5402 transitions.
[2024-05-29 02:31:29] [INFO ] Flatten gal took : 102 ms
[2024-05-29 02:31:29] [INFO ] Flatten gal took : 106 ms
[2024-05-29 02:31:29] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-29 02:31:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5920 places, 5420 transitions and 14040 arcs took 20 ms.
Total runtime 361479 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-100B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 5920
TRANSITIONS: 5420
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.093s, Sys 0.005s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.019s, 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: 687
MODEL NAME: /home/mcc/execution/411/model
5920 places, 5420 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 CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;