About the Execution of ITS-Tools for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16185.724 | 3600000.00 | 12641124.00 | 1783.00 | ??TTT?FF?TTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760900335.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 ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900335
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 860K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716945457194
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 01:17:38] [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-29 01:17:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:17:38] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-05-29 01:17:38] [INFO ] Transformed 3503 places.
[2024-05-29 01:17:38] [INFO ] Transformed 3253 transitions.
[2024-05-29 01:17:38] [INFO ] Found NUPN structural information;
[2024-05-29 01:17:38] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-29 01:17:39] [INFO ] Flatten gal took : 439 ms
RANDOM walk for 40000 steps (8 resets) in 2841 ms. (14 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 01:17:40] [INFO ] Flatten gal took : 132 ms
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
[2024-05-29 01:17:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6707677496925654193.gal : 110 ms
[2024-05-29 01:17:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7120947750958978210.prop : 2 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/ReachabilityCardinality6707677496925654193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7120947750958978210.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality7120947750958978210.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 01:17:41] [INFO ] Computed 451 invariants in 60 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2128/2396 variables, 273/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2128/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2396 variables, 0/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1107/3503 variables, 178/2847 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 1107/3954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 3253/6756 variables, 3503/7457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6756 variables, 0/7457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6756/6756 variables, and 7457 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5056 ms.
Refiners :[Domain max(s): 3503/3503 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3503/3503 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2128/2396 variables, 273/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2128/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 63
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :63 after 643
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :643 after 9223
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :9223 after 5.67589e+08
[2024-05-29 01:17:47] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 45 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :5.67589e+08 after 4.34846e+18
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :4.34846e+18 after 9.30908e+37
[2024-05-29 01:17:47] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 8 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :9.30908e+37 after 5.13271e+78
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 6 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 5 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 5 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 5 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 5 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 5 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 4 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 5 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 4 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-29 01:17:51] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-05-29 01:17:51] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2024-05-29 01:17:51] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
SMT process timed out in 10455ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 0 with 645 rules applied. Total rules applied 645 place count 3503 transition count 2608
Reduce places removed 645 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 715 rules applied. Total rules applied 1360 place count 2858 transition count 2538
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1430 place count 2788 transition count 2538
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 1430 place count 2788 transition count 2324
Deduced a syphon composed of 214 places in 13 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1858 place count 2574 transition count 2324
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 2171 place count 2261 transition count 2011
Iterating global reduction 3 with 313 rules applied. Total rules applied 2484 place count 2261 transition count 2011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2486 place count 2261 transition count 2009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2487 place count 2260 transition count 2009
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 2487 place count 2260 transition count 1907
Deduced a syphon composed of 102 places in 14 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 2691 place count 2158 transition count 1907
Performed 726 Post agglomeration using F-continuation condition.Transition count delta: 726
Deduced a syphon composed of 726 places in 3 ms
Reduce places removed 726 places and 0 transitions.
Iterating global reduction 5 with 1452 rules applied. Total rules applied 4143 place count 1432 transition count 1181
Renaming transitions due to excessive name length > 1024 char.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 4343 place count 1332 transition count 1223
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4354 place count 1332 transition count 1212
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4365 place count 1321 transition count 1212
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4404 place count 1321 transition count 1212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4405 place count 1320 transition count 1211
Applied a total of 4405 rules in 1151 ms. Remains 1320 /3503 variables (removed 2183) and now considering 1211/3253 (removed 2042) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1163 ms. Remains : 1320/3503 places, 1211/3253 transitions.
RANDOM walk for 40000 steps (8 resets) in 965 ms. (41 steps per ms) remains 7/11 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 7/7 properties
// Phase 1: matrix 1211 rows 1320 cols
[2024-05-29 01:17:53] [INFO ] Computed 451 invariants in 12 ms
[2024-05-29 01:17:53] [INFO ] State equation strengthened by 183 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 533/692 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 451/1143 variables, 192/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1143 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1082/2225 variables, 1143/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2225 variables, 174/1695 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2225 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 188/2413 variables, 98/1793 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2413 variables, 31/1824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2413 variables, 5/1829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2413 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 20/2433 variables, 15/1844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2433 variables, 8/1852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2433 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 14/2447 variables, 7/1859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2447 variables, 0/1859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 74/2521 variables, 64/1923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2521 variables, 15/1938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2521 variables, 4/1942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2521 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 3/2524 variables, 3/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2524 variables, 1/1946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2524 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 7/2531 variables, 6/1952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2531 variables, 2/1954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2531/2531 variables, and 1954 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4340 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 533/692 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 10 ms to minimize.
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-29 01:17:58] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
[2024-05-29 01:17:59] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:18:00] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 451/1143 variables, 192/407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
[2024-05-29 01:18:01] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 8 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1082/2225 variables, 1143/1573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2225 variables, 174/1747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2225 variables, 4/1751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:05] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:18:05] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-29 01:18:05] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-05-29 01:18:05] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-29 01:18:06] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-29 01:18:07] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-29 01:18:07] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2225 variables, 12/1763 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2225 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 188/2413 variables, 98/1861 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2413 variables, 31/1892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2413 variables, 5/1897 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2413 variables, 3/1900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:10] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-29 01:18:11] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:18:11] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 01:18:11] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 3 ms to minimize.
[2024-05-29 01:18:11] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 3 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 01:18:14] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2413 variables, 13/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:14] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-29 01:18:15] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2413 variables, 2/1915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:15] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 3 ms to minimize.
[2024-05-29 01:18:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 3 ms to minimize.
[2024-05-29 01:18:16] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2413 variables, 3/1918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2413 variables, 0/1918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 20/2433 variables, 15/1933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2433 variables, 8/1941 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:18] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 01:18:18] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-29 01:18:18] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-29 01:18:18] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2433 variables, 4/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2433 variables, 0/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 14/2447 variables, 7/1952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2447 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 74/2521 variables, 64/2016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2521 variables, 15/2031 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2521 variables, 4/2035 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:22] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2521 variables, 1/2036 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2521 variables, 0/2036 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 3/2524 variables, 3/2039 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2524 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2524 variables, 0/2040 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 7/2531 variables, 6/2046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2531 variables, 2/2048 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2531 variables, 0/2048 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 0/2531 variables, 0/2048 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2531/2531 variables, and 2048 constraints, problems are : Problem set: 0 solved, 7 unsolved in 28976 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 87/87 constraints]
After SMT, in 33387ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7355 ms.
Support contains 159 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1211/1211 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1320 transition count 1192
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 1301 transition count 1190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 1299 transition count 1190
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 42 place count 1299 transition count 1164
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 94 place count 1273 transition count 1164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 1270 transition count 1161
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 1270 transition count 1161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 1270 transition count 1160
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 1269 transition count 1160
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 244 place count 1198 transition count 1089
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 278 place count 1181 transition count 1104
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 1181 transition count 1102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 282 place count 1179 transition count 1102
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 289 place count 1179 transition count 1102
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 298 place count 1170 transition count 1093
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 300 place count 1168 transition count 1093
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 300 place count 1168 transition count 1092
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 302 place count 1167 transition count 1092
Applied a total of 302 rules in 277 ms. Remains 1167 /1320 variables (removed 153) and now considering 1092/1211 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 1167/1320 places, 1092/1211 transitions.
RANDOM walk for 40000 steps (8 resets) in 693 ms. (57 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 117315 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 7
Probabilistic random walk after 117315 steps, saw 72802 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 1092 rows 1167 cols
[2024-05-29 01:18:38] [INFO ] Computed 449 invariants in 3 ms
[2024-05-29 01:18:38] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 456/615 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 363/978 variables, 173/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 956/1934 variables, 978/1337 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1934 variables, 196/1533 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1934 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 213/2147 variables, 116/1649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2147 variables, 52/1701 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2147 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/2151 variables, 4/1705 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2151 variables, 4/1709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2151 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 8/2159 variables, 4/1713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2159 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 93/2252 variables, 64/1777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2252 variables, 26/1803 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/2253 variables, 2/1805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2253 variables, 1/1806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2253 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 6/2259 variables, 4/1810 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2259 variables, 2/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2259 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/2259 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2259/2259 variables, and 1812 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3723 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1167/1167 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 456/615 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:42] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:18:42] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-29 01:18:42] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:18:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 363/978 variables, 173/382 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:18:44] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
[2024-05-29 01:18:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 956/1934 variables, 978/1373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1934 variables, 196/1569 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1934 variables, 4/1573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:46] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-29 01:18:47] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-05-29 01:18:47] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-29 01:18:47] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:18:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-05-29 01:18:47] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:18:48] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1934 variables, 7/1580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1934 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 213/2147 variables, 116/1696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2147 variables, 52/1748 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2147 variables, 3/1751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:50] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-29 01:18:51] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2024-05-29 01:18:51] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
[2024-05-29 01:18:51] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-29 01:18:51] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-05-29 01:18:51] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-05-29 01:18:52] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-29 01:18:52] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-05-29 01:18:52] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-05-29 01:18:52] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2024-05-29 01:18:52] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-29 01:18:53] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-29 01:18:53] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:18:54] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:18:54] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-29 01:18:54] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-05-29 01:18:54] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2147 variables, 17/1768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2147 variables, 0/1768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/2151 variables, 4/1772 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2151 variables, 4/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2151 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 8/2159 variables, 4/1780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2159 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 93/2252 variables, 64/1844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2252 variables, 26/1870 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 01:18:59] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:18:59] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2252 variables, 2/1872 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2252 variables, 0/1872 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 1/2253 variables, 2/1874 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2253 variables, 1/1875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2253 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 6/2259 variables, 4/1879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2259 variables, 2/1881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2259 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 0/2259 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2259/2259 variables, and 1881 constraints, problems are : Problem set: 0 solved, 7 unsolved in 21930 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1167/1167 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 62/62 constraints]
After SMT, in 25703ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13184 ms.
Support contains 159 out of 1167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 1092/1092 transitions.
Applied a total of 0 rules in 26 ms. Remains 1167 /1167 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1167/1167 places, 1092/1092 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 1092/1092 transitions.
Applied a total of 0 rules in 24 ms. Remains 1167 /1167 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2024-05-29 01:19:17] [INFO ] Invariant cache hit.
[2024-05-29 01:19:18] [INFO ] Implicit Places using invariants in 529 ms returned [1155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 539 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1166/1167 places, 1092/1092 transitions.
Applied a total of 0 rules in 26 ms. Remains 1166 /1166 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 590 ms. Remains : 1166/1167 places, 1092/1092 transitions.
RANDOM walk for 40000 steps (8 resets) in 710 ms. (56 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 398 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 6/6 properties
// Phase 1: matrix 1092 rows 1166 cols
[2024-05-29 01:19:19] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 01:19:19] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 454/612 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/977 variables, 174/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 956/1933 variables, 977/1335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1933 variables, 196/1531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1933 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 213/2146 variables, 116/1647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2146 variables, 52/1699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2146 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/2150 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2150 variables, 4/1707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2150 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 8/2158 variables, 4/1711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2158 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 93/2251 variables, 64/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2251 variables, 26/1801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2251 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/2252 variables, 2/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2252 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2252 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 6/2258 variables, 4/1808 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2258 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2258 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/2258 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2258/2258 variables, and 1810 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1166/1166 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 454/612 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:22] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:19:23] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:19:24] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 365/977 variables, 174/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:19:25] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 01:19:26] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:27] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 956/1933 variables, 977/1378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 196/1574 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 3/1577 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:28] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:19:28] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2024-05-29 01:19:28] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 01:19:28] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1933 variables, 4/1581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:29] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-29 01:19:29] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:19:29] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1933 variables, 3/1584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:29] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1933 variables, 1/1585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:30] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1933 variables, 1/1586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1933 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 213/2146 variables, 116/1702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2146 variables, 52/1754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2146 variables, 3/1757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:33] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:19:33] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2146 variables, 2/1759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:34] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2146 variables, 1/1760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2146 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 4/2150 variables, 4/1764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2150 variables, 4/1768 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:19:36] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-29 01:19:36] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:19:36] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2150 variables, 3/1771 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2150 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 8/2158 variables, 4/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2158 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 93/2251 variables, 64/1839 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2251 variables, 26/1865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2251 variables, 0/1865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/2252 variables, 2/1867 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2252 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2252 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 6/2258 variables, 4/1872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2258 variables, 2/1874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2258 variables, 0/1874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/2258 variables, 0/1874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2258/2258 variables, and 1874 constraints, problems are : Problem set: 0 solved, 6 unsolved in 21540 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1166/1166 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 58/58 constraints]
After SMT, in 25009ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14115 ms.
Support contains 158 out of 1166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1166/1166 places, 1092/1092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1166 transition count 1091
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1165 transition count 1091
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1165 transition count 1091
Applied a total of 3 rules in 86 ms. Remains 1165 /1166 variables (removed 1) and now considering 1091/1092 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1165/1166 places, 1091/1092 transitions.
RANDOM walk for 40000 steps (8 resets) in 911 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 106608 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 6
Probabilistic random walk after 106608 steps, saw 66312 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1091 rows 1165 cols
[2024-05-29 01:20:02] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 01:20:02] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 453/611 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/976 variables, 174/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 955/1931 variables, 976/1334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1931 variables, 196/1530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1931 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 213/2144 variables, 116/1646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2144 variables, 52/1698 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2144 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/2148 variables, 4/1702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2148 variables, 4/1706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2148 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 8/2156 variables, 4/1710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2156 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 93/2249 variables, 64/1774 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2249 variables, 26/1800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2249 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/2250 variables, 2/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2250 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2250 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 6/2256 variables, 4/1807 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2256 variables, 2/1809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2256 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/2256 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 1809 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1165/1165 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 453/611 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 01:20:06] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 365/976 variables, 174/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 3 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-29 01:20:08] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/976 variables, 11/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 01:20:09] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-29 01:20:10] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/976 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:10] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/976 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:10] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-05-29 01:20:10] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:20:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/976 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/976 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 955/1931 variables, 976/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1931 variables, 196/1572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1931 variables, 3/1575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 01:20:12] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1931 variables, 7/1582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1931 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 213/2144 variables, 116/1698 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2144 variables, 52/1750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2144 variables, 3/1753 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 01:20:15] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-29 01:20:15] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:20:15] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-29 01:20:15] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:20:16] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-29 01:20:16] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:20:16] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-29 01:20:17] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2144 variables, 8/1761 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2144 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 4/2148 variables, 4/1765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2148 variables, 4/1769 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2148 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 8/2156 variables, 4/1773 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2156 variables, 0/1773 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 93/2249 variables, 64/1837 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2249 variables, 26/1863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2249 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/2250 variables, 2/1865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2250 variables, 1/1866 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2250 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 6/2256 variables, 4/1870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2256 variables, 2/1872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2256 variables, 0/1872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 0/2256 variables, 0/1872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2256/2256 variables, and 1872 constraints, problems are : Problem set: 0 solved, 6 unsolved in 17569 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1165/1165 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 57/57 constraints]
After SMT, in 21214ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12326 ms.
Support contains 158 out of 1165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1165/1165 places, 1091/1091 transitions.
Applied a total of 0 rules in 25 ms. Remains 1165 /1165 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1165/1165 places, 1091/1091 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1165/1165 places, 1091/1091 transitions.
Applied a total of 0 rules in 22 ms. Remains 1165 /1165 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
[2024-05-29 01:20:36] [INFO ] Invariant cache hit.
[2024-05-29 01:20:36] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-29 01:20:36] [INFO ] Invariant cache hit.
[2024-05-29 01:20:37] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-29 01:20:40] [INFO ] Implicit Places using invariants and state equation in 3252 ms returned []
Implicit Place search using SMT with State Equation took 3963 ms to find 0 implicit places.
[2024-05-29 01:20:40] [INFO ] Redundant transitions in 54 ms returned []
Running 1077 sub problems to find dead transitions.
[2024-05-29 01:20:40] [INFO ] Invariant cache hit.
[2024-05-29 01:20:40] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1153 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1153/2256 variables, and 108 constraints, problems are : Problem set: 0 solved, 1077 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 108/448 constraints, State Equation: 0/1165 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 1077/1077 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1077 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1153 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1153 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
At refinement iteration 2 (OVERLAPS) 12/1165 variables, 340/448 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
[2024-05-29 01:21:30] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 01:21:30] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:21:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 01:21:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 01:21:31] [INFO ] Deduced a trap composed of 7 places in 549 ms of which 0 ms to minimize.
[2024-05-29 01:21:31] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 01:21:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 01:21:33] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1165 variables, 20/468 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
[2024-05-29 01:21:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 01:21:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:21:35] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:21:35] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 01:21:36] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 01:21:38] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:21:38] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:21:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 01:21:38] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:21:38] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:21:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 20/488 constraints. Problems are: Problem set: 0 solved, 1077 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/2256 variables, and 488 constraints, problems are : Problem set: 0 solved, 1077 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 0/1165 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/1077 constraints, Known Traps: 40/40 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1077 unsolved
Search for dead transitions found 0 dead transitions in 60421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64473 ms. Remains : 1165/1165 places, 1091/1091 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 124 times.
Drop transitions (Partial Free agglomeration) removed 124 transitions
Iterating global reduction 0 with 124 rules applied. Total rules applied 124 place count 1165 transition count 1091
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 129 place count 1165 transition count 1086
Applied a total of 129 rules in 76 ms. Remains 1165 /1165 variables (removed 0) and now considering 1086/1091 (removed 5) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1086 rows 1165 cols
[2024-05-29 01:21:40] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 01:21:41] [INFO ] [Real]Absence check using 448 positive place invariants in 66 ms returned sat
[2024-05-29 01:21:41] [INFO ] After 749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 01:21:41] [INFO ] [Nat]Absence check using 448 positive place invariants in 65 ms returned sat
[2024-05-29 01:21:42] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 01:21:42] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-29 01:21:43] [INFO ] After 876ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-29 01:21:44] [INFO ] Deduced a trap composed of 5 places in 755 ms of which 2 ms to minimize.
[2024-05-29 01:21:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 2 ms to minimize.
[2024-05-29 01:21:44] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-29 01:21:45] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:21:46] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-05-29 01:21:46] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:21:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2478 ms
[2024-05-29 01:21:46] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 3 ms to minimize.
[2024-05-29 01:21:46] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-29 01:21:46] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-05-29 01:21:47] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 01:21:47] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-29 01:21:47] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-29 01:21:47] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-29 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1063 ms
[2024-05-29 01:21:47] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-29 01:21:48] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:21:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-29 01:21:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1270 ms
[2024-05-29 01:21:49] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-29 01:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-29 01:21:49] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 01:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
TRAPS : Iteration 1
[2024-05-29 01:21:49] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 01:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-29 01:21:50] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-05-29 01:21:50] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 3 ms to minimize.
[2024-05-29 01:21:50] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 4 ms to minimize.
[2024-05-29 01:21:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 863 ms
[2024-05-29 01:21:51] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2024-05-29 01:21:51] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:21:51] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-05-29 01:21:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1552 ms
[2024-05-29 01:21:53] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-29 01:21:53] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 2 ms to minimize.
[2024-05-29 01:21:53] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 01:21:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
TRAPS : Iteration 2
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 01:21:54] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-29 01:21:55] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-29 01:21:55] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-05-29 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1534 ms
[2024-05-29 01:21:55] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2024-05-29 01:21:56] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-29 01:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
TRAPS : Iteration 3
[2024-05-29 01:21:56] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 3 ms to minimize.
[2024-05-29 01:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2024-05-29 01:21:57] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-05-29 01:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
TRAPS : Iteration 4
[2024-05-29 01:21:58] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-29 01:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-29 01:21:58] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-29 01:21:59] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-05-29 01:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
TRAPS : Iteration 5
[2024-05-29 01:22:00] [INFO ] After 17703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-29 01:22:01] [INFO ] After 20142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 01:22:01] [INFO ] Flatten gal took : 52 ms
[2024-05-29 01:22:01] [INFO ] Flatten gal took : 45 ms
[2024-05-29 01:22:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16398002897432462214.gal : 11 ms
[2024-05-29 01:22:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11095778330843074595.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/ReachabilityCardinality16398002897432462214.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11095778330843074595.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
Loading property file /tmp/ReachabilityCardinality11095778330843074595.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :29 after 218
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :218 after 6482
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :6482 after 5.36544e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :5.36544e+07 after 1.57708e+14
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.57708e+14 after 2.81894e+22
Detected timeout of ITS tools.
[2024-05-29 01:22:16] [INFO ] Flatten gal took : 40 ms
[2024-05-29 01:22:16] [INFO ] Applying decomposition
[2024-05-29 01:22:16] [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/graph4794818306994537402.txt' '-o' '/tmp/graph4794818306994537402.bin' '-w' '/tmp/graph4794818306994537402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4794818306994537402.bin' '-l' '-1' '-v' '-w' '/tmp/graph4794818306994537402.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:22:17] [INFO ] Decomposing Gal with order
[2024-05-29 01:22:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:22:17] [INFO ] Removed a total of 551 redundant transitions.
[2024-05-29 01:22:17] [INFO ] Flatten gal took : 169 ms
[2024-05-29 01:22:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 94 ms.
[2024-05-29 01:22:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10652171655276426146.gal : 37 ms
[2024-05-29 01:22:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10871210191111293041.prop : 2 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/ReachabilityCardinality10652171655276426146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10871210191111293041.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 ...309
Loading property file /tmp/ReachabilityCardinality10871210191111293041.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :2 after 140
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :140 after 14906
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14906 after 715394
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :715394 after 1.78848e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.78848e+07 after 5.25693e+13
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5.25693e+13 after 2.50317e+24
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 does not hold.
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 does not hold.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-2024-08 is true.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-2024-01 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.41208e+26 after 1.59205e+77
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 52221 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 01:22:32] [INFO ] Flatten gal took : 71 ms
[2024-05-29 01:22:32] [INFO ] Applying decomposition
[2024-05-29 01:22:32] [INFO ] Flatten gal took : 76 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/graph16786162299192460374.txt' '-o' '/tmp/graph16786162299192460374.bin' '-w' '/tmp/graph16786162299192460374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16786162299192460374.bin' '-l' '-1' '-v' '-w' '/tmp/graph16786162299192460374.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:22:33] [INFO ] Decomposing Gal with order
[2024-05-29 01:22:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:22:33] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 01:22:33] [INFO ] Flatten gal took : 161 ms
[2024-05-29 01:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 01:22:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10426605873063510143.gal : 23 ms
[2024-05-29 01:22:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4338281217540889552.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/ReachabilityCardinality10426605873063510143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4338281217540889552.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/ReachabilityCardinality4338281217540889552.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 9234
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :9234 after 1.06734e+98
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.06734e+98 after 3.88297e+148
ITS-tools command line returned an error code 137
[2024-05-29 01:29:34] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7480941682530302311
[2024-05-29 01:29:34] [INFO ] Applying decomposition
[2024-05-29 01:29:34] [INFO ] Computing symmetric may disable matrix : 1091 transitions.
[2024-05-29 01:29:34] [INFO ] Flatten gal took : 39 ms
[2024-05-29 01:29:34] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:29:34] [INFO ] Computing symmetric may enable matrix : 1091 transitions.
[2024-05-29 01:29:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2448870333492460484.txt' '-o' '/tmp/graph2448870333492460484.bin' '-w' '/tmp/graph2448870333492460484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2448870333492460484.bin' '-l' '-1' '-v' '-w' '/tmp/graph2448870333492460484.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:29:34] [INFO ] Decomposing Gal with order
[2024-05-29 01:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:29:34] [INFO ] Removed a total of 684 redundant transitions.
[2024-05-29 01:29:34] [INFO ] Flatten gal took : 53 ms
[2024-05-29 01:29:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 21 ms.
[2024-05-29 01:29:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10315126079879064009.gal : 10 ms
[2024-05-29 01:29:34] [INFO ] Computing Do-Not-Accords matrix : 1091 transitions.
[2024-05-29 01:29:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7093386231633290702.prop : 69 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/ReachabilityFireability10315126079879064009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7093386231633290702.prop' '--nowitness'
[2024-05-29 01:29:34] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:29:34] [INFO ] Built C files in 533ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7480941682530302311
Running compilation step : cd /tmp/ltsmin7480941682530302311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' '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'
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/ReachabilityFireability7093386231633290702.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 59621
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :59621 after 596165
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :596165 after 7.00924e+13
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.73758e+26 after 1.01874e+31
Compilation finished in 4410 ms.
Running link step : cd /tmp/ltsmin7480941682530302311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202401==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202405==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202408==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202414==true'
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202414==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202401==true'
Detected timeout of ITS tools.
[2024-05-29 01:53:33] [INFO ] Applying decomposition
[2024-05-29 01:53:33] [INFO ] Flatten gal took : 94 ms
[2024-05-29 01:53:33] [INFO ] Decomposing Gal with order
[2024-05-29 01:53:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:53:33] [INFO ] Removed a total of 856 redundant transitions.
[2024-05-29 01:53:33] [INFO ] Flatten gal took : 103 ms
[2024-05-29 01:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 436 labels/synchronizations in 93 ms.
[2024-05-29 01:53:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17731385797771025141.gal : 25 ms
[2024-05-29 01:53:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9725298660339873793.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/ReachabilityFireability17731385797771025141.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9725298660339873793.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/ReachabilityFireability9725298660339873793.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 557
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :557 after 715397
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :715397 after 7.15392e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :7.15392e+06 after 2.31787e+10
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.31787e+10 after 1.514e+17
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.73758e+26 after 3.38191e+49
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin7480941682530302311;'/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' 'ShieldIIPtPT050BReachabilityFireability202405==true'
Detected timeout of ITS tools.
[2024-05-29 02:17:33] [INFO ] Flatten gal took : 87 ms
[2024-05-29 02:17:33] [INFO ] Input system was already deterministic with 1091 transitions.
[2024-05-29 02:17:33] [INFO ] Transformed 1165 places.
[2024-05-29 02:17:33] [INFO ] Transformed 1091 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-29 02:17:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7820104579463647845.gal : 5 ms
[2024-05-29 02:17:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15217323403186166590.prop : 6 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/ReachabilityFireability7820104579463647845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15217323403186166590.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/ReachabilityFireability15217323403186166590.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 120
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :120 after 2280
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2280 after 62760
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :62760 after 1.29373e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.29373e+07 after 1.68826e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.68826e+08 after 2.31872e+11
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.31872e+11 after 4.52929e+14
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.52929e+14 after 1.59031e+21
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="ShieldIIPt-PT-050B"
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 ShieldIIPt-PT-050B, 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-171683760900335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B 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 '
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 ;