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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717020898229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 22:14:59] [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 22:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:14:59] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-29 22:14:59] [INFO ] Transformed 3123 places.
[2024-05-29 22:14:59] [INFO ] Transformed 2843 transitions.
[2024-05-29 22:14:59] [INFO ] Found NUPN structural information;
[2024-05-29 22:14:59] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2266 ms. (17 steps per ms) remains 13/16 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 22:15:00] [INFO ] Flatten gal took : 350 ms
BEST_FIRST walk for 40004 steps (8 resets) in 775 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
[2024-05-29 22:15:00] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
[2024-05-29 22:15:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4462713978466933563.gal : 120 ms
[2024-05-29 22:15:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17878268117290826848.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/ReachabilityCardinality4462713978466933563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17878268117290826848.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 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 ...329
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 805 ms. (49 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality17878268117290826848.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
// Phase 1: matrix 2843 rows 3123 cols
[2024-05-29 22:15:01] [INFO ] Computed 441 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 294/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2518/2812 variables, 388/682 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2812 variables, 2518/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 311/3123 variables, 53/3253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3123 variables, 311/3564 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3123 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2843/5966 variables, 3123/6687 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
At refinement iteration 9 (INCLUDED_ONLY) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :58 after 873
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :873 after 303615
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :303615 after 5.34242e+08
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :5.34242e+08 after 1.12436e+16
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1.12436e+16 after 8.77745e+31
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5966/5966 variables, and 6687 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5029 ms.
Refiners :[Domain max(s): 3123/3123 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 3123/3123 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 294/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :8.77745e+31 after 1.24739e+70
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2518/2812 variables, 388/682 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2812 variables, 2518/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 69 ms to minimize.
[2024-05-29 22:15:08] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 8 ms to minimize.
[2024-05-29 22:15:09] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 6 ms to minimize.
[2024-05-29 22:15:09] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 9 ms to minimize.
[2024-05-29 22:15:10] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 7 ms to minimize.
[2024-05-29 22:15:10] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 7 ms to minimize.
[2024-05-29 22:15:10] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 8 ms to minimize.
[2024-05-29 22:15:11] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 7 ms to minimize.
[2024-05-29 22:15:11] [INFO ] Deduced a trap composed of 34 places in 362 ms of which 7 ms to minimize.
[2024-05-29 22:15:12] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 7 ms to minimize.
SMT process timed out in 10527ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 538 transitions
Trivial Post-agglo rules discarded 538 transitions
Performed 538 trivial Post agglomeration. Transition count delta: 538
Iterating post reduction 0 with 538 rules applied. Total rules applied 538 place count 3123 transition count 2305
Reduce places removed 538 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 619 rules applied. Total rules applied 1157 place count 2585 transition count 2224
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 1238 place count 2504 transition count 2224
Performed 173 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 173 Pre rules applied. Total rules applied 1238 place count 2504 transition count 2051
Deduced a syphon composed of 173 places in 5 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 1584 place count 2331 transition count 2051
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1822 place count 2093 transition count 1813
Iterating global reduction 3 with 238 rules applied. Total rules applied 2060 place count 2093 transition count 1813
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 2060 place count 2093 transition count 1733
Deduced a syphon composed of 80 places in 11 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2220 place count 2013 transition count 1733
Performed 545 Post agglomeration using F-continuation condition.Transition count delta: 545
Deduced a syphon composed of 545 places in 3 ms
Reduce places removed 545 places and 0 transitions.
Iterating global reduction 3 with 1090 rules applied. Total rules applied 3310 place count 1468 transition count 1188
Renaming transitions due to excessive name length > 1024 char.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 3462 place count 1392 transition count 1188
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 3467 place count 1392 transition count 1183
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 3472 place count 1387 transition count 1183
Partial Free-agglomeration rule applied 97 times.
Drop transitions (Partial Free agglomeration) removed 97 transitions
Iterating global reduction 4 with 97 rules applied. Total rules applied 3569 place count 1387 transition count 1183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3570 place count 1386 transition count 1182
Applied a total of 3570 rules in 1378 ms. Remains 1386 /3123 variables (removed 1737) and now considering 1182/2843 (removed 1661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1397 ms. Remains : 1386/3123 places, 1182/2843 transitions.
RANDOM walk for 40000 steps (8 resets) in 889 ms. (44 steps per ms) remains 11/13 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
// Phase 1: matrix 1182 rows 1386 cols
[2024-05-29 22:15:14] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 22:15:14] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 973/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 48/1310 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1310 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1155/2465 variables, 1310/1717 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2465 variables, 116/1833 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2465 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 81/2546 variables, 60/1893 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2546 variables, 22/1915 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2546 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2546 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 4/2550 variables, 6/1922 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2550 variables, 4/1926 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2550 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2554 variables, 2/1928 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2554 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 11/2565 variables, 10/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2565 variables, 3/1941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2565 variables, 0/1941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/2568 variables, 2/1943 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2568 variables, 1/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2568 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/2568 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2568/2568 variables, and 1944 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5872 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1386/1386 constraints, ReadFeed: 117/117 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/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 973/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 4 ms to minimize.
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 3 ms to minimize.
[2024-05-29 22:15:21] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:15:22] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:15:23] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 5 ms to minimize.
[2024-05-29 22:15:24] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-29 22:15:25] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 3 ms to minimize.
[2024-05-29 22:15:26] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1262 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 9 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-29 22:15:27] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 22:15:28] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:15:29] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 3 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 3 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:15:30] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 14/461 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:15:31] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-29 22:15:32] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-29 22:15:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1262 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:32] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:15:32] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1262 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1262 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 48/1310 variables, 20/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:33] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:15:33] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:15:33] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 3 ms to minimize.
[2024-05-29 22:15:33] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-05-29 22:15:33] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-29 22:15:34] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 3 ms to minimize.
[2024-05-29 22:15:35] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1310 variables, 19/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:36] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-29 22:15:36] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-29 22:15:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1310 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1310 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1155/2465 variables, 1310/1821 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2465 variables, 116/1937 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2465 variables, 5/1942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:38] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 4 ms to minimize.
[2024-05-29 22:15:38] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-29 22:15:38] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-05-29 22:15:39] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 4 ms to minimize.
[2024-05-29 22:15:39] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2024-05-29 22:15:39] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:15:39] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-29 22:15:40] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2465 variables, 8/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:40] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2465 variables, 1/1951 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:41] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2465 variables, 1/1952 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2465 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 81/2546 variables, 60/2012 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2546 variables, 22/2034 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2546 variables, 1/2035 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2546 variables, 6/2041 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:45] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:15:46] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:15:46] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:15:46] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:15:46] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:15:47] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:15:47] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-05-29 22:15:47] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-29 22:15:47] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-29 22:15:47] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:15:49] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2546 variables, 11/2052 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2546 variables, 0/2052 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 4/2550 variables, 6/2058 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2550 variables, 4/2062 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:15:53] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2550 variables, 1/2063 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2550 variables, 0/2063 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 4/2554 variables, 2/2065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2554 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 11/2565 variables, 10/2075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2565 variables, 3/2078 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2565 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 3/2568 variables, 2/2080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2568 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2568 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 0/2568 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2568/2568 variables, and 2081 constraints, problems are : Problem set: 0 solved, 11 unsolved in 44326 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1386/1386 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 126/126 constraints]
After SMT, in 50270ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 25463 ms.
Support contains 289 out of 1386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1386/1386 places, 1182/1182 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 1386 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1385 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1385 transition count 1180
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1384 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1383 transition count 1179
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1383 transition count 1179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1380 transition count 1176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1379 transition count 1176
Applied a total of 14 rules in 116 ms. Remains 1379 /1386 variables (removed 7) and now considering 1176/1182 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1379/1386 places, 1176/1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 602 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 433 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 91514 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 11
Probabilistic random walk after 91514 steps, saw 70197 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1176 rows 1379 cols
[2024-05-29 22:16:34] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 22:16:34] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 968/1257 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1257 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 46/1303 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1303 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1149/2452 variables, 1303/1710 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2452 variables, 118/1828 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2452 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 81/2533 variables, 60/1888 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2533 variables, 22/1910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2533 variables, 1/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2533 variables, 0/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 4/2537 variables, 6/1917 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2537 variables, 4/1921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2537 variables, 0/1921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2541 variables, 2/1923 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2541 variables, 0/1923 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 11/2552 variables, 10/1933 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2552 variables, 3/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2552 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/2555 variables, 2/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2555 variables, 1/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2555 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/2555 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2555/2555 variables, and 1939 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6044 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1379/1379 constraints, ReadFeed: 119/119 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/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 968/1257 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:41] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:16:41] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 4 ms to minimize.
[2024-05-29 22:16:41] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-05-29 22:16:41] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:16:41] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 4 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 3 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:16:42] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 4 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:16:43] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1257 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2024-05-29 22:16:44] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-05-29 22:16:45] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 3 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 3 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1257 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 3 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 3 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1257 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 3 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1257 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1257 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:53] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-29 22:16:53] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:53] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 46/1303 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 3 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 3 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 3 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 4 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1303 variables, 16/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1303 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:57] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1303 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:57] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1303 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1303 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1303 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1149/2452 variables, 1303/1820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 118/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 5/1943 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:16:59] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:16:59] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-29 22:16:59] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 4 ms to minimize.
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 4 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 6 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 11/1954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2452 variables, 3/1957 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2452 variables, 0/1957 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 81/2533 variables, 60/2017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2533 variables, 22/2039 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2533 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2533 variables, 6/2046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:17:09] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:17:09] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:17:09] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:17:09] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:17:10] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:17:10] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-05-29 22:17:10] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-29 22:17:10] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 22:17:10] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-29 22:17:11] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-29 22:17:11] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-29 22:17:11] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-29 22:17:12] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2533 variables, 13/2059 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:17:14] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:17:14] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:17:15] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2533 variables, 3/2062 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2533 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 4/2537 variables, 6/2068 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2537 variables, 4/2072 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2537 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 4/2541 variables, 2/2074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 22:17:22] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2024-05-29 22:17:23] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2541 variables, 2/2076 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2541 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 11/2552 variables, 10/2086 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2552 variables, 3/2089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2552 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 3/2555 variables, 2/2091 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2555 variables, 1/2092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2555 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (OVERLAPS) 0/2555 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2555/2555 variables, and 2092 constraints, problems are : Problem set: 0 solved, 11 unsolved in 53847 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1379/1379 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 142/142 constraints]
After SMT, in 59944ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 35333 ms.
Support contains 289 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 1176/1176 transitions.
Applied a total of 0 rules in 55 ms. Remains 1379 /1379 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1379/1379 places, 1176/1176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 1176/1176 transitions.
Applied a total of 0 rules in 40 ms. Remains 1379 /1379 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
[2024-05-29 22:18:10] [INFO ] Invariant cache hit.
[2024-05-29 22:18:10] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-29 22:18:10] [INFO ] Invariant cache hit.
[2024-05-29 22:18:11] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-29 22:18:13] [INFO ] Implicit Places using invariants and state equation in 2620 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2024-05-29 22:18:13] [INFO ] Redundant transitions in 70 ms returned []
Running 1158 sub problems to find dead transitions.
[2024-05-29 22:18:13] [INFO ] Invariant cache hit.
[2024-05-29 22:18:13] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1361 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1361/2555 variables, and 59 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 59/441 constraints, State Equation: 0/1379 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1361 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1361 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (OVERLAPS) 18/1379 variables, 382/441 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-29 22:19:07] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 22:19:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 22:19:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 22:19:08] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 22:19:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:19:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:19:08] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 22:19:09] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 22:19:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-29 22:19:13] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 22:19:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:19:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:19:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:19:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1379/2555 variables, and 466 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1379 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 0/1158 constraints, Known Traps: 25/25 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63651 ms. Remains : 1379/1379 places, 1176/1176 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 131 times.
Drop transitions (Partial Free agglomeration) removed 131 transitions
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1379 transition count 1176
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 1379 transition count 1175
Applied a total of 132 rules in 90 ms. Remains 1379 /1379 variables (removed 0) and now considering 1175/1176 (removed 1) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1175 rows 1379 cols
[2024-05-29 22:19:13] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 22:19:14] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 22:19:14] [INFO ] [Nat]Absence check using 441 positive place invariants in 70 ms returned sat
[2024-05-29 22:19:16] [INFO ] After 1364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 22:19:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-29 22:19:17] [INFO ] After 1245ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-29 22:19:18] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 7 ms to minimize.
[2024-05-29 22:19:18] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:19:18] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:19:19] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:19:19] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:19:19] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 3 ms to minimize.
[2024-05-29 22:19:19] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-29 22:19:20] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-05-29 22:19:20] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 4 ms to minimize.
[2024-05-29 22:19:20] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-29 22:19:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2875 ms
[2024-05-29 22:19:21] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 3 ms to minimize.
[2024-05-29 22:19:21] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 4 ms to minimize.
[2024-05-29 22:19:21] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:19:21] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 4 ms to minimize.
[2024-05-29 22:19:22] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
[2024-05-29 22:19:22] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 3 ms to minimize.
[2024-05-29 22:19:22] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 4 ms to minimize.
[2024-05-29 22:19:22] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 4 ms to minimize.
[2024-05-29 22:19:23] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 4 ms to minimize.
[2024-05-29 22:19:23] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 3 ms to minimize.
[2024-05-29 22:19:23] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-29 22:19:23] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 4 ms to minimize.
[2024-05-29 22:19:24] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 4 ms to minimize.
[2024-05-29 22:19:24] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-29 22:19:24] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 4 ms to minimize.
[2024-05-29 22:19:24] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-29 22:19:25] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 4 ms to minimize.
[2024-05-29 22:19:25] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:19:25] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-05-29 22:19:25] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 4 ms to minimize.
[2024-05-29 22:19:26] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-05-29 22:19:26] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 4 ms to minimize.
[2024-05-29 22:19:26] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5397 ms
[2024-05-29 22:19:26] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 3 ms to minimize.
[2024-05-29 22:19:26] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 3 ms to minimize.
[2024-05-29 22:19:27] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 4 ms to minimize.
[2024-05-29 22:19:27] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 4 ms to minimize.
[2024-05-29 22:19:27] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 4 ms to minimize.
[2024-05-29 22:19:27] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 4 ms to minimize.
[2024-05-29 22:19:28] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 4 ms to minimize.
[2024-05-29 22:19:28] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 4 ms to minimize.
[2024-05-29 22:19:28] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-05-29 22:19:28] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 4 ms to minimize.
[2024-05-29 22:19:29] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 4 ms to minimize.
[2024-05-29 22:19:29] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 3 ms to minimize.
[2024-05-29 22:19:29] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 4 ms to minimize.
[2024-05-29 22:19:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3216 ms
[2024-05-29 22:19:30] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-29 22:19:30] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-05-29 22:19:30] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 4 ms to minimize.
[2024-05-29 22:19:30] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 3 ms to minimize.
[2024-05-29 22:19:31] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 4 ms to minimize.
[2024-05-29 22:19:31] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-29 22:19:31] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 3 ms to minimize.
[2024-05-29 22:19:31] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 4 ms to minimize.
[2024-05-29 22:19:32] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-29 22:19:32] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 4 ms to minimize.
[2024-05-29 22:19:32] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 4 ms to minimize.
[2024-05-29 22:19:32] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:19:33] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4029 ms
[2024-05-29 22:19:34] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-29 22:19:34] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-29 22:19:34] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:19:34] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-05-29 22:19:34] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:19:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 968 ms
[2024-05-29 22:19:35] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:19:35] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-29 22:19:35] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-29 22:19:35] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:19:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 828 ms
[2024-05-29 22:19:36] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-29 22:19:36] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-29 22:19:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2024-05-29 22:19:36] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-29 22:19:36] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:19:37] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:19:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 591 ms
TRAPS : Iteration 1
[2024-05-29 22:19:37] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 4 ms to minimize.
[2024-05-29 22:19:37] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 4 ms to minimize.
[2024-05-29 22:19:38] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 3 ms to minimize.
[2024-05-29 22:19:38] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 4 ms to minimize.
[2024-05-29 22:19:38] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2024-05-29 22:19:38] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 3 ms to minimize.
[2024-05-29 22:19:39] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 4 ms to minimize.
[2024-05-29 22:19:39] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 3 ms to minimize.
[2024-05-29 22:19:39] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-05-29 22:19:39] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:19:39] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 4 ms to minimize.
[2024-05-29 22:19:40] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 4 ms to minimize.
[2024-05-29 22:19:40] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-29 22:19:40] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-05-29 22:19:40] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-05-29 22:19:41] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 4 ms to minimize.
[2024-05-29 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3667 ms
[2024-05-29 22:19:41] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-29 22:19:41] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 4 ms to minimize.
[2024-05-29 22:19:42] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-05-29 22:19:42] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 4 ms to minimize.
[2024-05-29 22:19:42] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-29 22:19:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 931 ms
[2024-05-29 22:19:42] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 4 ms to minimize.
[2024-05-29 22:19:43] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-29 22:19:43] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:19:43] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:19:43] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:19:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:19:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1305 ms
[2024-05-29 22:19:44] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:19:44] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 3 ms to minimize.
[2024-05-29 22:19:44] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 3 ms to minimize.
[2024-05-29 22:19:45] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 3 ms to minimize.
[2024-05-29 22:19:45] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-05-29 22:19:45] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:19:45] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-29 22:19:45] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 3 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:19:46] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:19:47] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 3 ms to minimize.
[2024-05-29 22:19:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2750 ms
[2024-05-29 22:19:47] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-05-29 22:19:48] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 4 ms to minimize.
[2024-05-29 22:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
TRAPS : Iteration 2
[2024-05-29 22:19:48] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 5 ms to minimize.
[2024-05-29 22:19:49] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 4 ms to minimize.
[2024-05-29 22:19:49] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-05-29 22:19:49] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 4 ms to minimize.
[2024-05-29 22:19:50] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 4 ms to minimize.
[2024-05-29 22:19:50] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 4 ms to minimize.
[2024-05-29 22:19:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1679 ms
[2024-05-29 22:19:50] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 4 ms to minimize.
[2024-05-29 22:19:51] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 4 ms to minimize.
[2024-05-29 22:19:51] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-29 22:19:51] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 4 ms to minimize.
[2024-05-29 22:19:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1031 ms
[2024-05-29 22:19:52] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:19:52] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-29 22:19:52] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-05-29 22:19:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2024-05-29 22:19:53] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
[2024-05-29 22:19:53] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 3 ms to minimize.
[2024-05-29 22:19:53] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 4 ms to minimize.
[2024-05-29 22:19:53] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:19:54] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:19:54] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-29 22:19:54] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 22:19:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1590 ms
[2024-05-29 22:19:54] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-05-29 22:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-29 22:19:55] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-29 22:19:55] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 4 ms to minimize.
[2024-05-29 22:19:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2024-05-29 22:19:55] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 3 ms to minimize.
[2024-05-29 22:19:56] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-29 22:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
TRAPS : Iteration 3
[2024-05-29 22:19:56] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:19:56] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-29 22:19:57] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 22:19:57] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:19:57] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:19:57] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-29 22:19:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1354 ms
[2024-05-29 22:19:58] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-05-29 22:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-29 22:19:58] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:19:58] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-29 22:19:58] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:19:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1239 ms
[2024-05-29 22:19:59] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 4 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 4 ms to minimize.
[2024-05-29 22:20:00] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 4 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 917 ms
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 4 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 4 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2024-05-29 22:20:03] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 4 ms to minimize.
[2024-05-29 22:20:03] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 5 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 4 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 5 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1301 ms
TRAPS : Iteration 4
[2024-05-29 22:20:05] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-05-29 22:20:05] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:20:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 4 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 741 ms
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 4 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 4 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 4 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 4 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1300 ms
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 4 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
TRAPS : Iteration 5
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 4 ms to minimize.
[2024-05-29 22:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 4 ms to minimize.
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 5 ms to minimize.
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 4 ms to minimize.
[2024-05-29 22:20:13] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 4 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 4 ms to minimize.
[2024-05-29 22:20:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1550 ms
[2024-05-29 22:20:14] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 5 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 5 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 4 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 4 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1102 ms
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 4 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 4 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 4 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 4 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 840 ms
TRAPS : Iteration 6
[2024-05-29 22:20:18] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 4 ms to minimize.
[2024-05-29 22:20:18] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:20:18] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 4 ms to minimize.
[2024-05-29 22:20:19] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 7 ms to minimize.
[2024-05-29 22:20:19] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:20:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1345 ms
[2024-05-29 22:20:19] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
[2024-05-29 22:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-05-29 22:20:20] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-29 22:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-29 22:20:20] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 4 ms to minimize.
[2024-05-29 22:20:21] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 4 ms to minimize.
[2024-05-29 22:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2024-05-29 22:20:21] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
[2024-05-29 22:20:21] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-29 22:20:22] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 3 ms to minimize.
[2024-05-29 22:20:22] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-29 22:20:22] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 4 ms to minimize.
[2024-05-29 22:20:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1231 ms
[2024-05-29 22:20:22] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:20:23] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:20:23] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-29 22:20:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 761 ms
[2024-05-29 22:20:23] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 4 ms to minimize.
[2024-05-29 22:20:24] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-05-29 22:20:24] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 4 ms to minimize.
[2024-05-29 22:20:24] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:20:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1054 ms
[2024-05-29 22:20:25] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 5 ms to minimize.
[2024-05-29 22:20:25] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 5 ms to minimize.
[2024-05-29 22:20:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
TRAPS : Iteration 7
[2024-05-29 22:20:25] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-29 22:20:26] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-29 22:20:26] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 4 ms to minimize.
[2024-05-29 22:20:26] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-29 22:20:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 976 ms
[2024-05-29 22:20:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-05-29 22:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-29 22:20:28] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 4 ms to minimize.
[2024-05-29 22:20:28] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 5 ms to minimize.
[2024-05-29 22:20:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 604 ms
[2024-05-29 22:20:28] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 4 ms to minimize.
[2024-05-29 22:20:29] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 4 ms to minimize.
[2024-05-29 22:20:29] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 5 ms to minimize.
[2024-05-29 22:20:29] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-05-29 22:20:30] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2024-05-29 22:20:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1351 ms
[2024-05-29 22:20:30] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 5 ms to minimize.
[2024-05-29 22:20:30] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 5 ms to minimize.
[2024-05-29 22:20:31] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 4 ms to minimize.
[2024-05-29 22:20:31] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2024-05-29 22:20:31] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-05-29 22:20:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1439 ms
[2024-05-29 22:20:32] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-05-29 22:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
TRAPS : Iteration 8
[2024-05-29 22:20:33] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:20:33] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:20:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2024-05-29 22:20:33] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 4 ms to minimize.
[2024-05-29 22:20:34] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-29 22:20:34] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-29 22:20:34] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-29 22:20:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 917 ms
[2024-05-29 22:20:34] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:20:35] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 4 ms to minimize.
[2024-05-29 22:20:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2024-05-29 22:20:35] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-05-29 22:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-29 22:20:36] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
[2024-05-29 22:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
TRAPS : Iteration 9
[2024-05-29 22:20:37] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 4 ms to minimize.
[2024-05-29 22:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2024-05-29 22:20:37] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 4 ms to minimize.
[2024-05-29 22:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-29 22:20:38] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 4 ms to minimize.
[2024-05-29 22:20:39] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 3 ms to minimize.
[2024-05-29 22:20:39] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 4 ms to minimize.
[2024-05-29 22:20:39] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:20:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 918 ms
[2024-05-29 22:20:40] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 5 ms to minimize.
[2024-05-29 22:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-05-29 22:20:40] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 9 ms to minimize.
[2024-05-29 22:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
TRAPS : Iteration 10
[2024-05-29 22:20:41] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 4 ms to minimize.
[2024-05-29 22:20:41] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-29 22:20:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2024-05-29 22:20:41] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-05-29 22:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-05-29 22:20:42] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-05-29 22:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2024-05-29 22:20:42] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 4 ms to minimize.
[2024-05-29 22:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-29 22:20:44] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-05-29 22:20:44] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-05-29 22:20:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
TRAPS : Iteration 11
[2024-05-29 22:20:45] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-05-29 22:20:46] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 4 ms to minimize.
[2024-05-29 22:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 540 ms
[2024-05-29 22:20:46] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-29 22:20:47] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-05-29 22:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-29 22:20:47] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
TRAPS : Iteration 12
[2024-05-29 22:20:48] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 4 ms to minimize.
[2024-05-29 22:20:48] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-29 22:20:50] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2024-05-29 22:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
TRAPS : Iteration 13
[2024-05-29 22:20:52] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:20:52] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:20:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2024-05-29 22:20:53] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:20:53] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-29 22:20:53] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:20:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2024-05-29 22:20:54] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 4 ms to minimize.
[2024-05-29 22:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-29 22:20:54] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2024-05-29 22:20:54] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 4 ms to minimize.
[2024-05-29 22:20:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 604 ms
TRAPS : Iteration 14
[2024-05-29 22:20:56] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
[2024-05-29 22:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-05-29 22:20:56] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-29 22:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-29 22:20:57] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-29 22:20:57] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 4 ms to minimize.
[2024-05-29 22:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2024-05-29 22:20:58] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 4 ms to minimize.
[2024-05-29 22:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
TRAPS : Iteration 15
[2024-05-29 22:21:00] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-29 22:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
TRAPS : Iteration 16
[2024-05-29 22:21:02] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-29 22:21:02] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:21:02] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 4 ms to minimize.
[2024-05-29 22:21:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 738 ms
[2024-05-29 22:21:03] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 4 ms to minimize.
[2024-05-29 22:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-29 22:21:04] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 4 ms to minimize.
[2024-05-29 22:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2024-05-29 22:21:04] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-29 22:21:05] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 4 ms to minimize.
[2024-05-29 22:21:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
TRAPS : Iteration 17
[2024-05-29 22:21:07] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 5 ms to minimize.
[2024-05-29 22:21:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2024-05-29 22:21:08] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-05-29 22:21:08] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 4 ms to minimize.
[2024-05-29 22:21:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2024-05-29 22:21:08] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2024-05-29 22:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-05-29 22:21:09] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2024-05-29 22:21:09] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 5 ms to minimize.
[2024-05-29 22:21:09] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 4 ms to minimize.
[2024-05-29 22:21:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
TRAPS : Iteration 18
[2024-05-29 22:21:11] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-29 22:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-29 22:21:11] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:21:11] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-29 22:21:12] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:21:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2024-05-29 22:21:12] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-29 22:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-29 22:21:13] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 4 ms to minimize.
[2024-05-29 22:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
TRAPS : Iteration 19
[2024-05-29 22:21:15] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 4 ms to minimize.
[2024-05-29 22:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
TRAPS : Iteration 20
[2024-05-29 22:21:17] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-05-29 22:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-05-29 22:21:18] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 5 ms to minimize.
[2024-05-29 22:21:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
TRAPS : Iteration 21
[2024-05-29 22:21:20] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 5 ms to minimize.
[2024-05-29 22:21:20] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-05-29 22:21:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 600 ms
[2024-05-29 22:21:21] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-05-29 22:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
TRAPS : Iteration 22
[2024-05-29 22:21:22] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-05-29 22:21:22] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-29 22:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-05-29 22:21:23] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:21:23] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-29 22:21:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
TRAPS : Iteration 23
[2024-05-29 22:21:26] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 4 ms to minimize.
[2024-05-29 22:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
TRAPS : Iteration 24
[2024-05-29 22:21:28] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-05-29 22:21:28] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-29 22:21:30] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 5 ms to minimize.
[2024-05-29 22:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
TRAPS : Iteration 25
[2024-05-29 22:21:32] [INFO ] After 136620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-29 22:21:34] [INFO ] After 140484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2024-05-29 22:21:34] [INFO ] Flatten gal took : 78 ms
[2024-05-29 22:21:34] [INFO ] Flatten gal took : 56 ms
[2024-05-29 22:21:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14876862861735283980.gal : 18 ms
[2024-05-29 22:21:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5241045202403835540.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/ReachabilityCardinality14876862861735283980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5241045202403835540.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 ...329
Loading property file /tmp/ReachabilityCardinality5241045202403835540.prop.
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 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :21 after 111
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :111 after 795
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :795 after 266115
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :266115 after 3.94458e+10
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3.94458e+10 after 6.31107e+22
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-2024-13 is true.
Detected timeout of ITS tools.
[2024-05-29 22:21:50] [INFO ] Flatten gal took : 43 ms
[2024-05-29 22:21:50] [INFO ] Applying decomposition
[2024-05-29 22:21:50] [INFO ] Flatten gal took : 42 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/graph15104287744677291669.txt' '-o' '/tmp/graph15104287744677291669.bin' '-w' '/tmp/graph15104287744677291669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15104287744677291669.bin' '-l' '-1' '-v' '-w' '/tmp/graph15104287744677291669.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:21:50] [INFO ] Decomposing Gal with order
[2024-05-29 22:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:21:50] [INFO ] Removed a total of 290 redundant transitions.
[2024-05-29 22:21:50] [INFO ] Flatten gal took : 167 ms
[2024-05-29 22:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 52 ms.
[2024-05-29 22:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3293079112481005289.gal : 17 ms
[2024-05-29 22:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality451920618221230392.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/ReachabilityCardinality3293079112481005289.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality451920618221230392.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 ...306
Loading property file /tmp/ReachabilityCardinality451920618221230392.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :1 after 471
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :471 after 47991
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :47991 after 1.23185e+07
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1.23185e+07 after 2.43437e+12
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2.43437e+12 after 1.94786e+19
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :7.35689e+35 after 1.89718e+58
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 172164 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 22:22:06] [INFO ] Flatten gal took : 63 ms
[2024-05-29 22:22:06] [INFO ] Applying decomposition
[2024-05-29 22:22:06] [INFO ] Flatten gal took : 64 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/graph17034665903596377830.txt' '-o' '/tmp/graph17034665903596377830.bin' '-w' '/tmp/graph17034665903596377830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17034665903596377830.bin' '-l' '-1' '-v' '-w' '/tmp/graph17034665903596377830.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:22:06] [INFO ] Decomposing Gal with order
[2024-05-29 22:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:22:06] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 22:22:06] [INFO ] Flatten gal took : 131 ms
[2024-05-29 22:22:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 22:22:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12801218980286174724.gal : 24 ms
[2024-05-29 22:22:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7135922614409170584.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/ReachabilityCardinality12801218980286174724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7135922614409170584.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/ReachabilityCardinality7135922614409170584.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 2658
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :2658 after 1.59578e+85
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1.59578e+85 after 5.68081e+119
ITS-tools command line returned an error code 137
[2024-05-29 22:28:48] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9191143789776740832
[2024-05-29 22:28:48] [INFO ] Applying decomposition
[2024-05-29 22:28:48] [INFO ] Computing symmetric may disable matrix : 1176 transitions.
[2024-05-29 22:28:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 22:28:48] [INFO ] Computing symmetric may enable matrix : 1176 transitions.
[2024-05-29 22:28:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 22:28:48] [INFO ] Flatten gal took : 35 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/graph5648917069451171819.txt' '-o' '/tmp/graph5648917069451171819.bin' '-w' '/tmp/graph5648917069451171819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5648917069451171819.bin' '-l' '-1' '-v' '-w' '/tmp/graph5648917069451171819.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:28:48] [INFO ] Decomposing Gal with order
[2024-05-29 22:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:28:48] [INFO ] Removed a total of 443 redundant transitions.
[2024-05-29 22:28:48] [INFO ] Flatten gal took : 58 ms
[2024-05-29 22:28:48] [INFO ] Computing Do-Not-Accords matrix : 1176 transitions.
[2024-05-29 22:28:48] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 22:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 25 ms.
[2024-05-29 22:28:49] [INFO ] Built C files in 469ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9191143789776740832
[2024-05-29 22:28:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5489371697168547580.gal : 13 ms
[2024-05-29 22:28:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability847808726243360994.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/ReachabilityFireability5489371697168547580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability847808726243360994.prop' '--nowitness'
Running compilation step : cd /tmp/ltsmin9191143789776740832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '65' '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 ...306
Loading property file /tmp/ReachabilityFireability847808726243360994.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 75
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :75 after 116679
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :116679 after 4.63061e+07
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :4.63061e+07 after 7.3031e+13
Compilation finished in 4657 ms.
Running link step : cd /tmp/ltsmin9191143789776740832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202300==true'
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-2024-13 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-2024-10 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-2024-09 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-2024-08 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-2024-07 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-2024-06 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-2024-01 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.01213e+34 after 4.45434e+99
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202415==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202300==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202415==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin9191143789776740832;'/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' 'ShieldPPPtPT040BReachabilityFireability202415==true'
ITS-tools command line returned an error code 137
[2024-05-29 22:50:23] [INFO ] Applying decomposition
[2024-05-29 22:50:23] [INFO ] Flatten gal took : 33 ms
[2024-05-29 22:50:23] [INFO ] Decomposing Gal with order
[2024-05-29 22:50:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:50:24] [INFO ] Removed a total of 419 redundant transitions.
[2024-05-29 22:50:24] [INFO ] Flatten gal took : 53 ms
[2024-05-29 22:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 20 ms.
[2024-05-29 22:50:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12970879955211523006.gal : 11 ms
[2024-05-29 22:50:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4854388174774920848.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/ReachabilityFireability12970879955211523006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4854388174774920848.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/ReachabilityFireability4854388174774920848.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 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 3927
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3927 after 141303
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :141303 after 2.0077e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.0077e+09 after 3.33995e+15
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.33995e+15 after 6.31107e+22
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8.05675e+35 after 3.2094e+61
ITS-tools command line returned an error code 137
[2024-05-29 23:04:41] [INFO ] Flatten gal took : 38 ms
[2024-05-29 23:04:41] [INFO ] Input system was already deterministic with 1176 transitions.
[2024-05-29 23:04:41] [INFO ] Transformed 1379 places.
[2024-05-29 23:04:41] [INFO ] Transformed 1176 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 23:04:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6047923440552628719.gal : 5 ms
[2024-05-29 23:04:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6105052517459676247.prop : 11 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/ReachabilityFireability6047923440552628719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6105052517459676247.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 ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability6105052517459676247.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 30
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :30 after 147
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :147 after 682
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :682 after 2050
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2050 after 10674
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :10674 after 1.61175e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.61175e+06 after 6.12967e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.12967e+07 after 7.20773e+11
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :7.20773e+11 after 3.80568e+16
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.80568e+16 after 4.48239e+24
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :4.48239e+24 after 2.18907e+34

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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761600671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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