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.r356-tall-171683760400127.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 itstools
Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 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 503K 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-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716904431223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 13:53:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:53:52] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-28 13:53:52] [INFO ] Transformed 1803 places.
[2024-05-28 13:53:52] [INFO ] Transformed 1773 transitions.
[2024-05-28 13:53:52] [INFO ] Found NUPN structural information;
[2024-05-28 13:53:52] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1992 ms. (20 steps per ms) remains 5/15 properties
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 13:53:53] [INFO ] Flatten gal took : 277 ms
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 5/5 properties
[2024-05-28 13:53:53] [INFO ] Flatten gal took : 134 ms
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
[2024-05-28 13:53:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11713043176196559852.gal : 77 ms
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
[2024-05-28 13:53:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16786569699446128973.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11713043176196559852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16786569699446128973.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 806 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality16786569699446128973.prop.
// Phase 1: matrix 1773 rows 1803 cols
[2024-05-28 13:53:54] [INFO ] Computed 271 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1077/1214 variables, 165/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1214 variables, 1077/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 589/1803 variables, 106/1485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 589/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1803 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1773/3576 variables, 1803/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 212
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :212 after 484
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :484 after 18173
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :18173 after 1.45699e+08
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.45699e+08 after 5.81902e+13
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.21008e+30
At refinement iteration 9 (INCLUDED_ONLY) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3576/3576 variables, and 3877 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1927 ms.
Refiners :[Domain max(s): 1803/1803 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1803/1803 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1077/1214 variables, 165/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1214 variables, 1077/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 45 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 5 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 5 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 5 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 5 ms to minimize.
[2024-05-28 13:53:58] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 4 ms to minimize.
[2024-05-28 13:53:58] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 5 ms to minimize.
[2024-05-28 13:53:58] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2024-05-28 13:53:58] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-05-28 13:53:59] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 4 ms to minimize.
[2024-05-28 13:53:59] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 4 ms to minimize.
[2024-05-28 13:53:59] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:53:59] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 4 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 5 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-28 13:54:00] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 4 ms to minimize.
[2024-05-28 13:54:01] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 4 ms to minimize.
[2024-05-28 13:54:01] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 7182ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 1803 transition count 1651
Reduce places removed 122 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 130 rules applied. Total rules applied 252 place count 1681 transition count 1643
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 260 place count 1673 transition count 1643
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 260 place count 1673 transition count 1504
Deduced a syphon composed of 139 places in 4 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 538 place count 1534 transition count 1504
Discarding 182 places :
Symmetric choice reduction at 3 with 182 rule applications. Total rules 720 place count 1352 transition count 1322
Iterating global reduction 3 with 182 rules applied. Total rules applied 902 place count 1352 transition count 1322
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 902 place count 1352 transition count 1261
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1024 place count 1291 transition count 1261
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 4 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1824 place count 891 transition count 861
Partial Free-agglomeration rule applied 172 times.
Drop transitions (Partial Free agglomeration) removed 172 transitions
Iterating global reduction 3 with 172 rules applied. Total rules applied 1996 place count 891 transition count 861
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1997 place count 890 transition count 860
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1998 place count 889 transition count 860
Applied a total of 1998 rules in 613 ms. Remains 889 /1803 variables (removed 914) and now considering 860/1773 (removed 913) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 889/1803 places, 860/1773 transitions.
RANDOM walk for 40000 steps (13 resets) in 737 ms. (54 steps per ms) remains 4/5 properties
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
// Phase 1: matrix 860 rows 889 cols
[2024-05-28 13:54:02] [INFO ] Computed 270 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 414/488 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 196/684 variables, 70/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/684 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/700 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 752/1452 variables, 700/907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1452 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 198/1650 variables, 115/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 30/1052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 13/1663 variables, 9/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1663 variables, 9/1070 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1663 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/1678 variables, 7/1077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1678 variables, 6/1083 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1678 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 51/1729 variables, 43/1126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1729 variables, 6/1132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1729 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 6/1735 variables, 6/1138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1735 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1735 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 14/1749 variables, 14/1154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1749 variables, 5/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1749 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1749 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1749/1749 variables, and 1159 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 262/262 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 889/889 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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 414/488 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:54:04] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 5 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:05] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 196/684 variables, 70/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 9 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 3 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 15/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/700 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 752/1452 variables, 700/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1452 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:54:08] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1452 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1452 variables, 7/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-28 13:54:12] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1452 variables, 9/989 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:13] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1452 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1452 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 198/1650 variables, 115/1105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1650 variables, 30/1135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1650 variables, 3/1138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 5 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 3 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1650 variables, 20/1158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:54:18] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:54:19] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1650 variables, 13/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:54:20] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1650 variables, 3/1174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1650 variables, 1/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1650 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 13/1663 variables, 9/1184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1663 variables, 9/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1663 variables, 3/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1663 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 15/1678 variables, 7/1203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1678 variables, 6/1209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1678 variables, 1/1210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1678 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 51/1729 variables, 43/1253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1729 variables, 6/1259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1729 variables, 2/1261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1729 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 6/1735 variables, 6/1267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1735 variables, 2/1269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1735 variables, 2/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1735 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 14/1749 variables, 14/1285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1749 variables, 5/1290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 13:54:25] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:54:25] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1749 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1749 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 0/1749 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1749/1749 variables, and 1292 constraints, problems are : Problem set: 0 solved, 4 unsolved in 22748 ms.
Refiners :[Positive P Invariants (semi-flows): 262/262 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 129/129 constraints]
After SMT, in 24215ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2626 ms.
Support contains 74 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 860/860 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 889 transition count 852
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 881 transition count 851
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 880 transition count 851
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 880 transition count 839
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 868 transition count 839
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 112 place count 833 transition count 804
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 139 place count 833 transition count 804
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 832 transition count 803
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 832 transition count 803
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 829 transition count 800
Applied a total of 144 rules in 160 ms. Remains 829 /889 variables (removed 60) and now considering 800/860 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 829/889 places, 800/860 transitions.
RANDOM walk for 40000 steps (10 resets) in 563 ms. (70 steps per ms) remains 3/4 properties
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
// Phase 1: matrix 800 rows 829 cols
[2024-05-28 13:54:29] [INFO ] Computed 270 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 380/452 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 188/640 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/650 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 711/1361 variables, 650/856 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1361 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 189/1550 variables, 119/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1550 variables, 37/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1550 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/1553 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1553 variables, 3/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1553 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/1557 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1557 variables, 4/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1557 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1559 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1559 variables, 2/1027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1559 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 52/1611 variables, 36/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1611 variables, 9/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1611 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1611 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3/1614 variables, 5/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1614 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1614 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 15/1629 variables, 12/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1629 variables, 6/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1629 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/1629 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1629/1629 variables, and 1099 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 829/829 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 380/452 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:54:31] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 188/640 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-28 13:54:33] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 14/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/650 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:34] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 711/1361 variables, 650/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1361 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 3 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:54:35] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1361 variables, 20/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:54:37] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 3 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:54:38] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 3 ms to minimize.
[2024-05-28 13:54:39] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:54:40] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1361 variables, 18/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:40] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2024-05-28 13:54:40] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:54:40] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1361 variables, 3/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1361 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 189/1550 variables, 119/1056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1550 variables, 37/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1550 variables, 2/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 4 ms to minimize.
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:54:41] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:54:42] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 3 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:54:43] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1550 variables, 20/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:44] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1550 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1550 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 3/1553 variables, 3/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1553 variables, 3/1128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1553 variables, 1/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1553 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1553 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 4/1557 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1557 variables, 4/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1557 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 2/1559 variables, 1/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1559 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1559 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 52/1611 variables, 36/1175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1611 variables, 9/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1611 variables, 1/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1611 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 3/1614 variables, 5/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1614 variables, 3/1193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:48] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:54:48] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1614 variables, 2/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1614 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 15/1629 variables, 12/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1629 variables, 6/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1629 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 0/1629 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1629/1629 variables, and 1213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18123 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 829/829 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 111/111 constraints]
After SMT, in 19338ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1133 ms.
Support contains 72 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 800/800 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 827 transition count 798
Applied a total of 4 rules in 32 ms. Remains 827 /829 variables (removed 2) and now considering 798/800 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 827/829 places, 798/800 transitions.
RANDOM walk for 40000 steps (12 resets) in 510 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 165092 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 165092 steps, saw 98695 distinct states, run finished after 3004 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 798 rows 827 cols
[2024-05-28 13:54:53] [INFO ] Computed 270 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 379/451 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 188/639 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/649 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 710/1359 variables, 649/855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 187/1546 variables, 118/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 37/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1546 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/1549 variables, 3/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1549 variables, 3/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1549 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/1553 variables, 2/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1553 variables, 4/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1553 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1555 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1555 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1555 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 52/1607 variables, 36/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1607 variables, 9/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1607 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1607 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3/1610 variables, 5/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 15/1625 variables, 12/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1625 variables, 6/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1625 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/1625 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1625/1625 variables, and 1097 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 827/827 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 379/451 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:54:56] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 188/639 variables, 70/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 18/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:58] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/649 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 710/1359 variables, 649/897 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1359 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:54:59] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:55:01] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1359 variables, 20/918 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1359 variables, 1/919 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:55:02] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1359 variables, 3/922 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 187/1546 variables, 118/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1546 variables, 37/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1546 variables, 2/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:03] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:55:03] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:55:03] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 3 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:55:04] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 4 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 4 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1546 variables, 20/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1546 variables, 1/1100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:55:08] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-05-28 13:55:08] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1546 variables, 3/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1546 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 3/1549 variables, 3/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1549 variables, 3/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1549 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 4/1553 variables, 2/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1553 variables, 4/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1553 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 2/1555 variables, 1/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1555 variables, 2/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1555 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 52/1607 variables, 36/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1607 variables, 9/1163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1607 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:09] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:55:09] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:55:09] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1607 variables, 8/1172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1607 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 3/1610 variables, 5/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1610 variables, 3/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1610 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1610 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1610 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 15/1625 variables, 12/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1625 variables, 6/1200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:55:12] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1625 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1625 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 0/1625 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1625/1625 variables, and 1201 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17885 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 827/827 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 101/101 constraints]
After SMT, in 19142ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 908 ms.
Support contains 72 out of 827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 798/798 transitions.
Applied a total of 0 rules in 17 ms. Remains 827 /827 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 827/827 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 798/798 transitions.
Applied a total of 0 rules in 17 ms. Remains 827 /827 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2024-05-28 13:55:14] [INFO ] Invariant cache hit.
[2024-05-28 13:55:14] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-28 13:55:14] [INFO ] Invariant cache hit.
[2024-05-28 13:55:15] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2024-05-28 13:55:15] [INFO ] Redundant transitions in 72 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-28 13:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/809 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 779 unsolved
SMT process timed out in 30252ms, After SMT, problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 30261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31580 ms. Remains : 827/827 places, 798/798 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 13:55:45] [INFO ] Flatten gal took : 76 ms
[2024-05-28 13:55:45] [INFO ] Applying decomposition
[2024-05-28 13:55:45] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4850937679543555498.txt' '-o' '/tmp/graph4850937679543555498.bin' '-w' '/tmp/graph4850937679543555498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4850937679543555498.bin' '-l' '-1' '-v' '-w' '/tmp/graph4850937679543555498.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:55:45] [INFO ] Decomposing Gal with order
[2024-05-28 13:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:55:46] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-28 13:55:46] [INFO ] Flatten gal took : 158 ms
[2024-05-28 13:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-28 13:55:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4275583330806130112.gal : 25 ms
[2024-05-28 13:55:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6108441417559555568.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4275583330806130112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6108441417559555568.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6108441417559555568.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 983
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :983 after 3.66121e+22
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.66121e+22 after 3.39937e+83
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.39937e+83 after 1.35957e+84
ITS-tools command line returned an error code 137
[2024-05-28 14:05:02] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8829651253538748264
[2024-05-28 14:05:02] [INFO ] Applying decomposition
[2024-05-28 14:05:02] [INFO ] Computing symmetric may disable matrix : 798 transitions.
[2024-05-28 14:05:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:02] [INFO ] Computing symmetric may enable matrix : 798 transitions.
[2024-05-28 14:05:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:02] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14802096620196525750.txt' '-o' '/tmp/graph14802096620196525750.bin' '-w' '/tmp/graph14802096620196525750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14802096620196525750.bin' '-l' '-1' '-v' '-w' '/tmp/graph14802096620196525750.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:05:02] [INFO ] Decomposing Gal with order
[2024-05-28 14:05:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:05:02] [INFO ] Computing Do-Not-Accords matrix : 798 transitions.
[2024-05-28 14:05:02] [INFO ] Removed a total of 613 redundant transitions.
[2024-05-28 14:05:02] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:02] [INFO ] Flatten gal took : 60 ms
[2024-05-28 14:05:02] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8829651253538748264
Running compilation step : cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 14:05:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 587 labels/synchronizations in 37 ms.
[2024-05-28 14:05:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4249054603527422949.gal : 11 ms
[2024-05-28 14:05:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11622658951550197806.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4249054603527422949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11622658951550197806.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability11622658951550197806.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 17
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :17 after 86405
Compilation finished in 2949 ms.
Running link step : cd /tmp/ltsmin8829651253538748264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202411==true'
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86405 after 259207
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :259207 after 2.2976e+17
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202313==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202313==true'
Running LTSmin : cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202415==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin8829651253538748264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability202411==true'
Detected timeout of ITS tools.
[2024-05-28 14:28:46] [INFO ] Applying decomposition
[2024-05-28 14:28:46] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:28:46] [INFO ] Decomposing Gal with order
[2024-05-28 14:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:28:47] [INFO ] Removed a total of 671 redundant transitions.
[2024-05-28 14:28:47] [INFO ] Flatten gal took : 165 ms
[2024-05-28 14:28:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1445 labels/synchronizations in 215 ms.
[2024-05-28 14:28:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3867582273381351839.gal : 51 ms
[2024-05-28 14:28:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18366256119554941714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3867582273381351839.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18366256119554941714.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability18366256119554941714.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 62
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :62 after 62
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :62 after 7.34852e+08
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :7.34852e+08 after 4.45708e+14
ITS-tools command line returned an error code 137
[2024-05-28 14:44:19] [INFO ] Flatten gal took : 109 ms
[2024-05-28 14:44:19] [INFO ] Input system was already deterministic with 798 transitions.
[2024-05-28 14:44:19] [INFO ] Transformed 827 places.
[2024-05-28 14:44:19] [INFO ] Transformed 798 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:44:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14728712686476100351.gal : 5 ms
[2024-05-28 14:44:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2033966052309456012.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14728712686476100351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2033966052309456012.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability2033966052309456012.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 22
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :22 after 129
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :129 after 365
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :365 after 1673
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1673 after 2605
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2605 after 51983
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :51983 after 8.03613e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :8.03613e+06 after 9.00532e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.00532e+06 after 3.32029e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.32029e+08 after 2.7802e+09
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.7802e+09 after 1.16493e+10
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.16493e+10 after 3.92204e+10
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :3.92204e+10 after 7.34516e+11
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :7.34516e+11 after 2.23374e+13
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :2.23374e+13 after 5.26304e+13
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :5.26304e+13 after 1.25685e+15
SDD proceeding with computation,3 properties remain. new max is 1048576
SDD size :1.25685e+15 after 1.2284e+16

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-PT-030B, 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 r356-tall-171683760400127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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