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.r168-tall-165277016200073.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 Peterson-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 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 Peterson-PT-5-CTLCardinality-00
FORMULA_NAME Peterson-PT-5-CTLCardinality-01
FORMULA_NAME Peterson-PT-5-CTLCardinality-02
FORMULA_NAME Peterson-PT-5-CTLCardinality-03
FORMULA_NAME Peterson-PT-5-CTLCardinality-04
FORMULA_NAME Peterson-PT-5-CTLCardinality-05
FORMULA_NAME Peterson-PT-5-CTLCardinality-06
FORMULA_NAME Peterson-PT-5-CTLCardinality-07
FORMULA_NAME Peterson-PT-5-CTLCardinality-08
FORMULA_NAME Peterson-PT-5-CTLCardinality-09
FORMULA_NAME Peterson-PT-5-CTLCardinality-10
FORMULA_NAME Peterson-PT-5-CTLCardinality-11
FORMULA_NAME Peterson-PT-5-CTLCardinality-12
FORMULA_NAME Peterson-PT-5-CTLCardinality-13
FORMULA_NAME Peterson-PT-5-CTLCardinality-14
FORMULA_NAME Peterson-PT-5-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652782381718

Running Version 202205111006
[2022-05-17 10:13:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-05-17 10:13:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:13:03] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2022-05-17 10:13:03] [INFO ] Transformed 834 places.
[2022-05-17 10:13:03] [INFO ] Transformed 1242 transitions.
[2022-05-17 10:13:03] [INFO ] Found NUPN structural information;
[2022-05-17 10:13:03] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 10:13:03] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 300 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 51 ms.
FORMULA Peterson-PT-5-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 793 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 26 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:13:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:13:03] [INFO ] Computed 23 place invariants in 26 ms
[2022-05-17 10:13:03] [INFO ] Implicit Places using invariants in 399 ms returned []
[2022-05-17 10:13:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:13:03] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:13:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:13:04] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2022-05-17 10:13:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:13:04] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 10:13:05] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Support contains 793 out of 834 places after structural reductions.
[2022-05-17 10:13:05] [INFO ] Flatten gal took : 152 ms
[2022-05-17 10:13:06] [INFO ] Flatten gal took : 69 ms
[2022-05-17 10:13:06] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 77) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2022-05-17 10:13:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:13:07] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:13:09] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :20 sat :0 real:29
[2022-05-17 10:13:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-05-17 10:13:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 10:13:10] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :35 sat :14
[2022-05-17 10:13:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:13:11] [INFO ] After 695ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :35 sat :14
[2022-05-17 10:13:11] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 4 ms to minimize.
[2022-05-17 10:13:12] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2022-05-17 10:13:12] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 1 ms to minimize.
[2022-05-17 10:13:12] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 1 ms to minimize.
[2022-05-17 10:13:13] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 2 ms to minimize.
[2022-05-17 10:13:13] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 0 ms to minimize.
[2022-05-17 10:13:13] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 1 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 1 ms to minimize.
[2022-05-17 10:13:17] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 1 ms to minimize.
[2022-05-17 10:13:17] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 0 ms to minimize.
[2022-05-17 10:13:17] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 0 ms to minimize.
[2022-05-17 10:13:18] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 7 ms to minimize.
[2022-05-17 10:13:18] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 0 ms to minimize.
[2022-05-17 10:13:18] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 27 trap constraints in 8078 ms
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 1 ms to minimize.
[2022-05-17 10:13:20] [INFO ] Deduced a trap composed of 97 places in 216 ms of which 1 ms to minimize.
[2022-05-17 10:13:20] [INFO ] Deduced a trap composed of 97 places in 211 ms of which 1 ms to minimize.
[2022-05-17 10:13:20] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 1 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 93 places in 217 ms of which 1 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 97 places in 219 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 1 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 92 places in 223 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 129 places in 194 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 1 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 1 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 1 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 1 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 1 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 114 places in 182 ms of which 1 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 1 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 1 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 127 places in 198 ms of which 1 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 1 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6884 ms
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 0 ms to minimize.
[2022-05-17 10:13:27] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 1 ms to minimize.
[2022-05-17 10:13:27] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 3 ms to minimize.
[2022-05-17 10:13:27] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 0 ms to minimize.
[2022-05-17 10:13:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1054 ms
[2022-05-17 10:13:27] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 1 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 1 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 1 ms to minimize.
[2022-05-17 10:13:29] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 0 ms to minimize.
[2022-05-17 10:13:29] [INFO ] Deduced a trap composed of 169 places in 263 ms of which 1 ms to minimize.
[2022-05-17 10:13:29] [INFO ] Deduced a trap composed of 128 places in 223 ms of which 0 ms to minimize.
[2022-05-17 10:13:30] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 4 ms to minimize.
[2022-05-17 10:13:30] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
[2022-05-17 10:13:30] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 6 ms to minimize.
[2022-05-17 10:13:30] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 2 ms to minimize.
[2022-05-17 10:13:31] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 1 ms to minimize.
[2022-05-17 10:13:31] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 0 ms to minimize.
[2022-05-17 10:13:31] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 1 ms to minimize.
[2022-05-17 10:13:32] [INFO ] Deduced a trap composed of 115 places in 206 ms of which 1 ms to minimize.
[2022-05-17 10:13:32] [INFO ] Deduced a trap composed of 115 places in 205 ms of which 0 ms to minimize.
[2022-05-17 10:13:32] [INFO ] Deduced a trap composed of 115 places in 205 ms of which 1 ms to minimize.
[2022-05-17 10:13:32] [INFO ] Deduced a trap composed of 101 places in 192 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 1 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 89 places in 196 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 10:13:34] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0 real:29
Fused 49 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 21 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 834 transition count 913
Reduce places removed 329 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 336 rules applied. Total rules applied 665 place count 505 transition count 906
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 672 place count 498 transition count 906
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 672 place count 498 transition count 730
Deduced a syphon composed of 176 places in 1 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 1024 place count 322 transition count 730
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1078 place count 295 transition count 703
Applied a total of 1078 rules in 112 ms. Remains 295 /834 variables (removed 539) and now considering 703/1242 (removed 539) transitions.
Finished structural reductions, in 1 iterations. Remains : 295/834 places, 703/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-05-17 10:13:35] [INFO ] Flow matrix only has 583 transitions (discarded 120 similar events)
// Phase 1: matrix 583 rows 295 cols
[2022-05-17 10:13:35] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:13:35] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:13:35] [INFO ] After 299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2022-05-17 10:13:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:13:36] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 10:13:36] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 10:13:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:13:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:13:36] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-17 10:13:36] [INFO ] After 237ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-17 10:13:36] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:13:37] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2328 ms
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2199 ms
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:13:41] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2022-05-17 10:13:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 942 ms
[2022-05-17 10:13:42] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:13:43] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:13:43] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2022-05-17 10:13:43] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:13:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2022-05-17 10:13:43] [INFO ] After 6759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 327 ms.
[2022-05-17 10:13:43] [INFO ] After 7580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 82 ms.
Support contains 15 out of 295 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 295/295 places, 703/703 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 295 transition count 700
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 292 transition count 700
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 292 transition count 694
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 286 transition count 694
Applied a total of 18 rules in 40 ms. Remains 286 /295 variables (removed 9) and now considering 694/703 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 286/295 places, 694/703 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 522074 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 522074 steps, saw 76979 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 10 properties.
[2022-05-17 10:13:47] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 286 cols
[2022-05-17 10:13:47] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:13:47] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:13:48] [INFO ] After 279ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:6
[2022-05-17 10:13:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:13:48] [INFO ] After 105ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 10:13:48] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 10:13:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:13:48] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-17 10:13:48] [INFO ] After 200ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-17 10:13:48] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:13:49] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:13:50] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:13:51] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:13:52] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4123 ms
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:13:53] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1488 ms
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:13:54] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 578 ms
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:13:55] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1479 ms
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-05-17 10:13:56] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:13:57] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:13:58] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:13:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 571 ms
[2022-05-17 10:13:58] [INFO ] After 9514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 296 ms.
[2022-05-17 10:13:58] [INFO ] After 10203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 13 ms.
Support contains 15 out of 286 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 286/286 places, 694/694 transitions.
Applied a total of 0 rules in 17 ms. Remains 286 /286 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 286/286 places, 694/694 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 286/286 places, 694/694 transitions.
Applied a total of 0 rules in 13 ms. Remains 286 /286 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2022-05-17 10:13:58] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 286 cols
[2022-05-17 10:13:58] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:13:58] [INFO ] Implicit Places using invariants in 237 ms returned [250, 262, 263, 264, 265, 266]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 254 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 280/286 places, 694/694 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 280/286 places, 694/694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 490665 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 490665 steps, saw 73714 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 10 properties.
[2022-05-17 10:14:02] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 280 cols
[2022-05-17 10:14:02] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:14:02] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:14:02] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 10:14:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:14:03] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-17 10:14:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:03] [INFO ] After 201ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-17 10:14:03] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:14:03] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:14:03] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:14:03] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:14:03] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:14:04] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2096 ms
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:14:05] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 908 ms
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:14:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 640 ms
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-17 10:14:07] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 3 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1219 ms
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 10:14:08] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:14:09] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:14:09] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:14:09] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:14:09] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:14:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 523 ms
[2022-05-17 10:14:09] [INFO ] After 6144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-05-17 10:14:09] [INFO ] After 6781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 27 ms.
Support contains 15 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 694/694 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 694/694 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 694/694 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2022-05-17 10:14:09] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 280 cols
[2022-05-17 10:14:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:14:09] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-17 10:14:09] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 280 cols
[2022-05-17 10:14:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:14:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:10] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2022-05-17 10:14:10] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-17 10:14:10] [INFO ] Flow matrix only has 574 transitions (discarded 120 similar events)
// Phase 1: matrix 574 rows 280 cols
[2022-05-17 10:14:10] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 10:14:10] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 694/694 transitions.
Graph (trivial) has 496 edges and 280 vertex of which 152 / 280 are part of one of the 29 SCC in 3 ms
Free SCC test removed 123 places
Drop transitions removed 246 transitions
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 381 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 1 place count 157 transition count 298
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 142 transition count 298
Performed 21 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 73 place count 121 transition count 270
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 81 place count 121 transition count 262
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 125 place count 96 transition count 320
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 51 edges and 96 vertex of which 38 / 96 are part of one of the 6 SCC in 0 ms
Free SCC test removed 32 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 138 place count 64 transition count 308
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 176 place count 64 transition count 270
Drop transitions removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 3 with 77 rules applied. Total rules applied 253 place count 64 transition count 193
Graph (complete) has 223 edges and 64 vertex of which 34 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 34 transition count 193
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 4 with 150 rules applied. Total rules applied 404 place count 34 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 404 place count 34 transition count 42
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 406 place count 33 transition count 42
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 418 place count 33 transition count 30
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 430 place count 21 transition count 30
Applied a total of 430 rules in 31 ms. Remains 21 /280 variables (removed 259) and now considering 30/694 (removed 664) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 10:14:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 10:14:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 10:14:10] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2022-05-17 10:14:10] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 10:14:10] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:4
[2022-05-17 10:14:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 10:14:10] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-17 10:14:10] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 10:14:10] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2022-05-17 10:14:11] [INFO ] Flatten gal took : 2 ms
[2022-05-17 10:14:11] [INFO ] Flatten gal took : 2 ms
[2022-05-17 10:14:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10301342452242963830.gal : 1 ms
[2022-05-17 10:14:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8923776046714500113.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12516032225387453293;'/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/ReachabilityCardinality10301342452242963830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8923776046714500113.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/ReachabilityCardinality8923776046714500113.prop.
Reachability property AtomicPropp71 is true.
Reachability property AtomicPropp62 is true.
Reachability property AtomicPropp45 is true.
SDD proceeding with computation,7 properties remain. new max is 2
SDD size :1 after 16
Reachability property AtomicPropp39 is true.
SDD proceeding with computation,6 properties remain. new max is 2
SDD size :16 after 64
Reachability property AtomicPropp69 is true.
Reachability property AtomicPropp66 is true.
Reachability property AtomicPropp52 is true.
Reachability property AtomicPropp36 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :64 after 384
Reachability property AtomicPropp49 is true.
Reachability property AtomicPropp47 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1536,0.01079,3944,2,37,17,252,6,0,117,105,0
Total reachable state count : 1536

Verifying 10 reachability properties.
Reachability property AtomicPropp36 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp36,64,0.011025,3944,2,30,17,252,7,0,123,105,0
Reachability property AtomicPropp39 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp39,8,0.011138,3944,2,26,17,252,8,0,125,105,0
Reachability property AtomicPropp45 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp45,4,0.011244,3944,2,25,17,252,9,0,127,105,0
Reachability property AtomicPropp47 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp47,384,0.01134,3944,2,34,17,252,10,0,129,105,0
Reachability property AtomicPropp49 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp49,384,0.011498,3944,2,34,17,252,11,0,134,105,0
Reachability property AtomicPropp52 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp52,96,0.011601,3944,2,31,17,252,12,0,136,105,0
Reachability property AtomicPropp62 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp62,1,0.011806,3944,2,22,17,252,13,0,143,105,0
Reachability property AtomicPropp66 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp66,32,0.011922,3944,2,29,17,252,14,0,145,105,0
Reachability property AtomicPropp69 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp69,96,0.012025,3944,2,31,17,252,15,0,147,105,0
Reachability property AtomicPropp71 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp71,1,0.012171,3944,2,22,17,252,16,0,152,105,0
Successfully simplified 37 atomic propositions for a total of 14 simplifications.
FORMULA Peterson-PT-5-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 10:14:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-17 10:14:11] [INFO ] Flatten gal took : 45 ms
FORMULA Peterson-PT-5-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 10:14:11] [INFO ] Flatten gal took : 49 ms
[2022-05-17 10:14:11] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 617 out of 834 places (down from 619) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:14:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:11] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 10:14:11] [INFO ] Implicit Places using invariants in 230 ms returned []
[2022-05-17 10:14:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:11] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:14:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:12] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2022-05-17 10:14:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:12] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:14:13] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:14:13] [INFO ] Flatten gal took : 59 ms
[2022-05-17 10:14:13] [INFO ] Flatten gal took : 94 ms
[2022-05-17 10:14:13] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:14:13] [INFO ] Flatten gal took : 46 ms
[2022-05-17 10:14:13] [INFO ] Flatten gal took : 46 ms
[2022-05-17 10:14:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7244629744987806330.gal : 32 ms
[2022-05-17 10:14:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality6961599609887550163.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7244629744987806330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6961599609887550163.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:14:43] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:14:43] [INFO ] Applying decomposition
[2022-05-17 10:14:43] [INFO ] Flatten gal took : 30 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/graph16386749585040488554.txt' '-o' '/tmp/graph16386749585040488554.bin' '-w' '/tmp/graph16386749585040488554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16386749585040488554.bin' '-l' '-1' '-v' '-w' '/tmp/graph16386749585040488554.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:14:44] [INFO ] Decomposing Gal with order
[2022-05-17 10:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:14:45] [INFO ] Removed a total of 840 redundant transitions.
[2022-05-17 10:14:45] [INFO ] Flatten gal took : 894 ms
[2022-05-17 10:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1257 labels/synchronizations in 122 ms.
[2022-05-17 10:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7430872036015945140.gal : 34 ms
[2022-05-17 10:14:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17265396003033766557.ctl : 401 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7430872036015945140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17265396003033766557.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:15:16] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:16] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:15:16] [INFO ] Implicit Places using invariants in 538 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 543 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:15:16] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:15:16] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:15:16] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:15:16] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:15:16] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:15:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10759917445399919695.gal : 10 ms
[2022-05-17 10:15:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6903869035831554827.ctl : 37 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10759917445399919695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6903869035831554827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:15:47] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:15:47] [INFO ] Applying decomposition
[2022-05-17 10:15:47] [INFO ] Flatten gal took : 27 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/graph17858943341151787728.txt' '-o' '/tmp/graph17858943341151787728.bin' '-w' '/tmp/graph17858943341151787728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17858943341151787728.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858943341151787728.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:15:47] [INFO ] Decomposing Gal with order
[2022-05-17 10:15:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:15:47] [INFO ] Removed a total of 1402 redundant transitions.
[2022-05-17 10:15:47] [INFO ] Flatten gal took : 88 ms
[2022-05-17 10:15:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-17 10:15:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10321283712124093138.gal : 8 ms
[2022-05-17 10:15:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9818602313403425004.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10321283712124093138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9818602313403425004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:17] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:16:18] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-17 10:16:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:18] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:16:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:19] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2022-05-17 10:16:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:19] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:16:20] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 69 ms
[2022-05-17 10:16:20] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 43 ms
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 59 ms
[2022-05-17 10:16:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7728338501754329405.gal : 5 ms
[2022-05-17 10:16:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11771117073719431935.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7728338501754329405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11771117073719431935.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:16:50] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:16:50] [INFO ] Applying decomposition
[2022-05-17 10:16:51] [INFO ] Flatten gal took : 28 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/graph7927134034732794135.txt' '-o' '/tmp/graph7927134034732794135.bin' '-w' '/tmp/graph7927134034732794135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7927134034732794135.bin' '-l' '-1' '-v' '-w' '/tmp/graph7927134034732794135.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:16:51] [INFO ] Decomposing Gal with order
[2022-05-17 10:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:16:51] [INFO ] Removed a total of 374 redundant transitions.
[2022-05-17 10:16:51] [INFO ] Flatten gal took : 589 ms
[2022-05-17 10:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 660 labels/synchronizations in 119 ms.
[2022-05-17 10:16:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8483400539742260370.gal : 8 ms
[2022-05-17 10:16:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16665517562620206357.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8483400539742260370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16665517562620206357.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:17:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:17:22] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:17:22] [INFO ] Implicit Places using invariants in 289 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 293 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:17:22] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:17:22] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:17:22] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:17:22] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:17:22] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17706007509559217073.gal : 3 ms
[2022-05-17 10:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4905836679853522949.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17706007509559217073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4905836679853522949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:17:52] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:17:52] [INFO ] Applying decomposition
[2022-05-17 10:17:52] [INFO ] Flatten gal took : 27 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/graph7943048200628731595.txt' '-o' '/tmp/graph7943048200628731595.bin' '-w' '/tmp/graph7943048200628731595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7943048200628731595.bin' '-l' '-1' '-v' '-w' '/tmp/graph7943048200628731595.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:17:52] [INFO ] Decomposing Gal with order
[2022-05-17 10:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:17:53] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:17:53] [INFO ] Flatten gal took : 52 ms
[2022-05-17 10:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 10:17:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14090364471847489049.gal : 12 ms
[2022-05-17 10:17:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4872808885551600687.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14090364471847489049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4872808885551600687.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 354 place count 834 transition count 888
Reduce places removed 354 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 355 rules applied. Total rules applied 709 place count 480 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 710 place count 479 transition count 887
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 710 place count 479 transition count 708
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1068 place count 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1128 place count 270 transition count 678
Applied a total of 1128 rules in 50 ms. Remains 270 /834 variables (removed 564) and now considering 678/1242 (removed 564) transitions.
[2022-05-17 10:18:23] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 10:18:23] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:18:23] [INFO ] Implicit Places using invariants in 173 ms returned [234, 246, 247, 248, 249, 250]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 174 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 264/834 places, 678/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 264/834 places, 678/1242 transitions.
[2022-05-17 10:18:23] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:18:23] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:18:23] [INFO ] Input system was already deterministic with 678 transitions.
[2022-05-17 10:18:23] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:18:23] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:18:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8836373564758155653.gal : 2 ms
[2022-05-17 10:18:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality14586141176732293760.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8836373564758155653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14586141176732293760.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:18:53] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:18:53] [INFO ] Applying decomposition
[2022-05-17 10:18:53] [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/graph9000641184408126317.txt' '-o' '/tmp/graph9000641184408126317.bin' '-w' '/tmp/graph9000641184408126317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9000641184408126317.bin' '-l' '-1' '-v' '-w' '/tmp/graph9000641184408126317.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:18:53] [INFO ] Decomposing Gal with order
[2022-05-17 10:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:18:53] [INFO ] Removed a total of 919 redundant transitions.
[2022-05-17 10:18:53] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 9 ms.
[2022-05-17 10:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17861141908492733581.gal : 4 ms
[2022-05-17 10:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9958382927937761261.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17861141908492733581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9958382927937761261.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 834 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 179 Pre rules applied. Total rules applied 718 place count 475 transition count 704
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1134 place count 267 transition count 675
Applied a total of 1134 rules in 38 ms. Remains 267 /834 variables (removed 567) and now considering 675/1242 (removed 567) transitions.
[2022-05-17 10:19:23] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
// Phase 1: matrix 555 rows 267 cols
[2022-05-17 10:19:23] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:19:23] [INFO ] Implicit Places using invariants in 184 ms returned [230, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 185 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 261/834 places, 675/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/834 places, 675/1242 transitions.
[2022-05-17 10:19:24] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:19:24] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:19:24] [INFO ] Input system was already deterministic with 675 transitions.
[2022-05-17 10:19:24] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:19:24] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:19:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7648652266813426092.gal : 2 ms
[2022-05-17 10:19:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10597936212275820761.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7648652266813426092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10597936212275820761.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:19:54] [INFO ] Flatten gal took : 18 ms
[2022-05-17 10:19:54] [INFO ] Applying decomposition
[2022-05-17 10:19:54] [INFO ] Flatten gal took : 15 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/graph1578021707026047457.txt' '-o' '/tmp/graph1578021707026047457.bin' '-w' '/tmp/graph1578021707026047457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1578021707026047457.bin' '-l' '-1' '-v' '-w' '/tmp/graph1578021707026047457.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:19:54] [INFO ] Decomposing Gal with order
[2022-05-17 10:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:19:54] [INFO ] Removed a total of 908 redundant transitions.
[2022-05-17 10:19:54] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:19:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 4 ms.
[2022-05-17 10:19:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11601423042614290673.gal : 3 ms
[2022-05-17 10:19:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14877743440770874482.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11601423042614290673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14877743440770874482.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1138 place count 265 transition count 673
Applied a total of 1138 rules in 36 ms. Remains 265 /834 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
[2022-05-17 10:20:24] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 265 cols
[2022-05-17 10:20:24] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:20:24] [INFO ] Implicit Places using invariants in 188 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 189 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 259/834 places, 673/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 259/834 places, 673/1242 transitions.
[2022-05-17 10:20:24] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:20:24] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:20:24] [INFO ] Input system was already deterministic with 673 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1231769 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :{}
Probabilistic random walk after 1231769 steps, saw 177300 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:27] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:27] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:20:27] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 10:20:27] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:28] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:28] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 10:20:28] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 11 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=262 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:28] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:28] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:20:28] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:20:28] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:28] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:28] [INFO ] After 76ms 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-05-17 10:20:28] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1984 ms. (steps per millisecond=504 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2409414 steps, run timeout after 6001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 2409414 steps, saw 346213 distinct states, run finished after 6001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:37] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:37] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:20:37] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:20:37] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:37] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:37] [INFO ] After 67ms 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-05-17 10:20:37] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 18 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:20:37] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:37] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:20:37] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 10:20:37] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:20:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:38] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2022-05-17 10:20:38] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-17 10:20:38] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:38] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 10:20:38] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:39] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:39] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:20:39] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:20:39] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:39] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:39] [INFO ] After 60ms 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-05-17 10:20:39] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1211119 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{}
Probabilistic random walk after 1211119 steps, saw 175330 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:42] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:42] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:20:42] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:20:42] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:42] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:42] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 10:20:42] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1251285 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{}
Probabilistic random walk after 1251285 steps, saw 180917 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:20:45] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:45] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:20:45] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:20:46] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:46] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:46] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 10:20:46] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:20:46] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:46] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 10:20:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-17 10:20:46] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:46] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:20:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:20:46] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2022-05-17 10:20:46] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 10:20:46] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:20:46] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:20:47] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 509 edges and 259 vertex of which 180 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 150 places
Drop transitions removed 300 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 449 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 195
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 195
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 189
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 183
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 183
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 32 rules applied. Total rules applied 127 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 152 place count 2 transition count 2
Applied a total of 152 rules in 12 ms. Remains 2 /259 variables (removed 257) and now considering 2/673 (removed 671) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 10:20:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:20:47] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 10:20:47] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:47] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:20:47] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality588687025715962417.gal : 1 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5012920661349789953.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1632967185417836563;'/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/ReachabilityCardinality588687025715962417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5012920661349789953.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...318
Loading property file /tmp/ReachabilityCardinality5012920661349789953.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.003352,3448,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.003903,3888,2,3,6,12,7,0,16,6,0
Graph (trivial) has 509 edges and 259 vertex of which 180 / 259 are part of one of the 30 SCC in 1 ms
Free SCC test removed 150 places
Drop transitions removed 300 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 449 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 109 transition count 195
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 195
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 77 place count 68 transition count 189
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 89 place count 62 transition count 183
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 32 transition count 183
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 0 with 32 rules applied. Total rules applied 127 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 152 place count 2 transition count 2
Applied a total of 152 rules in 12 ms. Remains 2 /259 variables (removed 257) and now considering 2/673 (removed 671) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 10:20:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:20:47] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:20:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 10:20:47] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:47] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:20:47] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12328813320993155596.gal : 1 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9739076822021934336.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/ReachabilityCardinality12328813320993155596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9739076822021934336.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/ReachabilityCardinality9739076822021934336.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.003029,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property Peterson-PT-5-CTLCardinality-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-CTLCardinality-11,1,0.003682,3892,2,3,6,12,7,0,16,6,0
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:20:47] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11833492849700472663.gal : 2 ms
[2022-05-17 10:20:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality12126923996952305998.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11833492849700472663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12126923996952305998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:21:17] [INFO ] Flatten gal took : 19 ms
[2022-05-17 10:21:17] [INFO ] Applying decomposition
[2022-05-17 10:21:17] [INFO ] Flatten gal took : 26 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/graph14034289669840910166.txt' '-o' '/tmp/graph14034289669840910166.bin' '-w' '/tmp/graph14034289669840910166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14034289669840910166.bin' '-l' '-1' '-v' '-w' '/tmp/graph14034289669840910166.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:21:17] [INFO ] Decomposing Gal with order
[2022-05-17 10:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:21:17] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-17 10:21:17] [INFO ] Flatten gal took : 48 ms
[2022-05-17 10:21:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 5 ms.
[2022-05-17 10:21:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10982416525259930108.gal : 9 ms
[2022-05-17 10:21:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6157245774595605074.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10982416525259930108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6157245774595605074.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:21:47] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:21:47] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:21:48] [INFO ] Implicit Places using invariants in 299 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 313 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:21:48] [INFO ] Flatten gal took : 23 ms
[2022-05-17 10:21:48] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:21:48] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:21:48] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:21:48] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:21:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3191800230406083810.gal : 3 ms
[2022-05-17 10:21:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3740722087100323999.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3191800230406083810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3740722087100323999.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:22:18] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:22:18] [INFO ] Applying decomposition
[2022-05-17 10:22:18] [INFO ] Flatten gal took : 26 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/graph10652200066185504186.txt' '-o' '/tmp/graph10652200066185504186.bin' '-w' '/tmp/graph10652200066185504186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10652200066185504186.bin' '-l' '-1' '-v' '-w' '/tmp/graph10652200066185504186.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:22:18] [INFO ] Decomposing Gal with order
[2022-05-17 10:22:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:22:18] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:22:18] [INFO ] Flatten gal took : 61 ms
[2022-05-17 10:22:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:22:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10751604031110507960.gal : 12 ms
[2022-05-17 10:22:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17066011102832572767.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10751604031110507960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17066011102832572767.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:22:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:22:48] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:22:49] [INFO ] Implicit Places using invariants in 298 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 310 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:22:49] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:22:49] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:22:49] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:22:49] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:22:49] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:22:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1928421228983372580.gal : 2 ms
[2022-05-17 10:22:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2368727105008610110.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1928421228983372580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2368727105008610110.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:23:19] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:23:19] [INFO ] Applying decomposition
[2022-05-17 10:23:19] [INFO ] Flatten gal took : 25 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/graph6988558660783917070.txt' '-o' '/tmp/graph6988558660783917070.bin' '-w' '/tmp/graph6988558660783917070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6988558660783917070.bin' '-l' '-1' '-v' '-w' '/tmp/graph6988558660783917070.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:23:19] [INFO ] Decomposing Gal with order
[2022-05-17 10:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:23:19] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:23:19] [INFO ] Flatten gal took : 43 ms
[2022-05-17 10:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2482875388457063057.gal : 18 ms
[2022-05-17 10:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality3551364516555796951.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2482875388457063057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3551364516555796951.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 29 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:23:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:23:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:23:49] [INFO ] Implicit Places using invariants in 293 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 307 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:23:50] [INFO ] Flatten gal took : 22 ms
[2022-05-17 10:23:50] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:23:50] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:23:50] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:23:50] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:23:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16722078677898517146.gal : 3 ms
[2022-05-17 10:23:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2040883002166127917.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16722078677898517146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2040883002166127917.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:24:20] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:24:20] [INFO ] Applying decomposition
[2022-05-17 10:24:20] [INFO ] Flatten gal took : 24 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/graph773429788131872058.txt' '-o' '/tmp/graph773429788131872058.bin' '-w' '/tmp/graph773429788131872058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph773429788131872058.bin' '-l' '-1' '-v' '-w' '/tmp/graph773429788131872058.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:24:20] [INFO ] Decomposing Gal with order
[2022-05-17 10:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:24:20] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:24:20] [INFO ] Flatten gal took : 83 ms
[2022-05-17 10:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:24:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12031769140578055271.gal : 10 ms
[2022-05-17 10:24:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4774726232669321524.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12031769140578055271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4774726232669321524.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:24:50] [INFO ] Flatten gal took : 44 ms
[2022-05-17 10:24:50] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:24:50] [INFO ] Applying decomposition
[2022-05-17 10:24:50] [INFO ] Flatten gal took : 26 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/graph8516452557001356107.txt' '-o' '/tmp/graph8516452557001356107.bin' '-w' '/tmp/graph8516452557001356107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8516452557001356107.bin' '-l' '-1' '-v' '-w' '/tmp/graph8516452557001356107.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:24:50] [INFO ] Decomposing Gal with order
[2022-05-17 10:24:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:24:51] [INFO ] Removed a total of 635 redundant transitions.
[2022-05-17 10:24:51] [INFO ] Flatten gal took : 448 ms
[2022-05-17 10:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 9 ms.
[2022-05-17 10:24:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5404746836254652624.gal : 5 ms
[2022-05-17 10:24:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6481277358136749570.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5404746836254652624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6481277358136749570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:48:59] [INFO ] Applying decomposition
[2022-05-17 10:48:59] [INFO ] Flatten gal took : 175 ms
[2022-05-17 10:48:59] [INFO ] Decomposing Gal with order
[2022-05-17 10:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:48:59] [INFO ] Removed a total of 771 redundant transitions.
[2022-05-17 10:49:00] [INFO ] Flatten gal took : 383 ms
[2022-05-17 10:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 63 ms.
[2022-05-17 10:49:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2545448014258291060.gal : 53 ms
[2022-05-17 10:49:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality10580079665093073575.ctl : 18 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2545448014258291060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10580079665093073575.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.

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

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