fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260110000198
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DoubleExponent-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3877.604 3600000.00 10147721.00 6589.60 ?TFTTF?TT?TTF?FT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654186261818

Running Version 202205111006
[2022-06-02 16:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:03] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-06-02 16:11:03] [INFO ] Transformed 534 places.
[2022-06-02 16:11:03] [INFO ] Transformed 498 transitions.
[2022-06-02 16:11:03] [INFO ] Parsed PT model containing 534 places and 498 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 333 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 152772 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152772 steps, saw 76399 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 498 rows 534 cols
[2022-06-02 16:11:07] [INFO ] Computed 54 place invariants in 80 ms
[2022-06-02 16:11:07] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-02 16:11:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-02 16:11:08] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-06-02 16:11:09] [INFO ] After 1266ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :6
[2022-06-02 16:11:09] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 5 ms to minimize.
[2022-06-02 16:11:10] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 1 ms to minimize.
[2022-06-02 16:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2022-06-02 16:11:10] [INFO ] Deduced a trap composed of 215 places in 175 ms of which 1 ms to minimize.
[2022-06-02 16:11:10] [INFO ] Deduced a trap composed of 223 places in 158 ms of which 1 ms to minimize.
[2022-06-02 16:11:10] [INFO ] Deduced a trap composed of 230 places in 143 ms of which 0 ms to minimize.
[2022-06-02 16:11:10] [INFO ] Deduced a trap composed of 214 places in 184 ms of which 1 ms to minimize.
[2022-06-02 16:11:11] [INFO ] Deduced a trap composed of 209 places in 156 ms of which 1 ms to minimize.
[2022-06-02 16:11:11] [INFO ] Deduced a trap composed of 241 places in 155 ms of which 1 ms to minimize.
[2022-06-02 16:11:11] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 1 ms to minimize.
[2022-06-02 16:11:11] [INFO ] Deduced a trap composed of 221 places in 158 ms of which 1 ms to minimize.
[2022-06-02 16:11:11] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
[2022-06-02 16:11:12] [INFO ] Deduced a trap composed of 194 places in 345 ms of which 1 ms to minimize.
[2022-06-02 16:11:12] [INFO ] Deduced a trap composed of 229 places in 185 ms of which 0 ms to minimize.
[2022-06-02 16:11:12] [INFO ] Deduced a trap composed of 227 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:11:12] [INFO ] Deduced a trap composed of 223 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:12] [INFO ] Deduced a trap composed of 221 places in 139 ms of which 1 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 232 places in 138 ms of which 1 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 236 places in 137 ms of which 1 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 211 places in 127 ms of which 0 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 0 ms to minimize.
[2022-06-02 16:11:13] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:11:14] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:11:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 3850 ms
[2022-06-02 16:11:14] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-06-02 16:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:11:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 987 ms
[2022-06-02 16:11:16] [INFO ] Deduced a trap composed of 144 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2022-06-02 16:11:17] [INFO ] After 8729ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :4
Attempting to minimize the solution found.
Minimization took 853 ms.
[2022-06-02 16:11:17] [INFO ] After 10000ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :4
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 39160 ms.
Support contains 8 out of 534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 527 transition count 379
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 239 place count 410 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 409 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 240 place count 409 transition count 358
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 389 transition count 358
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 458 place count 300 transition count 269
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 494 place count 282 transition count 269
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 532 place count 282 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 570 place count 244 transition count 231
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 606 place count 244 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 607 place count 243 transition count 230
Applied a total of 607 rules in 150 ms. Remains 243 /534 variables (removed 291) and now considering 230/498 (removed 268) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/534 places, 230/498 transitions.
Incomplete random walk after 1000000 steps, including 128130 resets, run finished after 11666 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 606129 steps, including 51604 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 699602 steps, including 59251 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 712514 steps, including 60301 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Interrupted Best-First random walk after 589905 steps, including 50089 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 0
Probably explored full state space saw : 178958 states, properties seen :0
Probabilistic random walk after 357919 steps, saw 178958 distinct states, run finished after 4325 ms. (steps per millisecond=82 ) properties seen :0
Interrupted probabilistic random walk after 7181748 steps, run timeout after 93001 ms. (steps per millisecond=77 ) properties seen :{}
Exhaustive walk after 7181748 steps, saw 3591106 distinct states, run finished after 93001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 230 rows 243 cols
[2022-06-02 16:14:06] [INFO ] Computed 50 place invariants in 20 ms
[2022-06-02 16:14:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:14:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:14:06] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-02 16:14:06] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:14:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:14:06] [INFO ] After 281ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 5 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:14:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 850 ms
[2022-06-02 16:14:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-02 16:14:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-02 16:14:08] [INFO ] After 1583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 328 ms.
[2022-06-02 16:14:08] [INFO ] After 2237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 93654 ms.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 230/230 transitions.
Applied a total of 0 rules in 27 ms. Remains 243 /243 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 230/230 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 243 cols
[2022-06-02 16:15:42] [INFO ] Computed 50 place invariants in 35 ms
[2022-06-02 16:15:42] [INFO ] Implicit Places using invariants in 278 ms returned [20, 26, 46, 51, 78, 98, 104, 128, 133, 155, 160, 181, 187, 194, 202, 209, 234, 240]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 280 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 225/243 places, 230/230 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 229
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 224 transition count 223
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 218 transition count 223
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 218 transition count 223
Applied a total of 18 rules in 50 ms. Remains 218 /225 variables (removed 7) and now considering 223/230 (removed 7) transitions.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:15:42] [INFO ] Computed 33 place invariants in 10 ms
[2022-06-02 16:15:42] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:15:42] [INFO ] Computed 33 place invariants in 20 ms
[2022-06-02 16:15:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:15:43] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 218/243 places, 223/230 transitions.
Finished structural reductions, in 2 iterations. Remains : 218/243 places, 223/230 transitions.
Incomplete random walk after 1000000 steps, including 144244 resets, run finished after 9629 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 630934 steps, including 57652 resets, run timeout after 5001 ms. (steps per millisecond=126 ) properties seen 0
Interrupted Best-First random walk after 821395 steps, including 74938 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 532670 steps, including 48731 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
Interrupted Best-First random walk after 516952 steps, including 47467 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted probabilistic random walk after 6732219 steps, run timeout after 87001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 6732219 steps, saw 3365610 distinct states, run finished after 87002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:17:40] [INFO ] Computed 33 place invariants in 14 ms
[2022-06-02 16:17:40] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:17:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2022-06-02 16:17:40] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:17:40] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:17:40] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:17:41] [INFO ] After 265ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:17:41] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 4 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2022-06-02 16:17:42] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 4 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2157 ms
[2022-06-02 16:17:43] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-06-02 16:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-02 16:17:43] [INFO ] After 2732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-06-02 16:17:43] [INFO ] After 3215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14883 ms.
Support contains 8 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:17:58] [INFO ] Computed 33 place invariants in 15 ms
[2022-06-02 16:17:58] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:17:58] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-02 16:17:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:18:00] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2022-06-02 16:18:00] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:18:00] [INFO ] Computed 33 place invariants in 11 ms
[2022-06-02 16:18:00] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Incomplete random walk after 100000 steps, including 14345 resets, run finished after 1491 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:18:01] [INFO ] Computed 33 place invariants in 11 ms
[2022-06-02 16:18:01] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:18:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2022-06-02 16:18:01] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:18:02] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:18:02] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:18:02] [INFO ] After 292ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:18:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:18:03] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2271 ms
[2022-06-02 16:18:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-06-02 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-02 16:18:04] [INFO ] After 2878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-06-02 16:18:05] [INFO ] After 3383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Incomplete random walk after 1000000 steps, including 143992 resets, run finished after 9698 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 795269 steps, including 72900 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
Interrupted Best-First random walk after 877763 steps, including 80330 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 721443 steps, including 66063 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted Best-First random walk after 689144 steps, including 62720 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 0
Interrupted probabilistic random walk after 7364344 steps, run timeout after 87001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 7364344 steps, saw 3681564 distinct states, run finished after 87001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:01] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-02 16:20:01] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:20:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2022-06-02 16:20:01] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:20:02] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:20:02] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:20:02] [INFO ] After 279ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:20:02] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:20:02] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:20:02] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:20:02] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:20:02] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:20:03] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2362 ms
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2022-06-02 16:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-02 16:20:05] [INFO ] After 2922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-06-02 16:20:05] [INFO ] After 3403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15228 ms.
Support contains 8 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:20] [INFO ] Computed 33 place invariants in 12 ms
[2022-06-02 16:20:20] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:20] [INFO ] Computed 33 place invariants in 10 ms
[2022-06-02 16:20:20] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:20:21] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
[2022-06-02 16:20:21] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:21] [INFO ] Computed 33 place invariants in 18 ms
[2022-06-02 16:20:22] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 218/218 places, 223/223 transitions.
Incomplete random walk after 100000 steps, including 14380 resets, run finished after 1782 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:23] [INFO ] Computed 33 place invariants in 10 ms
[2022-06-02 16:20:23] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:20:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2022-06-02 16:20:24] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:20:24] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:20:24] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:20:24] [INFO ] After 283ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:20:24] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:20:24] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:20:24] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:20:24] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:20:24] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:20:25] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2135 ms
[2022-06-02 16:20:26] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2022-06-02 16:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-02 16:20:26] [INFO ] After 2729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 190 ms.
[2022-06-02 16:20:27] [INFO ] After 3225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 811359 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 811359 steps, saw 405760 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:20:30] [INFO ] Computed 33 place invariants in 19 ms
[2022-06-02 16:20:30] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:20:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2022-06-02 16:20:30] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:20:30] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:20:30] [INFO ] After 78ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:30] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-02 16:20:30] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 218 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 222
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 214 transition count 219
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 214 transition count 215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 210 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 210 transition count 215
Applied a total of 18 rules in 27 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/218 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 264448 states, properties seen :0
Probabilistic random walk after 528903 steps, saw 264448 distinct states, run finished after 1955 ms. (steps per millisecond=270 ) properties seen :0
Interrupted probabilistic random walk after 848988 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Exhaustive walk after 848988 steps, saw 424645 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 210 cols
[2022-06-02 16:20:35] [INFO ] Computed 33 place invariants in 17 ms
[2022-06-02 16:20:35] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:20:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 16:20:35] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-06-02 16:20:35] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:20:35] [INFO ] After 103ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:35] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-02 16:20:35] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 80 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 210 cols
[2022-06-02 16:20:36] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-02 16:20:36] [INFO ] Implicit Places using invariants in 146 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 209/210 places, 215/215 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 215
Applied a total of 1 rules in 10 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:36] [INFO ] Computed 32 place invariants in 10 ms
[2022-06-02 16:20:36] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:36] [INFO ] Computed 32 place invariants in 9 ms
[2022-06-02 16:20:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:20:37] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 209/210 places, 215/215 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 215/215 transitions.
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 801653 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :{}
Probabilistic random walk after 801653 steps, saw 400963 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:40] [INFO ] Computed 32 place invariants in 20 ms
[2022-06-02 16:20:40] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:20:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-06-02 16:20:40] [INFO ] [Nat]Absence check using 4 positive and 28 generalized place invariants in 6 ms returned sat
[2022-06-02 16:20:40] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:20:40] [INFO ] After 114ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:40] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-02 16:20:40] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:40] [INFO ] Computed 32 place invariants in 10 ms
[2022-06-02 16:20:41] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:41] [INFO ] Computed 32 place invariants in 10 ms
[2022-06-02 16:20:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:20:42] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2022-06-02 16:20:42] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:20:42] [INFO ] Computed 32 place invariants in 11 ms
[2022-06-02 16:20:42] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 209/209 places, 215/215 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 197
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 20 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2022-06-02 16:20:42] [INFO ] Computed 32 place invariants in 9 ms
[2022-06-02 16:20:42] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:20:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-06-02 16:20:42] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:20:42] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:20:42] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:42] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 1 ms to minimize.
[2022-06-02 16:20:42] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:20:42] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:20:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2022-06-02 16:20:42] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-02 16:20:42] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:20:43] [INFO ] Flatten gal took : 81 ms
[2022-06-02 16:20:43] [INFO ] Flatten gal took : 30 ms
[2022-06-02 16:20:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18072830988216909829.gal : 12 ms
[2022-06-02 16:20:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16240562131095372836.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18072830988216909829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16240562131095372836.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16240562131095372836.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1345
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1345 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 22998
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :22998 after 50278
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50278 after 106680
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106680 after 224019
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224019 after 461062
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461062 after 941324
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :941324 after 1.91109e+06
Detected timeout of ITS tools.
[2022-06-02 16:20:58] [INFO ] Flatten gal took : 22 ms
[2022-06-02 16:20:58] [INFO ] Applying decomposition
[2022-06-02 16:20:58] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16573044768668626236.txt' '-o' '/tmp/graph16573044768668626236.bin' '-w' '/tmp/graph16573044768668626236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16573044768668626236.bin' '-l' '-1' '-v' '-w' '/tmp/graph16573044768668626236.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:20:58] [INFO ] Decomposing Gal with order
[2022-06-02 16:20:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:20:58] [INFO ] Removed a total of 112 redundant transitions.
[2022-06-02 16:20:58] [INFO ] Flatten gal took : 98 ms
[2022-06-02 16:20:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 16 ms.
[2022-06-02 16:20:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11425970469473897262.gal : 7 ms
[2022-06-02 16:20:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15568880159097982568.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11425970469473897262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15568880159097982568.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15568880159097982568.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 367
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :367 after 1899
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1899 after 3781
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3781 after 16757
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16757 after 39628
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39628 after 107013
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :107013 after 295803
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :295803 after 763881
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :763881 after 2.12926e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9985524391646366872
[2022-06-02 16:21:13] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9985524391646366872
Running compilation step : cd /tmp/ltsmin9985524391646366872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin9985524391646366872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9985524391646366872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 790416 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 790416 steps, saw 395292 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:21:31] [INFO ] Computed 33 place invariants in 13 ms
[2022-06-02 16:21:31] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:21:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2022-06-02 16:21:32] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-02 16:21:32] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:32] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:21:32] [INFO ] After 88ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:32] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-02 16:21:32] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 220
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 215 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 211 transition count 216
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 211 transition count 216
Applied a total of 17 rules in 24 ms. Remains 211 /218 variables (removed 7) and now considering 216/223 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/218 places, 216/223 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 792351 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 792351 steps, saw 396255 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 211 cols
[2022-06-02 16:21:35] [INFO ] Computed 33 place invariants in 17 ms
[2022-06-02 16:21:35] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:21:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 16:21:35] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-06-02 16:21:35] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:21:35] [INFO ] After 51ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:35] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-02 16:21:35] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 211 cols
[2022-06-02 16:21:35] [INFO ] Computed 33 place invariants in 10 ms
[2022-06-02 16:21:35] [INFO ] Implicit Places using invariants in 162 ms returned [66, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 209/211 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 209 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 207 transition count 214
Applied a total of 4 rules in 10 ms. Remains 207 /209 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:36] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:21:36] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:36] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:21:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:21:37] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/211 places, 214/216 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/211 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 791996 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 791996 steps, saw 396083 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:40] [INFO ] Computed 31 place invariants in 9 ms
[2022-06-02 16:21:40] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:21:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2022-06-02 16:21:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:21:41] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:21:41] [INFO ] After 103ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:41] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-02 16:21:41] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:41] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:21:41] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:41] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:21:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-02 16:21:42] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
[2022-06-02 16:21:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 214 rows 207 cols
[2022-06-02 16:21:42] [INFO ] Computed 31 place invariants in 16 ms
[2022-06-02 16:21:42] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 184
Applied a total of 60 rules in 17 ms. Remains 177 /207 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 177 cols
[2022-06-02 16:21:43] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:21:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:21:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-06-02 16:21:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:21:43] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:21:43] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2022-06-02 16:21:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-06-02 16:21:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2022-06-02 16:21:43] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-02 16:21:43] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:21:43] [INFO ] Flatten gal took : 20 ms
[2022-06-02 16:21:43] [INFO ] Flatten gal took : 19 ms
[2022-06-02 16:21:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2642659028711997634.gal : 3 ms
[2022-06-02 16:21:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3640804929477757550.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2642659028711997634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3640804929477757550.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3640804929477757550.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 91
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :91 after 192
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :192 after 696
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :696 after 2011
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2011 after 7233
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7233 after 17712
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :17712 after 39409
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :39409 after 92006
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :92006 after 199151
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :199151 after 434061
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :434061 after 919976
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :919976 after 1.92126e+06
Detected timeout of ITS tools.
[2022-06-02 16:21:58] [INFO ] Flatten gal took : 18 ms
[2022-06-02 16:21:58] [INFO ] Applying decomposition
[2022-06-02 16:21:58] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7901309979441495787.txt' '-o' '/tmp/graph7901309979441495787.bin' '-w' '/tmp/graph7901309979441495787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7901309979441495787.bin' '-l' '-1' '-v' '-w' '/tmp/graph7901309979441495787.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:21:58] [INFO ] Decomposing Gal with order
[2022-06-02 16:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:21:58] [INFO ] Removed a total of 107 redundant transitions.
[2022-06-02 16:21:58] [INFO ] Flatten gal took : 60 ms
[2022-06-02 16:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 7 ms.
[2022-06-02 16:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10919849715950267852.gal : 23 ms
[2022-06-02 16:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1638066460709939381.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10919849715950267852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1638066460709939381.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1638066460709939381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 104
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :104 after 192
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :192 after 851
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :851 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 8691
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8691 after 22127
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :22127 after 56157
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :56157 after 129020
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :129020 after 301596
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :301596 after 651146
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :651146 after 1.38356e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3927172865322514074
[2022-06-02 16:22:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3927172865322514074
Running compilation step : cd /tmp/ltsmin3927172865322514074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 349 ms.
Running link step : cd /tmp/ltsmin3927172865322514074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3927172865322514074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 816218 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 816218 steps, saw 408192 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:22:31] [INFO ] Computed 33 place invariants in 15 ms
[2022-06-02 16:22:31] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:22:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 24 ms returned sat
[2022-06-02 16:22:31] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:22:32] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:32] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:22:32] [INFO ] After 68ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:22:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 464 ms
[2022-06-02 16:22:32] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-02 16:22:32] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 218 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 222
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 213 transition count 218
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 213 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 210 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 210 transition count 215
Applied a total of 19 rules in 16 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/218 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 279628 states, properties seen :0
Probabilistic random walk after 559260 steps, saw 279628 distinct states, run finished after 2052 ms. (steps per millisecond=272 ) properties seen :0
Interrupted probabilistic random walk after 855438 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Exhaustive walk after 855438 steps, saw 427864 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 210 cols
[2022-06-02 16:22:37] [INFO ] Computed 33 place invariants in 16 ms
[2022-06-02 16:22:37] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:22:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-02 16:22:37] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-06-02 16:22:38] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-02 16:22:38] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:38] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:22:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:22:38] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:22:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2022-06-02 16:22:38] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-06-02 16:22:38] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 210 cols
[2022-06-02 16:22:38] [INFO ] Computed 33 place invariants in 13 ms
[2022-06-02 16:22:38] [INFO ] Implicit Places using invariants in 153 ms returned [66, 120]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 154 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 208/210 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 213
Applied a total of 4 rules in 7 ms. Remains 206 /208 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:38] [INFO ] Computed 31 place invariants in 12 ms
[2022-06-02 16:22:38] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:38] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:22:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-02 16:22:40] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 206/210 places, 213/215 transitions.
Finished structural reductions, in 2 iterations. Remains : 206/210 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 797075 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 797075 steps, saw 398661 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:43] [INFO ] Computed 31 place invariants in 18 ms
[2022-06-02 16:22:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:22:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2022-06-02 16:22:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-02 16:22:43] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-02 16:22:43] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:43] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:22:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2022-06-02 16:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2022-06-02 16:22:43] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-02 16:22:43] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:43] [INFO ] Computed 31 place invariants in 13 ms
[2022-06-02 16:22:44] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:44] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-02 16:22:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-02 16:22:45] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
[2022-06-02 16:22:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-06-02 16:22:45] [INFO ] Computed 31 place invariants in 9 ms
[2022-06-02 16:22:45] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 196
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 196
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 179 transition count 186
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 179 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 183
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 176 cols
[2022-06-02 16:22:45] [INFO ] Computed 31 place invariants in 11 ms
[2022-06-02 16:22:45] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:22:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-06-02 16:22:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:22:45] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:22:45] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:45] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2022-06-02 16:22:45] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:22:45] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2022-06-02 16:22:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2022-06-02 16:22:45] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-02 16:22:45] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:22:45] [INFO ] Flatten gal took : 12 ms
[2022-06-02 16:22:45] [INFO ] Flatten gal took : 13 ms
[2022-06-02 16:22:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8861427751151125798.gal : 1 ms
[2022-06-02 16:22:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12751747413999121731.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8861427751151125798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12751747413999121731.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12751747413999121731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 63
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :63 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 271
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :271 after 850
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :850 after 4646
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4646 after 13923
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :13923 after 32170
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :32170 after 80827
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :80827 after 180587
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :180587 after 405565
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :405565 after 853372
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :853372 after 1.81404e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.81404e+06 after 3.7618e+06
Detected timeout of ITS tools.
[2022-06-02 16:23:01] [INFO ] Flatten gal took : 18 ms
[2022-06-02 16:23:01] [INFO ] Applying decomposition
[2022-06-02 16:23:01] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14319142702799595841.txt' '-o' '/tmp/graph14319142702799595841.bin' '-w' '/tmp/graph14319142702799595841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14319142702799595841.bin' '-l' '-1' '-v' '-w' '/tmp/graph14319142702799595841.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:23:01] [INFO ] Decomposing Gal with order
[2022-06-02 16:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:23:01] [INFO ] Removed a total of 106 redundant transitions.
[2022-06-02 16:23:01] [INFO ] Flatten gal took : 24 ms
[2022-06-02 16:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2022-06-02 16:23:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13794903071298348805.gal : 3 ms
[2022-06-02 16:23:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6032648617167047410.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13794903071298348805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6032648617167047410.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6032648617167047410.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 76
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :76 after 198
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198 after 360
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :360 after 2579
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2579 after 5092
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5092 after 22248
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :22248 after 64549
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :64549 after 179371
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :179371 after 431793
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :431793 after 1.07506e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.07506e+06 after 2.49294e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.49294e+06 after 5.70326e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11439349647270986523
[2022-06-02 16:23:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11439349647270986523
Running compilation step : cd /tmp/ltsmin11439349647270986523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin11439349647270986523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11439349647270986523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 795347 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 795347 steps, saw 397758 distinct states, run finished after 3003 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:23:34] [INFO ] Computed 33 place invariants in 16 ms
[2022-06-02 16:23:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:23:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2022-06-02 16:23:34] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:23:34] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:34] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-02 16:23:34] [INFO ] After 158ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:34] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-02 16:23:34] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 218/218 places, 223/223 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 218 transition count 222
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 215 transition count 220
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 215 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 211 transition count 216
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 211 transition count 216
Applied a total of 18 rules in 34 ms. Remains 211 /218 variables (removed 7) and now considering 216/223 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/218 places, 216/223 transitions.
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 808356 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 808356 steps, saw 404317 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 211 cols
[2022-06-02 16:23:37] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-02 16:23:38] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:23:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2022-06-02 16:23:38] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:23:38] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-02 16:23:38] [INFO ] After 63ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:38] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-02 16:23:38] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 211 cols
[2022-06-02 16:23:38] [INFO ] Computed 33 place invariants in 14 ms
[2022-06-02 16:23:38] [INFO ] Implicit Places using invariants in 167 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 210/211 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 8 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:38] [INFO ] Computed 32 place invariants in 10 ms
[2022-06-02 16:23:38] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:38] [INFO ] Computed 32 place invariants in 9 ms
[2022-06-02 16:23:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-02 16:23:40] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 209/211 places, 215/216 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 215/216 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 807546 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 807546 steps, saw 403917 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:43] [INFO ] Computed 32 place invariants in 16 ms
[2022-06-02 16:23:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:23:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-06-02 16:23:43] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2022-06-02 16:23:43] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-02 16:23:43] [INFO ] After 151ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:43] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-02 16:23:44] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:44] [INFO ] Computed 32 place invariants in 15 ms
[2022-06-02 16:23:44] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:44] [INFO ] Computed 32 place invariants in 9 ms
[2022-06-02 16:23:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-02 16:23:45] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2022-06-02 16:23:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 209 cols
[2022-06-02 16:23:45] [INFO ] Computed 32 place invariants in 11 ms
[2022-06-02 16:23:45] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 209/209 places, 215/215 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 197
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2022-06-02 16:23:45] [INFO ] Computed 32 place invariants in 9 ms
[2022-06-02 16:23:45] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:23:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-06-02 16:23:45] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-02 16:23:46] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:23:46] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:46] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2022-06-02 16:23:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2022-06-02 16:23:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-06-02 16:23:46] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-02 16:23:46] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:23:46] [INFO ] Flatten gal took : 12 ms
[2022-06-02 16:23:46] [INFO ] Flatten gal took : 11 ms
[2022-06-02 16:23:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16709014715657466068.gal : 1 ms
[2022-06-02 16:23:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7707125146603249595.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16709014715657466068.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7707125146603249595.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7707125146603249595.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 170
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :170 after 307
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :307 after 1317
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1317 after 3552
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3552 after 13484
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :13484 after 31868
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :31868 after 72485
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :72485 after 166854
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :166854 after 360679
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :360679 after 761429
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :761429 after 1.59482e+06
Detected timeout of ITS tools.
[2022-06-02 16:24:01] [INFO ] Flatten gal took : 11 ms
[2022-06-02 16:24:01] [INFO ] Applying decomposition
[2022-06-02 16:24:01] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14061032556400898275.txt' '-o' '/tmp/graph14061032556400898275.bin' '-w' '/tmp/graph14061032556400898275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14061032556400898275.bin' '-l' '-1' '-v' '-w' '/tmp/graph14061032556400898275.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:24:01] [INFO ] Decomposing Gal with order
[2022-06-02 16:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:24:01] [INFO ] Removed a total of 117 redundant transitions.
[2022-06-02 16:24:01] [INFO ] Flatten gal took : 28 ms
[2022-06-02 16:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 5 ms.
[2022-06-02 16:24:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16949249941423950461.gal : 2 ms
[2022-06-02 16:24:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10313654425307416938.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4638144960163577047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16949249941423950461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10313654425307416938.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10313654425307416938.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 340
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :340 after 1250
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1250 after 3638
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3638 after 14372
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14372 after 35595
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35595 after 93791
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93791 after 246605
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246605 after 633181
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :633181 after 1.7506e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13853002797903178134
[2022-06-02 16:24:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13853002797903178134
Running compilation step : cd /tmp/ltsmin13853002797903178134;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin13853002797903178134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13853002797903178134;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 218 transition count 206
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 201 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 195 transition count 200
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 195 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 194 transition count 199
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 194 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 192 transition count 197
Applied a total of 52 rules in 19 ms. Remains 192 /218 variables (removed 26) and now considering 197/223 (removed 26) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 197 rows 192 cols
[2022-06-02 16:24:31] [INFO ] Computed 33 place invariants in 9 ms
[2022-06-02 16:24:31] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:24:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 16:24:31] [INFO ] [Nat]Absence check using 5 positive and 28 generalized place invariants in 6 ms returned sat
[2022-06-02 16:24:31] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:24:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:24:31] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-02 16:24:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-06-02 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-02 16:24:32] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 153 ms.
[2022-06-02 16:24:32] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:24:32] [INFO ] Flatten gal took : 10 ms
[2022-06-02 16:24:32] [INFO ] Flatten gal took : 9 ms
[2022-06-02 16:24:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5064766232580528753.gal : 1 ms
[2022-06-02 16:24:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16119245151131729528.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5064766232580528753.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16119245151131729528.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16119245151131729528.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 29
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :29 after 45
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :45 after 65
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :65 after 106
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :106 after 225
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :225 after 512
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :512 after 2669
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2669 after 11279
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :11279 after 28335
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :28335 after 88002
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :88002 after 254438
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :254438 after 637103
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :637103 after 1.57234e+06
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.57234e+06 after 3.67708e+06
Detected timeout of ITS tools.
[2022-06-02 16:24:47] [INFO ] Flatten gal took : 9 ms
[2022-06-02 16:24:47] [INFO ] Applying decomposition
[2022-06-02 16:24:47] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15236249125039071952.txt' '-o' '/tmp/graph15236249125039071952.bin' '-w' '/tmp/graph15236249125039071952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15236249125039071952.bin' '-l' '-1' '-v' '-w' '/tmp/graph15236249125039071952.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:24:47] [INFO ] Decomposing Gal with order
[2022-06-02 16:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:24:47] [INFO ] Removed a total of 131 redundant transitions.
[2022-06-02 16:24:47] [INFO ] Flatten gal took : 19 ms
[2022-06-02 16:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 8 ms.
[2022-06-02 16:24:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2969361366487021715.gal : 3 ms
[2022-06-02 16:24:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3644548194588180461.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2969361366487021715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3644548194588180461.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3644548194588180461.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :21 after 45
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :45 after 65
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :65 after 105
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :105 after 225
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :225 after 595
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :595 after 2923
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2923 after 12790
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :12790 after 47651
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :47651 after 160174
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :160174 after 442715
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :442715 after 1.1045e+06
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :1.1045e+06 after 2.74072e+06
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :2.74072e+06 after 6.56337e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15409994488426128502
[2022-06-02 16:25:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15409994488426128502
Running compilation step : cd /tmp/ltsmin15409994488426128502;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin15409994488426128502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15409994488426128502;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:25:17] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6828096460758795694
[2022-06-02 16:25:18] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2022-06-02 16:25:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:25:18] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2022-06-02 16:25:18] [INFO ] Applying decomposition
[2022-06-02 16:25:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:25:18] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2022-06-02 16:25:18] [INFO ] Flatten gal took : 13 ms
[2022-06-02 16:25:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:25:18] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6828096460758795694
Running compilation step : cd /tmp/ltsmin6828096460758795694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 16:25:18] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6479217053314813796.txt' '-o' '/tmp/graph6479217053314813796.bin' '-w' '/tmp/graph6479217053314813796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6479217053314813796.bin' '-l' '-1' '-v' '-w' '/tmp/graph6479217053314813796.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:25:18] [INFO ] Decomposing Gal with order
[2022-06-02 16:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:25:18] [INFO ] Input system was already deterministic with 223 transitions.
[2022-06-02 16:25:18] [INFO ] Removed a total of 124 redundant transitions.
[2022-06-02 16:25:18] [INFO ] Flatten gal took : 22 ms
[2022-06-02 16:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 8 ms.
[2022-06-02 16:25:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10895363877114572598.gal : 9 ms
[2022-06-02 16:25:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5879184040597863755.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10895363877114572598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5879184040597863755.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
[2022-06-02 16:25:18] [INFO ] Ran tautology test, simplified 0 / 4 in 223 ms.
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=0 took 8 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=0 took 9 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=2 took 21 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=2 took 1 ms
Loading property file /tmp/ReachabilityCardinality5879184040597863755.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=3 took 43 ms
SDD size :14 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 40
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 223 rows 218 cols
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=3 took 25 ms
SDD proceeding with computation,4 properties remain. new max is 256
[2022-06-02 16:25:18] [INFO ] Computed 33 place invariants in 9 ms
SDD size :40 after 148
[2022-06-02 16:25:18] [INFO ] Computed 33 place invariants in 10 ms
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :148 after 290
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=3 took 31 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :290 after 813
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=3 took 26 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :813 after 2104
Compilation finished in 478 ms.
Running link step : cd /tmp/ltsmin6828096460758795694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6828096460758795694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality00==true'
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2104 after 17562
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=4 took 270 ms
[2022-06-02 16:25:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=4 took 83 ms
[2022-06-02 16:25:18] [INFO ] Proved 218 variables to be positive in 473 ms
[2022-06-02 16:25:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:25:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=0 took 87 ms
[2022-06-02 16:25:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:25:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=0 took 31 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=0 took 39 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=0 took 31 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :17562 after 64214
[2022-06-02 16:25:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=4 took 407 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=1 took 325 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=1 took 131 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=1 took 172 ms
[2022-06-02 16:25:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=4 took 531 ms
[2022-06-02 16:25:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:25:19] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=1 took 139 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :64214 after 216880
[2022-06-02 16:25:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=5 took 1381 ms
[2022-06-02 16:25:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=5 took 899 ms
[2022-06-02 16:25:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=5 took 560 ms
[2022-06-02 16:25:23] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=5 took 488 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :216880 after 519708
[2022-06-02 16:25:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=6 took 1951 ms
[2022-06-02 16:25:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=6 took 1899 ms
[2022-06-02 16:25:31] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=6 took 4238 ms
[2022-06-02 16:25:32] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=6 took 1776 ms
[2022-06-02 16:25:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:25:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=2 took 13570 ms
[2022-06-02 16:25:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:25:35] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=2 took 1593 ms
[2022-06-02 16:25:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:25:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=2 took 5500 ms
[2022-06-02 16:25:42] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=7 took 9039 ms
[2022-06-02 16:25:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:25:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=2 took 4665 ms
[2022-06-02 16:25:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=7 took 14451 ms
[2022-06-02 16:26:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=7 took 9290 ms
[2022-06-02 16:26:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=7 took 6552 ms
[2022-06-02 16:26:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:26:21] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=3 took 36677 ms
[2022-06-02 16:26:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=8 took 16794 ms
[2022-06-02 16:26:37] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=8 took 8570 ms
[2022-06-02 16:26:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:26:46] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=3 took 24255 ms
[2022-06-02 16:27:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=8 took 33101 ms
[2022-06-02 16:27:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=8 took 45647 ms
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :519708 after 4.62755e+07
[2022-06-02 16:28:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=9 took 12244 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 227, guards 223
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.221: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 0.236: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.234: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.230: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.230: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.236: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.234: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.236: There are 227 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.236: State length is 218, there are 223 groups
pins2lts-mc-linux64( 0/ 8), 0.236: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.236: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.236: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.236: Visible groups: 0 / 223, labels: 1 / 227
pins2lts-mc-linux64( 0/ 8), 0.236: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.236: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.230: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.230: "DoubleExponentPT010ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.274: ~48 levels ~960 states ~1016 transitions
pins2lts-mc-linux64( 1/ 8), 0.337: ~69 levels ~1920 states ~1960 transitions
pins2lts-mc-linux64( 1/ 8), 0.434: ~121 levels ~3840 states ~3928 transitions
pins2lts-mc-linux64( 2/ 8), 0.581: ~41 levels ~7680 states ~8400 transitions
pins2lts-mc-linux64( 2/ 8), 0.668: ~92 levels ~15360 states ~15920 transitions
pins2lts-mc-linux64( 2/ 8), 0.863: ~336 levels ~30720 states ~30856 transitions
pins2lts-mc-linux64( 1/ 8), 1.481: ~970 levels ~61440 states ~62056 transitions
pins2lts-mc-linux64( 7/ 8), 2.227: ~1197 levels ~122880 states ~124200 transitions
pins2lts-mc-linux64( 1/ 8), 3.506: ~3115 levels ~245760 states ~247856 transitions
pins2lts-mc-linux64( 4/ 8), 5.625: ~5927 levels ~491520 states ~490408 transitions
pins2lts-mc-linux64( 4/ 8), 9.079: ~9730 levels ~983040 states ~983256 transitions
pins2lts-mc-linux64( 4/ 8), 13.267: ~10074 levels ~1966080 states ~2011768 transitions
pins2lts-mc-linux64( 5/ 8), 22.030: ~10505 levels ~3932160 states ~3913712 transitions
pins2lts-mc-linux64( 3/ 8), 39.203: ~11607 levels ~7864320 states ~7948408 transitions
pins2lts-mc-linux64( 0/ 8), 73.078: ~16207 levels ~15728640 states ~15694016 transitions
pins2lts-mc-linux64( 0/ 8), 139.790: ~30595 levels ~31457280 states ~31275688 transitions
pins2lts-mc-linux64( 2/ 8), 170.459: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 170.541:
pins2lts-mc-linux64( 0/ 8), 170.541: mean standard work distribution: 1.0% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 170.541:
pins2lts-mc-linux64( 0/ 8), 170.541: Explored 37514695 states 37619090 transitions, fanout: 1.003
pins2lts-mc-linux64( 0/ 8), 170.541: Total exploration time 170.310 sec (170.230 sec minimum, 170.261 sec on average)
pins2lts-mc-linux64( 0/ 8), 170.541: States per second: 220273, Transitions per second: 220886
pins2lts-mc-linux64( 0/ 8), 170.541: Ignoring proviso: 2
pins2lts-mc-linux64( 0/ 8), 170.541:
pins2lts-mc-linux64( 0/ 8), 170.541: Queue width: 8B, total height: 177244, memory: 1.35MB
pins2lts-mc-linux64( 0/ 8), 170.541: Tree memory: 543.0MB, 15.1 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 170.541: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 170.541: Stored 223 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 170.541: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 170.541: Est. total memory use: 544.4MB (~1025.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6828096460758795694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality00==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6828096460758795694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT010ReachabilityCardinality00==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:28:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=9 took 13948 ms
[2022-06-02 16:28:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=9 took 21608 ms
[2022-06-02 16:28:53] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=9 took 9102 ms
[2022-06-02 16:29:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=10 took 13606 ms
[2022-06-02 16:29:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=10 took 7117 ms
[2022-06-02 16:29:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:29:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=3 took 150245 ms
[2022-06-02 16:29:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=10 took 7632 ms
[2022-06-02 16:29:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:29:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=3 took 11118 ms
[2022-06-02 16:29:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:29:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=4 took 18033 ms
[2022-06-02 16:30:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=10 took 38975 ms
[2022-06-02 16:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:30:06] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=4 took 20810 ms
[2022-06-02 16:30:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=11 took 6371 ms
[2022-06-02 16:30:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:30:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=4 took 21634 ms
[2022-06-02 16:30:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=11 took 28380 ms
[2022-06-02 16:30:53] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=11 took 18429 ms
[2022-06-02 16:30:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=11 took 3454 ms
[2022-06-02 16:31:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=12 took 30729 ms
[2022-06-02 16:31:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:31:55] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=4 took 87086 ms
[2022-06-02 16:31:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=12 took 28334 ms
[2022-06-02 16:32:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:32:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=5 took 32444 ms
[2022-06-02 16:33:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=12 took 72805 ms
[2022-06-02 16:33:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=12 took 13228 ms
[2022-06-02 16:33:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:33:31] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=5 took 63869 ms
[2022-06-02 16:33:54] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=13 took 32265 ms
[2022-06-02 16:34:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:34:04] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=5 took 33238 ms
[2022-06-02 16:34:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=13 took 41640 ms
[2022-06-02 16:34:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:34:48] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=5 took 43789 ms
[2022-06-02 16:35:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=13 took 65049 ms
[2022-06-02 16:36:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:36:01] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=6 took 73477 ms
[2022-06-02 16:36:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=13 took 47708 ms
[2022-06-02 16:37:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:37:08] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=6 took 66131 ms
[2022-06-02 16:37:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:37:46] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=6 took 38737 ms
[2022-06-02 16:38:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:38:55] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=6 took 69153 ms
[2022-06-02 16:43:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:43:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=7 took 284982 ms
[2022-06-02 16:44:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=14 took 489768 ms
[2022-06-02 16:45:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 16:45:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=7 took 112260 ms
[2022-06-02 16:46:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 16:46:31] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=7 took 58036 ms
[2022-06-02 16:48:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 16:48:47] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=7 took 135797 ms
Detected timeout of ITS tools.
[2022-06-02 16:50:02] [INFO ] Applying decomposition
[2022-06-02 16:50:02] [INFO ] Flatten gal took : 29 ms
[2022-06-02 16:50:02] [INFO ] Decomposing Gal with order
[2022-06-02 16:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p130 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p142 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p146 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p183 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p195 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p199 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p236 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p248 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p289 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p301 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p305 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p342 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p354 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p395 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p407 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p411 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p42 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p448 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p46 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p460 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p464 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p485 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p499 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p52 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p77 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [INFO ] Could not find partition element corresponding to p89 in partition [p108, p111, p187, p205],[p10, p11],[p110, p113],[p109, p112, p131, p207, p210],[p116, p122, p128],[p12, p13, p31, p34],[p106, p124, p140, p143, p154, p157, p159, p177, p193, p196, p212, p243, p249, p265, p43, p54, p71, p87, p90],[p14, p16, p22, p24],[p162, p165, p184, p260, p263],[p163, p166],[p161, p164, p252, p256, p258],[p169, p175, p181],[p57, p60, p78, p80, p97],[p134, p152, p55, p58],[p56, p59],[p63, p69, p75],[p101, p104, p40, p8, p9, p93, p99],[p214, p217],[p215, p218, p237, p240, p311, p313, p316],[p216, p219],[p222, p228, p230, p234],[p246, p309],[p268, p269, p271, p272, p290, p293, p302, p364, p366, p369],[p267, p270],[p275, p281, p283, p287],[p322, p325, p343, p345, p358, p362],[p320, p323, p399, p417],[p321, p324],[p328, p334, p340],[p374, p377, p396, p472, p475],[p375, p378],[p373, p376, p452, p470],[p381, p387, p393],[p419],[p428, p431],[p426, p429, p481, p523],[p427, p430, p449, p525, p528],[p434, p440, p446],[p299, p319, p336, p352, p355, p361, p371, p389, p405, p408, p422, p424, p442, p458, p461, p477, p479, p482, p530],[p480, p483, p487, p502],[p504, p505],[p516, p517],[p28, p30, p318],[p242, p346],[p360, p484],[p314, p81],

[2022-06-02 16:50:02] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 52
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-02 16:50:02] [INFO ] Flatten gal took : 12 ms
[2022-06-02 16:50:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10426598045633142425.gal : 19 ms
[2022-06-02 16:50:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17952073921700260646.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10426598045633142425.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17952073921700260646.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17952073921700260646.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 139
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :139 after 284
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :284 after 834
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :834 after 2181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2181 after 12136
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12136 after 35780
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :35780 after 101851
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :101851 after 238204
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :238204 after 525536
[2022-06-02 16:53:50] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=14 took 552113 ms
[2022-06-02 16:54:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=14 took 35664 ms
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :525536 after 1.93962e+08
[2022-06-02 16:58:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=14 took 230034 ms
[2022-06-02 16:59:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 16:59:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=8 took 631612 ms
[2022-06-02 17:01:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2022-06-02 17:01:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=8 took 157644 ms
[2022-06-02 17:04:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-09
[2022-06-02 17:04:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(SAT) depth K=8 took 126053 ms
[2022-06-02 17:04:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=15 took 381975 ms
[2022-06-02 17:05:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=15 took 27139 ms
[2022-06-02 17:05:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-09(UNSAT) depth K=15 took 16973 ms
[2022-06-02 17:05:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-13
[2022-06-02 17:05:42] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(SAT) depth K=8 took 99915 ms
[2022-06-02 17:05:53] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-13(UNSAT) depth K=15 took 30540 ms
[2022-06-02 17:07:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(UNSAT) depth K=16 took 111068 ms
[2022-06-02 17:10:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-00
[2022-06-02 17:10:54] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-00(SAT) depth K=9 took 312383 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DoubleExponent-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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