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-171683760400111.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 332K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716899755155

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 12:35:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:35:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:35:56] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-28 12:35:56] [INFO ] Transformed 1203 places.
[2024-05-28 12:35:56] [INFO ] Transformed 1183 transitions.
[2024-05-28 12:35:56] [INFO ] Found NUPN structural information;
[2024-05-28 12:35:56] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (14 resets) in 2178 ms. (18 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 3/3 properties
[2024-05-28 12:35:57] [INFO ] Flatten gal took : 365 ms
[2024-05-28 12:35:57] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 40004 steps (8 resets) in 638 ms. (62 steps per ms) remains 3/3 properties
[2024-05-28 12:35:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5011513724544889902.gal : 95 ms
[2024-05-28 12:35:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4953527065760763001.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/ReachabilityCardinality5011513724544889902.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4953527065760763001.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 ...328
// Phase 1: matrix 1183 rows 1203 cols
[2024-05-28 12:35:57] [INFO ] Computed 181 invariants in 54 ms
Loading property file /tmp/ReachabilityCardinality4953527065760763001.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 374
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :374 after 486
At refinement iteration 2 (OVERLAPS) 709/780 variables, 103/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :486 after 18163
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :18163 after 1.45699e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.45699e+08 after 5.81902e+13
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.53458e+30
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.53458e+30 after 1.96246e+50
At refinement iteration 3 (INCLUDED_ONLY) 0/780 variables, 709/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 423/1203 variables, 78/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 423/1384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1183/2386 variables, 1203/2587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2386/2386 variables, and 2587 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2099 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 709/780 variables, 103/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/780 variables, 709/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 12:36:00] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 33 ms to minimize.
[2024-05-28 12:36:00] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 2 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 8 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:36:01] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 32 ms to minimize.
[2024-05-28 12:36:02] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 11/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/780 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 423/1203 variables, 78/972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 423/1395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 12:36:02] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 16 ms to minimize.
[2024-05-28 12:36:02] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 7 ms to minimize.
[2024-05-28 12:36:03] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 5 ms to minimize.
[2024-05-28 12:36:03] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 3 ms to minimize.
[2024-05-28 12:36:03] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 6 ms to minimize.
[2024-05-28 12:36:04] [INFO ] Deduced a trap composed of 18 places in 676 ms of which 3 ms to minimize.
[2024-05-28 12:36:04] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-28 12:36:04] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-28 12:36:04] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:36:05] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:36:05] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:36:05] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 7343ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 1203 transition count 1102
Reduce places removed 81 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 88 rules applied. Total rules applied 169 place count 1122 transition count 1095
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 176 place count 1115 transition count 1095
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 176 place count 1115 transition count 995
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 376 place count 1015 transition count 995
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 500 place count 891 transition count 871
Iterating global reduction 3 with 124 rules applied. Total rules applied 624 place count 891 transition count 871
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 624 place count 891 transition count 832
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 702 place count 852 transition count 832
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Deduced a syphon composed of 278 places in 2 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 3 with 556 rules applied. Total rules applied 1258 place count 574 transition count 554
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 3 with 119 rules applied. Total rules applied 1377 place count 574 transition count 554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1378 place count 573 transition count 553
Applied a total of 1378 rules in 469 ms. Remains 573 /1203 variables (removed 630) and now considering 553/1183 (removed 630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 573/1203 places, 553/1183 transitions.
RANDOM walk for 40000 steps (20 resets) in 506 ms. (78 steps per ms) remains 2/3 properties
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
// Phase 1: matrix 553 rows 573 cols
[2024-05-28 12:36:06] [INFO ] Computed 181 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/363 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/433 variables, 31/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/439 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 502/941 variables, 439/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 143/1084 variables, 103/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 34/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1084 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1085 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1085 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1087 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1087 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1087 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 30/1117 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1117 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1117 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/1119 variables, 3/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1119 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/1121 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1121 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1121 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 5/1126 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1126 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1126 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1126 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/363 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 70/433 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/439 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 502/941 variables, 439/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 5 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:36:07] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/941 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/941 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 143/1084 variables, 103/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1084 variables, 34/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1084 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:36:08] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 9 ms to minimize.
[2024-05-28 12:36:09] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1084 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:36:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:36:11] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1084 variables, 10/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:11] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:36:11] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:36:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-28 12:36:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1084 variables, 4/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1085 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1085 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1085 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/1087 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1087 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1087 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 30/1117 variables, 20/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1117 variables, 5/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:36:12] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1117 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1117 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/1119 variables, 3/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1119 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1119 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 2/1121 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1121 variables, 2/800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1121 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 5/1126 variables, 4/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1126 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1126 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 0/1126 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 806 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5920 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 50/50 constraints]
After SMT, in 6663ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 789 ms.
Support contains 31 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 553/553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 573 transition count 549
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 569 transition count 549
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 569 transition count 541
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 25 place count 560 transition count 541
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 539 transition count 520
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 77 place count 539 transition count 520
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 533 transition count 514
Applied a total of 83 rules in 60 ms. Remains 533 /573 variables (removed 40) and now considering 514/553 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 533/573 places, 514/553 transitions.
RANDOM walk for 40000 steps (21 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428981 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428981 steps, saw 96474 distinct states, run finished after 3007 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 514 rows 533 cols
[2024-05-28 12:36:16] [INFO ] Computed 180 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/239 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/313 variables, 30/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/317 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 386/703 variables, 317/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/918 variables, 123/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 40/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/921 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 3/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/921 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/927 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/927 variables, 6/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/927 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 91/1018 variables, 60/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1018 variables, 18/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1018 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1021 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1021 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/1025 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1025 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1025 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 19/1044 variables, 14/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1044 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1044 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1044 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/1045 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1045 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1045 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/1047 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1047 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1047 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/1047 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 713 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/239 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/313 variables, 30/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/317 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 386/703 variables, 317/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 215/918 variables, 123/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 40/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/918 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/918 variables, 7/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/918 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/921 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/921 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/921 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/927 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/927 variables, 6/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/927 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/927 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 91/1018 variables, 60/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1018 variables, 18/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1018 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1018 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 3/1021 variables, 4/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1021 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1021 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/1025 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1025 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1025 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 19/1044 variables, 14/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1044 variables, 5/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1044 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1044 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1044 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1044 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1044 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/1045 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1045 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:36:19] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:36:20] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:36:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1045 variables, 5/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:36:20] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1045 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1045 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/1047 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1047 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1047 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/1047 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3256 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
After SMT, in 3659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 31 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 514/514 transitions.
Applied a total of 0 rules in 13 ms. Remains 533 /533 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 533/533 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 514/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 533 /533 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-28 12:36:20] [INFO ] Invariant cache hit.
[2024-05-28 12:36:21] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-28 12:36:21] [INFO ] Invariant cache hit.
[2024-05-28 12:36:21] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2024-05-28 12:36:21] [INFO ] Redundant transitions in 40 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-28 12:36:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:27] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:36:27] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:36:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:36:27] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:36:28] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:36:28] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 12:36:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 12/533 variables, 91/187 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:36:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:36:37] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:36:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:36:38] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:36:40] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:36:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 2 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:36:42] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:47] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-28 12:36:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-28 12:36:50] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:36:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:36:51] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:51] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:36:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1047 variables, and 249 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:55] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:36:58] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 12/533 variables, 91/212 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 39/251 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:37:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:37:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:37:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-28 12:37:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 11 (OVERLAPS) 514/1047 variables, 533/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1047 variables, 501/1289 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 1289 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 75/75 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61173 ms. Remains : 533/533 places, 514/514 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 12:37:21] [INFO ] Flatten gal took : 60 ms
[2024-05-28 12:37:21] [INFO ] Applying decomposition
[2024-05-28 12:37:22] [INFO ] Flatten gal took : 59 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/graph8855247023221950346.txt' '-o' '/tmp/graph8855247023221950346.bin' '-w' '/tmp/graph8855247023221950346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8855247023221950346.bin' '-l' '-1' '-v' '-w' '/tmp/graph8855247023221950346.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:37:22] [INFO ] Decomposing Gal with order
[2024-05-28 12:37:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:37:22] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:37:22] [INFO ] Flatten gal took : 119 ms
[2024-05-28 12:37:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-28 12:37:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2696393976135875687.gal : 22 ms
[2024-05-28 12:37:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17688375774430470095.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/ReachabilityCardinality2696393976135875687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17688375774430470095.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/ReachabilityCardinality17688375774430470095.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1.4525e+09
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.4525e+09 after 8.44091e+22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.0077e+55 after 3.06958e+56
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.06958e+56 after 7.27127e+56
ITS-tools command line returned an error code 137
[2024-05-28 12:45:54] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4969591330228648605
[2024-05-28 12:45:54] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-28 12:45:54] [INFO ] Applying decomposition
[2024-05-28 12:45:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:45:54] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-28 12:45:54] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:45:54] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:45:54] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-28 12:45:54] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:45:54] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4969591330228648605
Running compilation step : cd /tmp/ltsmin4969591330228648605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
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/graph17932750163065399505.txt' '-o' '/tmp/graph17932750163065399505.bin' '-w' '/tmp/graph17932750163065399505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17932750163065399505.bin' '-l' '-1' '-v' '-w' '/tmp/graph17932750163065399505.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:45:54] [INFO ] Decomposing Gal with order
[2024-05-28 12:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:45:54] [INFO ] Removed a total of 387 redundant transitions.
[2024-05-28 12:45:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 12:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 49 ms.
[2024-05-28 12:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1939557527722370515.gal : 13 ms
[2024-05-28 12:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13931947436179829253.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1939557527722370515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13931947436179829253.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/ReachabilityFireability13931947436179829253.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 18144
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.58234e+08 after 4.74048e+10
Invariant property ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 does not hold.
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.00169e+35,1.47458,56212,6139,233,127847,1126,937,186290,147,8968,0
Total reachable state count : 100169364020885757808124556730171392

Verifying 1 reachability properties.
Invariant property ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPs-PT-020B-ReachabilityFireability-2024-02,6.18324e+25,1.58005,56472,2007,200,127847,1126,1079,186290,165,8968,0
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 600169 ms.

BK_STOP 1716900356525

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-020B, 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-171683760400111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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