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-171683760400143.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 ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 675K 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 ShieldIIPs-PT-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717230540044

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:29:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:29:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:29:01] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-06-01 08:29:01] [INFO ] Transformed 2403 places.
[2024-06-01 08:29:01] [INFO ] Transformed 2363 transitions.
[2024-06-01 08:29:01] [INFO ] Found NUPN structural information;
[2024-06-01 08:29:01] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2644 ms. (15 steps per ms) remains 6/16 properties
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
// Phase 1: matrix 2363 rows 2403 cols
[2024-06-01 08:29:02] [INFO ] Computed 361 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1136/1268 variables, 147/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1268 variables, 1136/1415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1268 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1135/2403 variables, 214/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2403 variables, 1135/2764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2403 variables, 0/2764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2363/4766 variables, 2403/5167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4766 variables, 0/5167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/4766 variables, 0/5167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4766/4766 variables, and 5167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2866 ms.
Refiners :[Domain max(s): 2403/2403 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2403/2403 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1136/1268 variables, 147/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1268 variables, 1136/1415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 24 ms to minimize.
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 6 ms to minimize.
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1268 variables, 20/1435 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1268 variables, 2/1437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1268 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1135/2403 variables, 214/1651 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2403 variables, 1135/2786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:29:10] [INFO ] Deduced a trap composed of 26 places in 371 ms of which 7 ms to minimize.
[2024-06-01 08:29:10] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 7 ms to minimize.
[2024-06-01 08:29:11] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 6 ms to minimize.
SMT process timed out in 8187ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2403 transition count 2190
Reduce places removed 173 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 185 rules applied. Total rules applied 358 place count 2230 transition count 2178
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 370 place count 2218 transition count 2178
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 370 place count 2218 transition count 1987
Deduced a syphon composed of 191 places in 4 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 752 place count 2027 transition count 1987
Discarding 252 places :
Symmetric choice reduction at 3 with 252 rule applications. Total rules 1004 place count 1775 transition count 1735
Iterating global reduction 3 with 252 rules applied. Total rules applied 1256 place count 1775 transition count 1735
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 1256 place count 1775 transition count 1649
Deduced a syphon composed of 86 places in 10 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1428 place count 1689 transition count 1649
Performed 574 Post agglomeration using F-continuation condition.Transition count delta: 574
Deduced a syphon composed of 574 places in 2 ms
Reduce places removed 574 places and 0 transitions.
Iterating global reduction 3 with 1148 rules applied. Total rules applied 2576 place count 1115 transition count 1075
Partial Free-agglomeration rule applied 239 times.
Drop transitions (Partial Free agglomeration) removed 239 transitions
Iterating global reduction 3 with 239 rules applied. Total rules applied 2815 place count 1115 transition count 1075
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2816 place count 1114 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2817 place count 1113 transition count 1074
Applied a total of 2817 rules in 1349 ms. Remains 1113 /2403 variables (removed 1290) and now considering 1074/2363 (removed 1289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1364 ms. Remains : 1113/2403 places, 1074/2363 transitions.
RANDOM walk for 40000 steps (11 resets) in 783 ms. (51 steps per ms) remains 4/6 properties
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
// Phase 1: matrix 1074 rows 1113 cols
[2024-06-01 08:29:13] [INFO ] Computed 360 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 414/544 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 321/865 variables, 124/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/865 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/879 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 951/1830 variables, 879/1152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1830 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 287/2117 variables, 174/1326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2117 variables, 56/1382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2117 variables, 1/1383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2117 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/2123 variables, 6/1389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2123 variables, 6/1395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2123 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/2131 variables, 4/1399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2131 variables, 8/1407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2131 variables, 0/1407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/2135 variables, 2/1409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2135 variables, 2/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2135 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 52/2187 variables, 44/1455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2187 variables, 18/1473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2187 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/2187 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 1473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 350/350 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1113/1113 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 414/544 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 9/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 321/865 variables, 124/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:29:16] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:29:17] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:29:17] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
[2024-06-01 08:29:17] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:29:17] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 14/879 variables, 7/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/879 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 951/1830 variables, 879/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:17] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-01 08:29:18] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:29:19] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-06-01 08:29:20] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-06-01 08:29:21] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1830 variables, 20/1197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:21] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:29:21] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:29:21] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:29:21] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:29:22] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-06-01 08:29:23] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1830 variables, 20/1217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1830 variables, 3/1220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1830 variables, 3/1223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1830 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 287/2117 variables, 174/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2117 variables, 56/1453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2117 variables, 1/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2117 variables, 4/1458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:26] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:29:27] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:29:27] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:29:27] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:29:27] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:29:28] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:29:28] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:29:28] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:29:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:29:28] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:29:29] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:29:29] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-01 08:29:29] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:29:29] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2117 variables, 14/1472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2117 variables, 0/1472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 6/2123 variables, 6/1478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2123 variables, 6/1484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2123 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 8/2131 variables, 4/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2131 variables, 8/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2131 variables, 2/1498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2131 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 4/2135 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2135 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2135 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 52/2187 variables, 44/1546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2187 variables, 18/1564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2187 variables, 6/1570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2187 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 0/2187 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 1570 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19829 ms.
Refiners :[Positive P Invariants (semi-flows): 350/350 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1113/1113 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 93/93 constraints]
After SMT, in 21668ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2999 ms.
Support contains 130 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1074/1074 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1111 transition count 1072
Applied a total of 4 rules in 72 ms. Remains 1111 /1113 variables (removed 2) and now considering 1072/1074 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1111/1113 places, 1072/1074 transitions.
RANDOM walk for 40000 steps (12 resets) in 734 ms. (54 steps per ms) remains 3/4 properties
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
// Phase 1: matrix 1072 rows 1111 cols
[2024-06-01 08:29:38] [INFO ] Computed 360 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 406/527 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 332/859 variables, 127/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/873 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 946/1819 variables, 873/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1819 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 287/2106 variables, 172/1316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2106 variables, 56/1372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2106 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/2112 variables, 6/1378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2112 variables, 6/1384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2112 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/2120 variables, 4/1388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2120 variables, 8/1396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2120 variables, 0/1396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/2126 variables, 3/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2126 variables, 4/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2126 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/2127 variables, 1/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2127 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2127 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 56/2183 variables, 47/1452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2183 variables, 19/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2183 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2183 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2183/2183 variables, and 1471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 350/350 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1111/1111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 406/527 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 332/859 variables, 127/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/859 variables, 11/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14/873 variables, 7/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 946/1819 variables, 873/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-06-01 08:29:42] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 7 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:29:43] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:29:44] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1819 variables, 20/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:29:45] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:29:46] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:29:46] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:29:46] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:29:46] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:29:46] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1819 variables, 12/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1819 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 287/2106 variables, 172/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2106 variables, 56/1431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2106 variables, 3/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:47] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:29:48] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:29:48] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:29:48] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:29:48] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:29:48] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:29:49] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-06-01 08:29:50] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2106 variables, 19/1453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:51] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2106 variables, 1/1454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2106 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/2112 variables, 6/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2112 variables, 6/1466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2112 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 8/2120 variables, 4/1470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2120 variables, 8/1478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:52] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:29:52] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2120 variables, 2/1480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:53] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2120 variables, 1/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2120 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 6/2126 variables, 3/1484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2126 variables, 4/1488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2126 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 1/2127 variables, 1/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2127 variables, 1/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2127 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 56/2183 variables, 47/1537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2183 variables, 19/1556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2183 variables, 5/1561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/2183 variables, 2/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2183 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 0/2183 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2183/2183 variables, and 1563 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17589 ms.
Refiners :[Positive P Invariants (semi-flows): 350/350 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1111/1111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 89/89 constraints]
After SMT, in 19092ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5032 ms.
Support contains 121 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1072/1072 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1111 transition count 1071
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1110 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1109 transition count 1070
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1109 transition count 1070
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 0 with 2 rules applied. Total rules applied 6 place count 1108 transition count 1069
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 1108 transition count 1069
Applied a total of 9 rules in 102 ms. Remains 1108 /1111 variables (removed 3) and now considering 1069/1072 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1108/1111 places, 1069/1072 transitions.
RANDOM walk for 40000 steps (11 resets) in 670 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 144718 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 3
Probabilistic random walk after 144718 steps, saw 95366 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 1069 rows 1108 cols
[2024-06-01 08:30:06] [INFO ] Computed 360 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 405/526 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 329/855 variables, 126/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/871 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/871 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 944/1815 variables, 871/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1815 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 287/2102 variables, 172/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2102 variables, 56/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2102 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/2108 variables, 6/1376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2108 variables, 6/1382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2108 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/2116 variables, 4/1386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2116 variables, 8/1394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2116 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/2122 variables, 3/1397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2122 variables, 4/1401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2122 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/2123 variables, 1/1402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2123 variables, 1/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2123 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 54/2177 variables, 46/1449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2177 variables, 19/1468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2177 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2177 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2177 variables, and 1468 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 349/349 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1108/1108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 405/526 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 329/855 variables, 126/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/871 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/871 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 944/1815 variables, 871/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 6 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 3 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1815 variables, 20/1202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1815 variables, 7/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1815 variables, 1/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:15] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1815 variables, 1/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1815 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 287/2102 variables, 172/1383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2102 variables, 56/1439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2102 variables, 3/1442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:30:17] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:30:18] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:30:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:30:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2102 variables, 20/1462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:19] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:30:19] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2102 variables, 7/1469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2102 variables, 2/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2102 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 6/2108 variables, 6/1477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2108 variables, 6/1483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2108 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 8/2116 variables, 4/1487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2116 variables, 8/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2116 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 6/2122 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2122 variables, 4/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2122 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 1/2123 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2123 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2123 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 54/2177 variables, 46/1550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2177 variables, 19/1569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:23] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:30:23] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2177 variables, 6/1575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 08:30:25] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2177 variables, 2/1577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:30:25] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/2177 variables, 1/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2177 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 0/2177 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2177 variables, and 1578 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18875 ms.
Refiners :[Positive P Invariants (semi-flows): 349/349 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1108/1108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 107/107 constraints]
After SMT, in 20346ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3410 ms.
Support contains 121 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 1069/1069 transitions.
Applied a total of 0 rules in 66 ms. Remains 1108 /1108 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1108/1108 places, 1069/1069 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 1069/1069 transitions.
Applied a total of 0 rules in 26 ms. Remains 1108 /1108 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
[2024-06-01 08:30:29] [INFO ] Invariant cache hit.
[2024-06-01 08:30:30] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 08:30:30] [INFO ] Invariant cache hit.
[2024-06-01 08:30:31] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2024-06-01 08:30:31] [INFO ] Redundant transitions in 82 ms returned []
Running 1055 sub problems to find dead transitions.
[2024-06-01 08:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1095 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1095 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
[2024-06-01 08:30:58] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:30:58] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:30:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:31:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/2177 variables, and 131 constraints, problems are : Problem set: 0 solved, 1055 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 111/349 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/1108 constraints, PredecessorRefiner: 1055/1055 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1055 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1095 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1095 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
[2024-06-01 08:31:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:31:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1055 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/2177 variables, and 133 constraints, problems are : Problem set: 0 solved, 1055 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 111/349 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/1108 constraints, PredecessorRefiner: 0/1055 constraints, Known Traps: 11/11 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1055 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62277 ms. Remains : 1108/1108 places, 1069/1069 transitions.
[2024-06-01 08:31:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 08:31:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1108 places, 1069 transitions and 4919 arcs took 10 ms.
[2024-06-01 08:31:32] [INFO ] Flatten gal took : 148 ms
Total runtime 151390 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 : ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
Could not compute solution for formula : ShieldIIPs-PT-040B-ReachabilityFireability-2024-14

BK_STOP 1717230692828

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-040B-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1541/inv_0_
rfs formula name ShieldIIPs-PT-040B-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1541/inv_1_
rfs formula name ShieldIIPs-PT-040B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/1541/inv_2_
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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-040B, examination is ReachabilityFireability"
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-171683760400143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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