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.r092-tall-171624189900749.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 DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716362766129

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 07:26:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 07:26:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:26:07] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-22 07:26:07] [INFO ] Transformed 354 places.
[2024-05-22 07:26:07] [INFO ] Transformed 311 transitions.
[2024-05-22 07:26:07] [INFO ] Found NUPN structural information;
[2024-05-22 07:26:07] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 297 rows 354 cols
[2024-05-22 07:26:07] [INFO ] Computed 59 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (223 resets) in 54 ms. (181 steps per ms)
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (372 resets) in 137 ms. (579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 07:26:07] [INFO ] Invariant cache hit.
[2024-05-22 07:26:08] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2024-05-22 07:26:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 07:26:08] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-22 07:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 07:26:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:08] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-22 07:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:26:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-05-22 07:26:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
[2024-05-22 07:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-22 07:26:09] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 30 ms.
[2024-05-22 07:26:10] [INFO ] Added : 125 causal constraints over 25 iterations in 1083 ms. Result :sat
Minimization took 246 ms.
[2024-05-22 07:26:10] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2024-05-22 07:26:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:10] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-22 07:26:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-22 07:26:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 07:26:10] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-22 07:26:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 62 ms returned sat
[2024-05-22 07:26:11] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-22 07:26:11] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 26 ms.
[2024-05-22 07:26:12] [INFO ] Added : 142 causal constraints over 29 iterations in 1030 ms. Result :sat
Minimization took 236 ms.
[2024-05-22 07:26:12] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2024-05-22 07:26:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 07:26:12] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-22 07:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 07:26:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:12] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-22 07:26:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2024-05-22 07:26:13] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-22 07:26:13] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 24 ms.
[2024-05-22 07:26:15] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-22 07:26:15] [INFO ] Added : 202 causal constraints over 41 iterations in 1782 ms. Result :sat
Minimization took 388 ms.
[2024-05-22 07:26:15] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:15] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-22 07:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 07:26:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 07:26:16] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-22 07:26:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2024-05-22 07:26:16] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-22 07:26:18] [INFO ] Added : 180 causal constraints over 37 iterations in 1913 ms. Result :sat
Minimization took 253 ms.
[2024-05-22 07:26:18] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-22 07:26:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:18] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-22 07:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 07:26:19] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2024-05-22 07:26:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2024-05-22 07:26:19] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 20 ms.
[2024-05-22 07:26:19] [INFO ] Added : 98 causal constraints over 20 iterations in 668 ms. Result :sat
Minimization took 259 ms.
[2024-05-22 07:26:20] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-22 07:26:20] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-22 07:26:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 07:26:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 07:26:20] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-22 07:26:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2024-05-22 07:26:20] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 07:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-22 07:26:20] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-22 07:26:22] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 3 ms to minimize.
[2024-05-22 07:26:22] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:26:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2024-05-22 07:26:22] [INFO ] Added : 210 causal constraints over 43 iterations in 1773 ms. Result :sat
Minimization took 315 ms.
[2024-05-22 07:26:22] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 07:26:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:23] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-22 07:26:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 07:26:23] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-22 07:26:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2024-05-22 07:26:23] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-22 07:26:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-22 07:26:24] [INFO ] Added : 149 causal constraints over 30 iterations in 1106 ms. Result :sat
Minimization took 357 ms.
[2024-05-22 07:26:24] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 07:26:25] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-22 07:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 07:26:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:25] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-22 07:26:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2024-05-22 07:26:25] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-22 07:26:26] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:26:26] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:26:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-05-22 07:26:26] [INFO ] Added : 94 causal constraints over 19 iterations in 928 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 111 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:26:29] [INFO ] Computed 60 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13631 resets) in 2037 ms. (490 steps per ms)
BEST_FIRST walk for 8000008 steps (18176 resets) in 7322 ms. (1092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 07:26:39] [INFO ] Invariant cache hit.
[2024-05-22 07:26:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:39] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 07:26:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:26:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2024-05-22 07:26:39] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-22 07:26:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:26:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-22 07:26:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 22 ms.
[2024-05-22 07:26:40] [INFO ] Added : 145 causal constraints over 29 iterations in 689 ms. Result :sat
Minimization took 173 ms.
[2024-05-22 07:26:40] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:26:40] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 07:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-22 07:26:40] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-22 07:26:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-22 07:26:40] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 07:26:41] [INFO ] Added : 136 causal constraints over 28 iterations in 615 ms. Result :sat
Minimization took 149 ms.
[2024-05-22 07:26:41] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-22 07:26:41] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-22 07:26:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 07:26:41] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-22 07:26:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 07:26:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:26:42] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-22 07:26:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 07:26:43] [INFO ] Added : 245 causal constraints over 49 iterations in 1152 ms. Result :sat
Minimization took 232 ms.
[2024-05-22 07:26:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-22 07:26:43] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-22 07:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 07:26:43] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-22 07:26:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2024-05-22 07:26:43] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-22 07:26:44] [INFO ] Added : 197 causal constraints over 40 iterations in 909 ms. Result :sat
Minimization took 200 ms.
[2024-05-22 07:26:45] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Real]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-22 07:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-22 07:26:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2024-05-22 07:26:45] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-22 07:26:46] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 07:26:46] [INFO ] Added : 97 causal constraints over 20 iterations in 533 ms. Result :sat
Minimization took 151 ms.
[2024-05-22 07:26:46] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 07:26:46] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-22 07:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:26:46] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-22 07:26:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 25 ms returned sat
[2024-05-22 07:26:46] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:26:46] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-22 07:26:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2024-05-22 07:26:46] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 07:26:48] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-22 07:26:48] [INFO ] Added : 261 causal constraints over 53 iterations in 1399 ms. Result :sat
Minimization took 190 ms.
[2024-05-22 07:26:48] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:26:48] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-22 07:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-22 07:26:48] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-22 07:26:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-22 07:26:49] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-22 07:26:49] [INFO ] Added : 170 causal constraints over 34 iterations in 862 ms. Result :sat
Minimization took 156 ms.
[2024-05-22 07:26:50] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:26:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:26:50] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-22 07:26:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:26:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 07:26:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:26:50] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-22 07:26:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-22 07:26:50] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-22 07:26:50] [INFO ] Added : 72 causal constraints over 15 iterations in 357 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 23 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 07:26:54] [INFO ] Invariant cache hit.
[2024-05-22 07:26:54] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 07:26:54] [INFO ] Invariant cache hit.
[2024-05-22 07:26:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:26:54] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-22 07:26:54] [INFO ] Redundant transitions in 12 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-22 07:26:55] [INFO ] Invariant cache hit.
[2024-05-22 07:26:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:02] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:09] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:11] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:27:14] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:22] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:27:27] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:27:29] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:27:29] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-22 07:27:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61072 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (545 resets) in 1646 ms. (24 steps per ms) remains 16/16 properties
[2024-05-22 07:27:55] [INFO ] Flatten gal took : 154 ms
BEST_FIRST walk for 4004 steps (12 resets) in 86 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
[2024-05-22 07:27:55] [INFO ] Flatten gal took : 77 ms
BEST_FIRST walk for 4002 steps (11 resets) in 76 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
[2024-05-22 07:27:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7218001226766198338.gal : 17 ms
[2024-05-22 07:27:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9595716145219903235.prop : 0 ms
BEST_FIRST walk for 4004 steps (10 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
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/ReachabilityCardinality7218001226766198338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9595716145219903235.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (10 resets) in 51 ms. (76 steps per ms) remains 16/16 properties

BEST_FIRST walk for 4002 steps (11 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality9595716145219903235.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :8 after 20
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :20 after 36
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :36 after 44
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :44 after 624
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :624 after 676
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :676 after 3028
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3028 after 19204
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :19204 after 78688
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :78688 after 84712
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :364744 after 1.60049e+08
Interrupted probabilistic random walk after 631865 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 16
Probabilistic random walk after 631865 steps, saw 90990 distinct states, run finished after 3005 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-22 07:27:59] [INFO ] Invariant cache hit.
[2024-05-22 07:27:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3100 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :1.60049e+08 after 2.41645e+08
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 07:28:04] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:28:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-22 07:28:04] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:28:04] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 07:28:05] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
SDD proceeding with computation,16 properties remain. new max is 65536
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8119ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 2 different solutions.
SDD size :2.41645e+08 after 6.78415e+08
Parikh walk visited 0 properties in 603 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (541 resets) in 386 ms. (103 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 668768 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 16
Probabilistic random walk after 668768 steps, saw 96173 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-22 07:28:11] [INFO ] Invariant cache hit.
[2024-05-22 07:28:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 07:28:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:28:16] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:28:16] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:28:16] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 07:28:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8072ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2217 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 07:28:21] [INFO ] Invariant cache hit.
[2024-05-22 07:28:21] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 07:28:21] [INFO ] Invariant cache hit.
[2024-05-22 07:28:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:28:22] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-22 07:28:22] [INFO ] Redundant transitions in 5 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-22 07:28:22] [INFO ] Invariant cache hit.
[2024-05-22 07:28:22] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 131072
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
SDD size :7.29588e+08 after 7.96509e+09
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:28:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:28:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:28:37] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:28:40] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:28:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 262144
SDD size :8.25738e+09 after 8.28403e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Detected timeout of ITS tools.
[2024-05-22 07:28:46] [INFO ] Flatten gal took : 29 ms
[2024-05-22 07:28:46] [INFO ] Applying decomposition
[2024-05-22 07:28:46] [INFO ] Flatten gal took : 26 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/graph13673117301890967291.txt' '-o' '/tmp/graph13673117301890967291.bin' '-w' '/tmp/graph13673117301890967291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13673117301890967291.bin' '-l' '-1' '-v' '-w' '/tmp/graph13673117301890967291.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:28:46] [INFO ] Decomposing Gal with order
[2024-05-22 07:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:28:46] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 07:28:46] [INFO ] Flatten gal took : 63 ms
[2024-05-22 07:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 07:28:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12865759447682293428.gal : 6 ms
[2024-05-22 07:28:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14290333347544983313.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/ReachabilityCardinality12865759447682293428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14290333347544983313.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14290333347544983313.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :28 after 124
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :124 after 2640
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :8206 after 3.53415e+08
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :3.53415e+08 after 1.0256e+09
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.0256e+09 after 1.79232e+09
[2024-05-22 07:28:48] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 8 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.79232e+09 after 2.94239e+09
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :2.94239e+09 after 4.95501e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 07:28:54] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:28:56] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2024-05-22 07:28:56] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:28:56] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1.13135e+13 after 1.15359e+13
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.77951e+13 after 1.79263e+13
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.28363e+13 after 2.29626e+13
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.71573e+13 after 2.78775e+13
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60888 ms. Remains : 351/351 places, 293/293 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:29:22] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 07:29:22] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:29:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 07:29:22] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 07:29:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:29:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:29:22] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 07:29:22] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 1
[2024-05-22 07:29:23] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 07:29:23] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-22 07:29:23] [INFO ] Flatten gal took : 25 ms
[2024-05-22 07:29:23] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:29:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9192460062769415407.gal : 7 ms
[2024-05-22 07:29:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6807543514720741727.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/ReachabilityCardinality9192460062769415407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6807543514720741727.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6807543514720741727.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 28
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :28 after 36
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :36 after 56
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :56 after 136
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :136 after 1092
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1092 after 1548
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1548 after 14620
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :14620 after 91564
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :91564 after 101132
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :455944 after 515564
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.21985e+13 after 3.24477e+13
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :515564 after 3.90377e+08
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :3.90377e+08 after 7.67277e+08
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2024-05-22 07:29:38] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:29:38] [INFO ] Applying decomposition
[2024-05-22 07:29:38] [INFO ] Flatten gal took : 19 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/graph11133468450958173343.txt' '-o' '/tmp/graph11133468450958173343.bin' '-w' '/tmp/graph11133468450958173343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11133468450958173343.bin' '-l' '-1' '-v' '-w' '/tmp/graph11133468450958173343.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:29:38] [INFO ] Decomposing Gal with order
[2024-05-22 07:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:29:38] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 07:29:38] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 07:29:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14740122494546835296.gal : 4 ms
[2024-05-22 07:29:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14568901839169893815.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/ReachabilityCardinality14740122494546835296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14568901839169893815.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14568901839169893815.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 52
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :52 after 670
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :670 after 1420
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :10748 after 1.18784e+08
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.18784e+08 after 2.4201e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.4201e+08 after 4.14516e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.14516e+08 after 6.36315e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.36315e+08 after 1.00598e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.37203e+13 after 1.38973e+13
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.0919e+13,4.36353,131732,10065,12151,289429,31528,241,255717,537,227405,0
Total reachable state count : 40919038985498

Verifying 4 reachability properties.
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1.26512e+11,4.37692,131732,1080,1254,289429,31528,243,255717,540,227405,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1.26512e+11,4.38093,131732,1080,1254,289429,31528,247,255717,542,227405,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,1.34024e+07,4.38292,131732,394,966,289429,31528,249,255717,544,227405,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,1.34024e+07,4.38488,131732,394,966,289429,31528,253,255717,546,227405,0
Over-approximation ignoring read arcs solved 0 properties in 20484 ms.
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for DES-PT-60a-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:29:42] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (130 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10000 steps (21 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:29:43] [INFO ] Invariant cache hit.
[2024-05-22 07:29:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:29:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 07:29:43] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-22 07:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:29:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:29:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:29:43] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-22 07:29:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:29:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-22 07:29:43] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:29:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:29:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-22 07:29:43] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 07:29:44] [INFO ] Added : 245 causal constraints over 49 iterations in 1142 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p69) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Applied a total of 8 rules in 23 ms. Remains 343 /351 variables (removed 8) and now considering 284/292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 343/351 places, 284/292 transitions.
// Phase 1: matrix 284 rows 343 cols
[2024-05-22 07:29:45] [INFO ] Computed 61 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13644 resets) in 1934 ms. (516 steps per ms)
BEST_FIRST walk for 1000000 steps (2268 resets) in 925 ms. (1079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:29:48] [INFO ] Invariant cache hit.
[2024-05-22 07:29:48] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 07:29:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:29:48] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-22 07:29:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:29:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 07:29:48] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:29:48] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-22 07:29:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:29:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2024-05-22 07:29:48] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:29:48] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-05-22 07:29:48] [INFO ] Computed and/alt/rep : 275/461/275 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 07:29:50] [INFO ] Added : 245 causal constraints over 50 iterations in 1120 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 343/343 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 8 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-22 07:29:50] [INFO ] Invariant cache hit.
[2024-05-22 07:29:50] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 07:29:50] [INFO ] Invariant cache hit.
[2024-05-22 07:29:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:29:51] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-22 07:29:51] [INFO ] Redundant transitions in 3 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-22 07:29:51] [INFO ] Invariant cache hit.
[2024-05-22 07:29:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 2/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/342 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 8 (OVERLAPS) 284/626 variables, 342/403 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 2/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (OVERLAPS) 1/627 variables, 1/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 406 constraints, problems are : Problem set: 14 solved, 267 unsolved in 19975 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 343/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 35/35 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/52 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-22 07:30:11] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 1/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 15/342 variables, 8/62 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-22 07:30:16] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 5 ms to minimize.
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 52 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 5/67 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:30:18] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 284/626 variables, 342/411 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 2/413 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 267/680 constraints. Problems are: Problem set: 14 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/627 variables, and 680 constraints, problems are : Problem set: 14 solved, 267 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 342/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/281 constraints, Known Traps: 8/8 constraints]
After SMT, in 50218ms problems are : Problem set: 14 solved, 267 unsolved
Search for dead transitions found 14 dead transitions in 50221ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 343/343 places, 270/284 transitions.
Graph (complete) has 1150 edges and 343 vertex of which 329 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 329 /343 variables (removed 14) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 329 cols
[2024-05-22 07:30:41] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 07:30:41] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 07:30:41] [INFO ] Invariant cache hit.
[2024-05-22 07:30:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:30:42] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 329/343 places, 270/284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51486 ms. Remains : 329/343 places, 270/284 transitions.
[2024-05-22 07:30:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13655 resets) in 1940 ms. (515 steps per ms)
BEST_FIRST walk for 1000001 steps (2290 resets) in 883 ms. (1131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:30:45] [INFO ] Invariant cache hit.
[2024-05-22 07:30:45] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-22 07:30:45] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 07:30:45] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 07:30:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:30:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 07:30:45] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 07:30:45] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-22 07:30:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:30:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-22 07:30:45] [INFO ] Computed and/alt/rep : 261/423/261 causal constraints (skipped 6 transitions) in 21 ms.
[2024-05-22 07:30:46] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-22 07:30:46] [INFO ] Added : 197 causal constraints over 40 iterations in 929 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 329/329 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-22 07:30:47] [INFO ] Invariant cache hit.
[2024-05-22 07:30:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 07:30:47] [INFO ] Invariant cache hit.
[2024-05-22 07:30:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:30:47] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-22 07:30:47] [INFO ] Redundant transitions in 3 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-22 07:30:47] [INFO ] Invariant cache hit.
[2024-05-22 07:30:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:30:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:30:53] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 270/598 variables, 328/391 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:01] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:31:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:31:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:31:02] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 1/599 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:31:10] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:31:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:31:12] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-22 07:31:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:31:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:31:15] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/599 variables, and 406 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:31:19] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:31:21] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:21] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:31:23] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (OVERLAPS) 270/598 variables, 328/408 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 267/677 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 07:31:41] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 678 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 328/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 20/20 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60808 ms. Remains : 329/329 places, 270/270 transitions.
[2024-05-22 07:31:47] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:31:47] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality637888966135507815.gal : 2 ms
[2024-05-22 07:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15492795039594015619.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/ReachabilityCardinality637888966135507815.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15492795039594015619.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality15492795039594015619.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 44
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :44 after 600
RANDOM walk for 40000 steps (547 resets) in 385 ms. (103 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :600 after 720
BEST_FIRST walk for 40004 steps (87 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :720 after 7784
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7784 after 19000
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :19000 after 72580
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :72580 after 85740
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :364744 after 5.76212e+08
Interrupted probabilistic random walk after 961735 steps, run timeout after 3004 ms. (steps per millisecond=320 ) properties seen :0 out of 2
Probabilistic random walk after 961735 steps, saw 136554 distinct states, run finished after 3004 ms. (steps per millisecond=320 ) properties seen :0
[2024-05-22 07:31:51] [INFO ] Invariant cache hit.
[2024-05-22 07:31:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/477 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/478 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/540 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/599 variables, 59/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :5.76212e+08 after 6.77355e+08
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/477 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/478 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/540 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/599 variables, 59/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2538 steps, including 1 resets, run visited all 2 properties in 21 ms. (steps per millisecond=120 )
Parikh walk visited 2 properties in 32 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-06 in 130040 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:31:53] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:31:53] [INFO ] Invariant cache hit.
[2024-05-22 07:31:53] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:31:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:31:53] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-22 07:31:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:31:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:31:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 07:31:53] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-22 07:31:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:31:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 20 ms returned sat
[2024-05-22 07:31:53] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 3 ms to minimize.
[2024-05-22 07:31:53] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-05-22 07:31:53] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-22 07:31:54] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-22 07:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-05-22 07:31:54] [INFO ] Added : 261 causal constraints over 53 iterations in 1295 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p9) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Applied a total of 7 rules in 19 ms. Remains 344 /351 variables (removed 7) and now considering 285/292 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 344/351 places, 285/292 transitions.
// Phase 1: matrix 285 rows 344 cols
[2024-05-22 07:31:55] [INFO ] Computed 61 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13629 resets) in 1887 ms. (529 steps per ms)
BEST_FIRST walk for 1000001 steps (2264 resets) in 891 ms. (1121 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:31:58] [INFO ] Invariant cache hit.
[2024-05-22 07:31:58] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-22 07:31:58] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 07:31:58] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-22 07:31:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:31:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 07:31:58] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 07:31:58] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-22 07:31:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:31:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-22 07:31:58] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:31:59] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:31:59] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:31:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2024-05-22 07:31:59] [INFO ] Computed and/alt/rep : 276/446/276 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-22 07:32:00] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-22 07:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 07:32:00] [INFO ] Added : 254 causal constraints over 52 iterations in 1249 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 344/344 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 9 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-22 07:32:01] [INFO ] Invariant cache hit.
[2024-05-22 07:32:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 07:32:01] [INFO ] Invariant cache hit.
[2024-05-22 07:32:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:32:01] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-22 07:32:01] [INFO ] Redundant transitions in 3 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-22 07:32:01] [INFO ] Invariant cache hit.
[2024-05-22 07:32:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 2/343 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 7 (OVERLAPS) 285/628 variables, 343/404 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 2/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/629 variables, 1/407 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-22 07:32:20] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-22 07:32:20] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:32:20] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:32:21] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 4/411 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-22 07:32:24] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:32:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:32:27] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 3/414 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-22 07:32:32] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 10 solved, 272 unsolved
Search for dead transitions found 10 dead transitions in 30225ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 344/344 places, 275/285 transitions.
Graph (complete) has 1168 edges and 344 vertex of which 334 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 334 /344 variables (removed 10) and now considering 275/275 (removed 0) transitions.
// Phase 1: matrix 275 rows 334 cols
[2024-05-22 07:32:32] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 07:32:32] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 07:32:32] [INFO ] Invariant cache hit.
[2024-05-22 07:32:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:32:32] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 334/344 places, 275/285 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31461 ms. Remains : 334/344 places, 275/285 transitions.
[2024-05-22 07:32:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13656 resets) in 1889 ms. (529 steps per ms)
BEST_FIRST walk for 1000001 steps (2251 resets) in 884 ms. (1129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 07:32:35] [INFO ] Invariant cache hit.
[2024-05-22 07:32:35] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 07:32:35] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 07:32:35] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-22 07:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:32:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-22 07:32:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 07:32:35] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-22 07:32:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:32:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-22 07:32:35] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 07:32:35] [INFO ] Computed and/alt/rep : 266/428/266 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 07:32:36] [INFO ] Added : 251 causal constraints over 51 iterations in 1073 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 334/334 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2024-05-22 07:32:37] [INFO ] Invariant cache hit.
[2024-05-22 07:32:37] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 07:32:37] [INFO ] Invariant cache hit.
[2024-05-22 07:32:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:32:38] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-22 07:32:38] [INFO ] Redundant transitions in 2 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-22 07:32:38] [INFO ] Invariant cache hit.
[2024-05-22 07:32:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 1/331 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 2/333 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 275/608 variables, 333/394 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/609 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 07:32:55] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:32:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:32:58] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:32:58] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-05-22 07:32:58] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 07:33:00] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:33:00] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:33:00] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:33:01] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 07:33:07] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 407 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 2/333 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 07:33:11] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:33:11] [INFO ] Deduced a trap composed of 60 places in 29 ms of which 0 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:33:13] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 275/608 variables, 333/407 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 272/681 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 681 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 13/14 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60786 ms. Remains : 334/334 places, 275/275 transitions.
[2024-05-22 07:33:38] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:33:38] [INFO ] Flatten gal took : 26 ms
[2024-05-22 07:33:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9230658749110747442.gal : 3 ms
[2024-05-22 07:33:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17183273771627227496.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/ReachabilityCardinality9230658749110747442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17183273771627227496.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
RANDOM walk for 40000 steps (552 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17183273771627227496.prop.
BEST_FIRST walk for 40002 steps (89 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 44
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :44 after 600
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :600 after 720
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :720 after 7760
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7760 after 19234
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :19234 after 72564
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :72564 after 85132
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :364744 after 4.80078e+08
Interrupted probabilistic random walk after 778597 steps, run timeout after 3002 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 778597 steps, saw 111531 distinct states, run finished after 3002 ms. (steps per millisecond=259 ) properties seen :0
[2024-05-22 07:33:41] [INFO ] Invariant cache hit.
[2024-05-22 07:33:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/487 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/488 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/550 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/609 variables, 59/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:33:42] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/487 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/550 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/609 variables, 59/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1100ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.80078e+08 after 6.77352e+08
Parikh walk visited 0 properties in 1864 ms.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 334/334 places, 275/275 transitions.
RANDOM walk for 40000 steps (532 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :6.77352e+08 after 6.78533e+08
Interrupted probabilistic random walk after 937307 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 2
Probabilistic random walk after 937307 steps, saw 133206 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-05-22 07:33:47] [INFO ] Invariant cache hit.
[2024-05-22 07:33:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/487 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/488 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/550 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/609 variables, 59/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:33:48] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/487 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/550 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/609 variables, 59/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 58610 steps, including 185 resets, run visited all 2 properties in 615 ms. (steps per millisecond=95 )
Parikh walk visited 2 properties in 615 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60a-UpperBounds-12 in 116283 ms.
[2024-05-22 07:33:49] [INFO ] Flatten gal took : 16 ms
Total runtime 461958 ms.

BK_STOP 1716363229376

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="DES-PT-60a"
export BK_EXAMINATION="UpperBounds"
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 DES-PT-60a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189900749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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