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

About the Execution of LTSMin+red for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2111.228 248902.00 335470.00 696.30 ?????T??????F??? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761600681.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717259839092

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:37:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:37:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:37:20] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-01 16:37:20] [INFO ] Transformed 3903 places.
[2024-06-01 16:37:20] [INFO ] Transformed 3553 transitions.
[2024-06-01 16:37:20] [INFO ] Found NUPN structural information;
[2024-06-01 16:37:20] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA ShieldPPPt-PT-050B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 3386 transition count 3036
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 3386 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1035 place count 3385 transition count 3035
Iterating global reduction 0 with 1 rules applied. Total rules applied 1036 place count 3385 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1037 place count 3384 transition count 3034
Iterating global reduction 0 with 1 rules applied. Total rules applied 1038 place count 3384 transition count 3034
Applied a total of 1038 rules in 1440 ms. Remains 3384 /3903 variables (removed 519) and now considering 3034/3553 (removed 519) transitions.
// Phase 1: matrix 3034 rows 3384 cols
[2024-06-01 16:37:22] [INFO ] Computed 551 invariants in 44 ms
[2024-06-01 16:37:23] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-06-01 16:37:23] [INFO ] Invariant cache hit.
[2024-06-01 16:37:26] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned []
Implicit Place search using SMT with State Equation took 4341 ms to find 0 implicit places.
Running 3033 sub problems to find dead transitions.
[2024-06-01 16:37:26] [INFO ] Invariant cache hit.
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 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 3033/3033 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3033 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 0/3033 constraints, Known Traps: 0/0 constraints]
After SMT, in 61291ms problems are : Problem set: 0 solved, 3033 unsolved
Search for dead transitions found 0 dead transitions in 61336ms
Starting structural reductions in LTL mode, iteration 1 : 3384/3903 places, 3034/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67160 ms. Remains : 3384/3903 places, 3034/3553 transitions.
Support contains 171 out of 3384 places after structural reductions.
[2024-06-01 16:38:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 16:38:28] [INFO ] Flatten gal took : 198 ms
FORMULA ShieldPPPt-PT-050B-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:38:28] [INFO ] Flatten gal took : 122 ms
[2024-06-01 16:38:28] [INFO ] Input system was already deterministic with 3034 transitions.
Support contains 155 out of 3384 places (down from 171) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3021 ms. (13 steps per ms) remains 44/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
[2024-06-01 16:38:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 690/762 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/762 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2622/3384 variables, 467/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3384 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 3034/6418 variables, 3384/3935 constraints. Problems are: Problem set: 0 solved, 44 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 6418/6418 variables, and 3935 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3384/3384 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 690/762 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 16:38:35] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 12 ms to minimize.
[2024-06-01 16:38:35] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/762 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/762 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 2622/3384 variables, 467/553 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 16:38:38] [INFO ] Deduced a trap composed of 24 places in 490 ms of which 22 ms to minimize.
[2024-06-01 16:38:38] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 8 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 7 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 7 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 16 places in 419 ms of which 7 ms to minimize.
SMT process timed out in 10133ms, After SMT, problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 3384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 662 place count 3384 transition count 2372
Reduce places removed 662 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 674 rules applied. Total rules applied 1336 place count 2722 transition count 2360
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1348 place count 2710 transition count 2360
Performed 377 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 377 Pre rules applied. Total rules applied 1348 place count 2710 transition count 1983
Deduced a syphon composed of 377 places in 3 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 3 with 754 rules applied. Total rules applied 2102 place count 2333 transition count 1983
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2117 place count 2318 transition count 1968
Iterating global reduction 3 with 15 rules applied. Total rules applied 2132 place count 2318 transition count 1968
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 2132 place count 2318 transition count 1957
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 2154 place count 2307 transition count 1957
Performed 831 Post agglomeration using F-continuation condition.Transition count delta: 831
Deduced a syphon composed of 831 places in 5 ms
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 3 with 1662 rules applied. Total rules applied 3816 place count 1476 transition count 1126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3817 place count 1476 transition count 1125
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 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3819 place count 1475 transition count 1124
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4021 place count 1374 transition count 1124
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 4079 place count 1345 transition count 1124
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4082 place count 1345 transition count 1121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4085 place count 1342 transition count 1121
Partial Free-agglomeration rule applied 143 times.
Drop transitions (Partial Free agglomeration) removed 143 transitions
Iterating global reduction 5 with 143 rules applied. Total rules applied 4228 place count 1342 transition count 1121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4229 place count 1341 transition count 1120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4230 place count 1340 transition count 1120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4230 place count 1340 transition count 1118
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4234 place count 1338 transition count 1118
Applied a total of 4234 rules in 1386 ms. Remains 1338 /3384 variables (removed 2046) and now considering 1118/3034 (removed 1916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1386 ms. Remains : 1338/3384 places, 1118/3034 transitions.
RANDOM walk for 40000 steps (8 resets) in 921 ms. (43 steps per ms) remains 40/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
Interrupted probabilistic random walk after 72325 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :2 out of 40
Probabilistic random walk after 72325 steps, saw 54557 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :2
// Phase 1: matrix 1118 rows 1338 cols
[2024-06-01 16:38:45] [INFO ] Computed 550 invariants in 5 ms
[2024-06-01 16:38:45] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 203/266 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 94/360 variables, 40/118 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 430/790 variables, 360/478 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 11/489 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 505/1295 variables, 289/778 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 105/883 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1295 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 29/1324 variables, 32/916 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 29/945 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 47/1371 variables, 24/969 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1371 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1371 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 509/1880 variables, 294/1264 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1880 variables, 75/1339 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1880 variables, 1/1340 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1880 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (OVERLAPS) 36/1916 variables, 43/1383 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1916 variables, 36/1419 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1916 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 25 (OVERLAPS) 52/1968 variables, 26/1445 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1968 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 27 (OVERLAPS) 275/2243 variables, 195/1640 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2243 variables, 60/1700 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2243 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 30 (OVERLAPS) 10/2253 variables, 10/1710 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2253 variables, 10/1720 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2253 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 33 (OVERLAPS) 20/2273 variables, 10/1730 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2273 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 35 (OVERLAPS) 102/2375 variables, 74/1804 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2375 variables, 23/1827 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2375 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 38 (OVERLAPS) 1/2376 variables, 2/1829 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2376 variables, 1/1830 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2376 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 41 (OVERLAPS) 51/2427 variables, 29/1859 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2427 variables, 9/1868 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2427 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 44 (OVERLAPS) 3/2430 variables, 5/1873 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2430 variables, 3/1876 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2430 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 47 (OVERLAPS) 2/2432 variables, 1/1877 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2432 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 49 (OVERLAPS) 21/2453 variables, 15/1892 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2453 variables, 6/1898 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2453 variables, 0/1898 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 52 (OVERLAPS) 3/2456 variables, 2/1900 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2456 variables, 1/1901 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2456 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 55 (OVERLAPS) 0/2456 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 1901 constraints, problems are : Problem set: 0 solved, 38 unsolved in 26964 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1338/1338 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 203/266 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 94/360 variables, 40/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 430/790 variables, 360/479 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 11/490 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 17/507 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 505/1295 variables, 289/796 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1295 variables, 105/901 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1295 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1295 variables, 21/923 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:14] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:39:14] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:39:14] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 16:39:15] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1295 variables, 4/927 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1295 variables, 1/928 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:17] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1295 variables, 1/929 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1295 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 29/1324 variables, 32/961 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 29/990 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1324 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (OVERLAPS) 47/1371 variables, 24/1014 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1371 variables, 1/1015 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1371 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (OVERLAPS) 509/1880 variables, 294/1309 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1880 variables, 75/1384 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1880 variables, 1/1385 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1880 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 28 (OVERLAPS) 36/1916 variables, 43/1428 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1916 variables, 36/1464 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1916 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 31 (OVERLAPS) 52/1968 variables, 26/1490 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:24] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1968 variables, 1/1491 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1968 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 34 (OVERLAPS) 275/2243 variables, 195/1686 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2243 variables, 60/1746 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2243 variables, 2/1748 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2243 variables, 0/1748 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 38 (OVERLAPS) 10/2253 variables, 10/1758 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2253 variables, 10/1768 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2253 variables, 0/1768 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 41 (OVERLAPS) 20/2273 variables, 10/1778 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2273 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 43 (OVERLAPS) 102/2375 variables, 74/1852 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2375 variables, 23/1875 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2375 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 46 (OVERLAPS) 1/2376 variables, 2/1877 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2376 variables, 1/1878 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 16:39:40] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 3 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2376 variables, 1/1879 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2376 variables, 0/1879 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 50 (OVERLAPS) 51/2427 variables, 29/1908 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2427 variables, 9/1917 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2427 variables, 0/1917 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 53 (OVERLAPS) 3/2430 variables, 5/1922 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2430 variables, 3/1925 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2430 variables, 0/1925 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 56 (OVERLAPS) 2/2432 variables, 1/1926 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2432 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 58 (OVERLAPS) 21/2453 variables, 15/1941 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2453 variables, 6/1947 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2453 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 61 (OVERLAPS) 3/2456 variables, 2/1949 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2456 variables, 1/1950 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2456 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 1950 constraints, problems are : Problem set: 0 solved, 38 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1338/1338 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 11/11 constraints]
After SMT, in 72013ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 1338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1338/1338 places, 1118/1118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1338 transition count 1116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1336 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1335 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1335 transition count 1115
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 1328 transition count 1108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 1327 transition count 1107
Applied a total of 21 rules in 148 ms. Remains 1327 /1338 variables (removed 11) and now considering 1107/1118 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1327/1338 places, 1107/1118 transitions.
RANDOM walk for 40000 steps (8 resets) in 908 ms. (44 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 70711 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 37
Probabilistic random walk after 70711 steps, saw 55209 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 1107 rows 1327 cols
[2024-06-01 16:40:01] [INFO ] Computed 550 invariants in 10 ms
[2024-06-01 16:40:01] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 194/256 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 77/333 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 400/733 variables, 333/443 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 484/1217 variables, 276/727 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1217 variables, 101/828 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1217 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1217 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 27/1244 variables, 30/860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1244 variables, 27/887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1244 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 47/1291 variables, 24/911 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1291 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (OVERLAPS) 502/1793 variables, 289/1201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1793 variables, 76/1277 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1793 variables, 1/1278 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1793 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (OVERLAPS) 36/1829 variables, 40/1318 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1829 variables, 36/1354 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1829 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (OVERLAPS) 60/1889 variables, 30/1384 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1889 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (OVERLAPS) 294/2183 variables, 207/1591 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2183 variables, 62/1653 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2183 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 10/2193 variables, 10/1663 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2193 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2193 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (OVERLAPS) 20/2213 variables, 10/1683 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2213 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (OVERLAPS) 136/2349 variables, 94/1777 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2349 variables, 28/1805 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2349 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (OVERLAPS) 3/2352 variables, 6/1811 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2352 variables, 3/1814 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2352 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (OVERLAPS) 53/2405 variables, 31/1845 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2405 variables, 10/1855 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2405 variables, 0/1855 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (OVERLAPS) 3/2408 variables, 5/1860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2408 variables, 3/1863 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2408 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (OVERLAPS) 2/2410 variables, 1/1864 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2410 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (OVERLAPS) 21/2431 variables, 15/1879 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2431 variables, 6/1885 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2431 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (OVERLAPS) 3/2434 variables, 2/1887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2434 variables, 1/1888 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2434 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 0/2434 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2434/2434 variables, and 1888 constraints, problems are : Problem set: 0 solved, 37 unsolved in 26574 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1327/1327 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 194/256 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 77/333 variables, 33/112 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 400/733 variables, 333/445 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 8/453 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 17/470 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 484/1217 variables, 276/746 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1217 variables, 101/847 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1217 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1217 variables, 20/869 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1217 variables, 3/872 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1217 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1217 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 27/1244 variables, 30/903 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1244 variables, 27/930 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1244 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (OVERLAPS) 47/1291 variables, 24/954 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1291 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1291 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (OVERLAPS) 502/1793 variables, 289/1244 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1793 variables, 76/1320 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1793 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:35] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-06-01 16:40:35] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1793 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1793 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (OVERLAPS) 36/1829 variables, 40/1363 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1829 variables, 36/1399 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1829 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (OVERLAPS) 60/1889 variables, 30/1429 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1889 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (OVERLAPS) 294/2183 variables, 207/1636 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2183 variables, 62/1698 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:41] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2183 variables, 1/1699 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2183 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (OVERLAPS) 10/2193 variables, 10/1709 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2193 variables, 10/1719 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2193 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (OVERLAPS) 20/2213 variables, 10/1729 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2213 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (OVERLAPS) 136/2349 variables, 94/1823 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2349 variables, 28/1851 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2349 variables, 0/1851 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (OVERLAPS) 3/2352 variables, 6/1857 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2352 variables, 3/1860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2352 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (OVERLAPS) 53/2405 variables, 31/1891 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2405 variables, 10/1901 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 3 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2405 variables, 2/1903 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2405 variables, 0/1903 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (OVERLAPS) 3/2408 variables, 5/1908 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2408 variables, 3/1911 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2408 variables, 0/1911 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 2/2410 variables, 1/1912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2410 variables, 0/1912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 57 (OVERLAPS) 21/2431 variables, 15/1927 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2431 variables, 6/1933 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2431 variables, 0/1933 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 60 (OVERLAPS) 3/2434 variables, 2/1935 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2434 variables, 1/1936 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2434 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 63 (OVERLAPS) 0/2434 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2434/2434 variables, and 1936 constraints, problems are : Problem set: 0 solved, 37 unsolved in 43760 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1327/1327 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 11/11 constraints]
After SMT, in 70365ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 2502 ms.
Support contains 62 out of 1327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1327/1327 places, 1107/1107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1326 transition count 1106
Applied a total of 2 rules in 69 ms. Remains 1326 /1327 variables (removed 1) and now considering 1106/1107 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1326/1327 places, 1106/1107 transitions.
[2024-06-01 16:41:14] [INFO ] Flatten gal took : 91 ms
[2024-06-01 16:41:14] [INFO ] Flatten gal took : 87 ms
[2024-06-01 16:41:14] [INFO ] Input system was already deterministic with 3034 transitions.
Computed a total of 807 stabilizing places and 807 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 675 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-06-01 16:41:15] [INFO ] Flatten gal took : 69 ms
[2024-06-01 16:41:15] [INFO ] Flatten gal took : 70 ms
[2024-06-01 16:41:15] [INFO ] Input system was already deterministic with 3005 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 642 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:41:16] [INFO ] Flatten gal took : 72 ms
[2024-06-01 16:41:16] [INFO ] Flatten gal took : 82 ms
[2024-06-01 16:41:16] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 654 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:41:17] [INFO ] Flatten gal took : 70 ms
[2024-06-01 16:41:17] [INFO ] Flatten gal took : 69 ms
[2024-06-01 16:41:17] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 676 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:41:18] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:41:18] [INFO ] Flatten gal took : 80 ms
[2024-06-01 16:41:18] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 3352 transition count 3002
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 3352 transition count 3002
Applied a total of 64 rules in 676 ms. Remains 3352 /3384 variables (removed 32) and now considering 3002/3034 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 3352/3384 places, 3002/3034 transitions.
[2024-06-01 16:41:19] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:41:19] [INFO ] Flatten gal took : 65 ms
[2024-06-01 16:41:19] [INFO ] Input system was already deterministic with 3002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 703 rules applied. Total rules applied 703 place count 3383 transition count 2330
Reduce places removed 703 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 704 rules applied. Total rules applied 1407 place count 2680 transition count 2329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1408 place count 2679 transition count 2329
Performed 383 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 383 Pre rules applied. Total rules applied 1408 place count 2679 transition count 1946
Deduced a syphon composed of 383 places in 3 ms
Reduce places removed 383 places and 0 transitions.
Iterating global reduction 3 with 766 rules applied. Total rules applied 2174 place count 2296 transition count 1946
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2199 place count 2271 transition count 1921
Iterating global reduction 3 with 25 rules applied. Total rules applied 2224 place count 2271 transition count 1921
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2224 place count 2271 transition count 1900
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2266 place count 2250 transition count 1900
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 797
Deduced a syphon composed of 797 places in 1 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 3860 place count 1453 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3861 place count 1453 transition count 1102
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3863 place count 1452 transition count 1101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3865 place count 1450 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3866 place count 1449 transition count 1099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3866 place count 1449 transition count 1097
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3870 place count 1447 transition count 1097
Applied a total of 3870 rules in 674 ms. Remains 1447 /3384 variables (removed 1937) and now considering 1097/3034 (removed 1937) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 674 ms. Remains : 1447/3384 places, 1097/3034 transitions.
[2024-06-01 16:41:20] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:41:20] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:41:20] [INFO ] Input system was already deterministic with 1097 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 3383 transition count 2331
Reduce places removed 702 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 704 rules applied. Total rules applied 1406 place count 2681 transition count 2329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1408 place count 2679 transition count 2329
Performed 384 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 384 Pre rules applied. Total rules applied 1408 place count 2679 transition count 1945
Deduced a syphon composed of 384 places in 3 ms
Reduce places removed 384 places and 0 transitions.
Iterating global reduction 3 with 768 rules applied. Total rules applied 2176 place count 2295 transition count 1945
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2201 place count 2270 transition count 1920
Iterating global reduction 3 with 25 rules applied. Total rules applied 2226 place count 2270 transition count 1920
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2226 place count 2270 transition count 1899
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2268 place count 2249 transition count 1899
Performed 793 Post agglomeration using F-continuation condition.Transition count delta: 793
Deduced a syphon composed of 793 places in 2 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3854 place count 1456 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3855 place count 1456 transition count 1105
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3857 place count 1455 transition count 1104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3859 place count 1453 transition count 1102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3860 place count 1452 transition count 1102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3860 place count 1452 transition count 1100
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3864 place count 1450 transition count 1100
Applied a total of 3864 rules in 638 ms. Remains 1450 /3384 variables (removed 1934) and now considering 1100/3034 (removed 1934) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 638 ms. Remains : 1450/3384 places, 1100/3034 transitions.
[2024-06-01 16:41:21] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:41:21] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:41:21] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3357 transition count 3007
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3357 transition count 3007
Applied a total of 54 rules in 659 ms. Remains 3357 /3384 variables (removed 27) and now considering 3007/3034 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 3357/3384 places, 3007/3034 transitions.
[2024-06-01 16:41:21] [INFO ] Flatten gal took : 57 ms
[2024-06-01 16:41:21] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:41:22] [INFO ] Input system was already deterministic with 3007 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 717 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:41:22] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:41:22] [INFO ] Flatten gal took : 57 ms
[2024-06-01 16:41:23] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 3383 transition count 2331
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 2681 transition count 2331
Performed 382 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 382 Pre rules applied. Total rules applied 1404 place count 2681 transition count 1949
Deduced a syphon composed of 382 places in 3 ms
Reduce places removed 382 places and 0 transitions.
Iterating global reduction 2 with 764 rules applied. Total rules applied 2168 place count 2299 transition count 1949
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2192 place count 2275 transition count 1925
Iterating global reduction 2 with 24 rules applied. Total rules applied 2216 place count 2275 transition count 1925
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2216 place count 2275 transition count 1904
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 2258 place count 2254 transition count 1904
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 798
Deduced a syphon composed of 798 places in 1 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 3854 place count 1456 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3855 place count 1456 transition count 1105
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3857 place count 1455 transition count 1104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3859 place count 1453 transition count 1102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3860 place count 1452 transition count 1102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3860 place count 1452 transition count 1100
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3864 place count 1450 transition count 1100
Applied a total of 3864 rules in 599 ms. Remains 1450 /3384 variables (removed 1934) and now considering 1100/3034 (removed 1934) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 600 ms. Remains : 1450/3384 places, 1100/3034 transitions.
[2024-06-01 16:41:23] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:41:23] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:41:23] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 3383 transition count 2338
Reduce places removed 695 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 696 rules applied. Total rules applied 1391 place count 2688 transition count 2337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1392 place count 2687 transition count 2337
Performed 381 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 381 Pre rules applied. Total rules applied 1392 place count 2687 transition count 1956
Deduced a syphon composed of 381 places in 3 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 3 with 762 rules applied. Total rules applied 2154 place count 2306 transition count 1956
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2175 place count 2285 transition count 1935
Iterating global reduction 3 with 21 rules applied. Total rules applied 2196 place count 2285 transition count 1935
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 2196 place count 2285 transition count 1916
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 2234 place count 2266 transition count 1916
Performed 795 Post agglomeration using F-continuation condition.Transition count delta: 795
Deduced a syphon composed of 795 places in 1 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3824 place count 1471 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3825 place count 1471 transition count 1120
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3827 place count 1470 transition count 1119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3829 place count 1468 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3830 place count 1467 transition count 1117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3830 place count 1467 transition count 1115
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3834 place count 1465 transition count 1115
Applied a total of 3834 rules in 688 ms. Remains 1465 /3384 variables (removed 1919) and now considering 1115/3034 (removed 1919) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 688 ms. Remains : 1465/3384 places, 1115/3034 transitions.
[2024-06-01 16:41:24] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:41:24] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:41:24] [INFO ] Input system was already deterministic with 1115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 659 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:41:25] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:41:25] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:41:25] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 3353 transition count 3003
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 3353 transition count 3003
Applied a total of 62 rules in 739 ms. Remains 3353 /3384 variables (removed 31) and now considering 3003/3034 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 3353/3384 places, 3003/3034 transitions.
[2024-06-01 16:41:26] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:41:26] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:41:26] [INFO ] Input system was already deterministic with 3003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 641 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-06-01 16:41:27] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:41:27] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:41:27] [INFO ] Input system was already deterministic with 3005 transitions.
[2024-06-01 16:41:27] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:41:27] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:41:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:41:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3384 places, 3034 transitions and 7868 arcs took 13 ms.
Total runtime 247379 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLCardinality-2023-15

BK_STOP 1717260087994

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/644/ctl_0_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/644/ctl_1_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/644/ctl_2_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/644/ctl_3_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/644/ctl_4_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/644/ctl_5_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/644/ctl_6_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/644/ctl_7_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/644/ctl_8_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/644/ctl_9_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/644/ctl_10_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/644/ctl_11_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/644/ctl_12_
ctl formula name ShieldPPPt-PT-050B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/644/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-050B, 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 r528-tall-171683761600681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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