Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652645330755

Running Version 202205111006
[2022-05-15 20:08:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-15 20:08:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:08:52] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-05-15 20:08:52] [INFO ] Transformed 1064 places.
[2022-05-15 20:08:52] [INFO ] Transformed 998 transitions.
[2022-05-15 20:08:52] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 150 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2022-05-15 20:08:52] [INFO ] Invariants computation overflowed in 193 ms
[2022-05-15 20:08:53] [INFO ] Implicit Places using invariants in 626 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2022-05-15 20:08:53] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 20:09:06] [INFO ] Implicit Places using invariants and state equation in 13106 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13773 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 157 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:09:06] [INFO ] Invariants computation overflowed in 122 ms
[2022-05-15 20:09:06] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:09:06] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 20:09:22] [INFO ] Implicit Places using invariants and state equation in 15413 ms returned []
Implicit Place search using SMT with State Equation took 15839 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions, in 2 iterations. Remains : 1057/1064 places, 997/998 transitions.
Support contains 37 out of 1057 places after structural reductions.
[2022-05-15 20:09:22] [INFO ] Flatten gal took : 111 ms
[2022-05-15 20:09:22] [INFO ] Flatten gal took : 58 ms
[2022-05-15 20:09:22] [INFO ] Input system was already deterministic with 997 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 133962 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{0=1}
Probabilistic random walk after 133962 steps, saw 66994 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :1
Running SMT prover for 23 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:09:27] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 20:09:34] [INFO ] After 6423ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16 real:5
[2022-05-15 20:09:35] [INFO ] Deduced a trap composed of 197 places in 211 ms of which 6 ms to minimize.
[2022-05-15 20:09:35] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 1 ms to minimize.
[2022-05-15 20:09:35] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 1 ms to minimize.
[2022-05-15 20:09:36] [INFO ] Deduced a trap composed of 210 places in 245 ms of which 1 ms to minimize.
[2022-05-15 20:09:36] [INFO ] Deduced a trap composed of 248 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:09:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1508 ms
[2022-05-15 20:09:37] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 1 ms to minimize.
[2022-05-15 20:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2022-05-15 20:09:37] [INFO ] Deduced a trap composed of 211 places in 178 ms of which 0 ms to minimize.
[2022-05-15 20:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2022-05-15 20:09:38] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 0 ms to minimize.
[2022-05-15 20:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2022-05-15 20:09:39] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 1 ms to minimize.
[2022-05-15 20:09:39] [INFO ] Deduced a trap composed of 109 places in 185 ms of which 0 ms to minimize.
[2022-05-15 20:09:39] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 1 ms to minimize.
[2022-05-15 20:09:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 788 ms
[2022-05-15 20:09:39] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2022-05-15 20:09:40] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2022-05-15 20:09:40] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 0 ms to minimize.
[2022-05-15 20:09:40] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2022-05-15 20:09:40] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 1 ms to minimize.
[2022-05-15 20:09:41] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 0 ms to minimize.
[2022-05-15 20:09:41] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 1 ms to minimize.
[2022-05-15 20:09:41] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 0 ms to minimize.
[2022-05-15 20:09:42] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 5 ms to minimize.
[2022-05-15 20:09:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2463 ms
[2022-05-15 20:09:42] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 1 ms to minimize.
[2022-05-15 20:09:42] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 1 ms to minimize.
[2022-05-15 20:09:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2022-05-15 20:09:43] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 1 ms to minimize.
[2022-05-15 20:09:43] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 1 ms to minimize.
[2022-05-15 20:09:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2022-05-15 20:09:44] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2022-05-15 20:09:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2022-05-15 20:09:44] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 2 ms to minimize.
[2022-05-15 20:09:44] [INFO ] Deduced a trap composed of 91 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:09:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2022-05-15 20:09:46] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2022-05-15 20:09:46] [INFO ] After 18158ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:21
[2022-05-15 20:09:46] [INFO ] After 19194ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:21
[2022-05-15 20:09:53] [INFO ] After 5934ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2022-05-15 20:09:53] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 0 ms to minimize.
[2022-05-15 20:09:53] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:09:53] [INFO ] Deduced a trap composed of 174 places in 191 ms of which 2 ms to minimize.
[2022-05-15 20:09:54] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:09:54] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 1 ms to minimize.
[2022-05-15 20:09:54] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:09:54] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 2 ms to minimize.
[2022-05-15 20:09:55] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:09:55] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:09:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2260 ms
[2022-05-15 20:09:55] [INFO ] Deduced a trap composed of 233 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:09:56] [INFO ] Deduced a trap composed of 243 places in 154 ms of which 1 ms to minimize.
[2022-05-15 20:09:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2022-05-15 20:09:57] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 1 ms to minimize.
[2022-05-15 20:09:57] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:09:57] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:09:57] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 0 ms to minimize.
[2022-05-15 20:09:58] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 1 ms to minimize.
[2022-05-15 20:09:58] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 0 ms to minimize.
[2022-05-15 20:09:58] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 0 ms to minimize.
[2022-05-15 20:09:59] [INFO ] Deduced a trap composed of 103 places in 195 ms of which 0 ms to minimize.
[2022-05-15 20:09:59] [INFO ] Deduced a trap composed of 101 places in 172 ms of which 1 ms to minimize.
[2022-05-15 20:10:00] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 0 ms to minimize.
[2022-05-15 20:10:00] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 0 ms to minimize.
[2022-05-15 20:10:00] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 2 ms to minimize.
[2022-05-15 20:10:02] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 0 ms to minimize.
[2022-05-15 20:10:06] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 1 ms to minimize.
[2022-05-15 20:10:07] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 1 ms to minimize.
[2022-05-15 20:10:07] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 10772 ms
[2022-05-15 20:10:08] [INFO ] Deduced a trap composed of 211 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:10:08] [INFO ] Deduced a trap composed of 199 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:10:08] [INFO ] Deduced a trap composed of 197 places in 142 ms of which 3 ms to minimize.
[2022-05-15 20:10:09] [INFO ] Deduced a trap composed of 186 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:10:09] [INFO ] Deduced a trap composed of 192 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:10:09] [INFO ] Deduced a trap composed of 191 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:10:09] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 0 ms to minimize.
[2022-05-15 20:10:10] [INFO ] Deduced a trap composed of 187 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:10:10] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:10:11] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 3028 ms
[2022-05-15 20:10:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 20:10:11] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:21
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 30004 ms.
Support contains 31 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 216 rules applied. Total rules applied 217 place count 1055 transition count 780
Reduce places removed 215 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 224 rules applied. Total rules applied 441 place count 840 transition count 771
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 450 place count 831 transition count 771
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 450 place count 831 transition count 728
Deduced a syphon composed of 43 places in 6 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 536 place count 788 transition count 728
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 3 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 868 place count 622 transition count 562
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 938 place count 587 transition count 562
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 939 place count 587 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 940 place count 586 transition count 561
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 1013 place count 586 transition count 488
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 1086 place count 513 transition count 488
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 5 with 82 rules applied. Total rules applied 1168 place count 513 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1169 place count 512 transition count 487
Applied a total of 1169 rules in 269 ms. Remains 512 /1057 variables (removed 545) and now considering 487/997 (removed 510) transitions.
Finished structural reductions, in 1 iterations. Remains : 512/1057 places, 487/997 transitions.
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 179148 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179148 steps, saw 89603 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 487 rows 512 cols
[2022-05-15 20:10:45] [INFO ] Computed 99 place invariants in 82 ms
[2022-05-15 20:10:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:10:45] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 51 ms returned sat
[2022-05-15 20:10:47] [INFO ] After 1389ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:16
[2022-05-15 20:10:47] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 20:10:47] [INFO ] After 635ms SMT Verify possible using 70 Read/Feed constraints in real domain returned unsat :0 sat :2 real:19
[2022-05-15 20:10:48] [INFO ] After 820ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-15 20:10:48] [INFO ] After 2667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-15 20:10:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-15 20:10:48] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 48 ms returned sat
[2022-05-15 20:10:49] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-15 20:10:51] [INFO ] After 2192ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2022-05-15 20:10:52] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:10:52] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:10:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 0 ms to minimize.
[2022-05-15 20:10:53] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 153 places in 103 ms of which 0 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 0 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 158 places in 101 ms of which 1 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 133 places in 101 ms of which 0 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 0 ms to minimize.
[2022-05-15 20:10:54] [INFO ] Deduced a trap composed of 139 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 139 places in 105 ms of which 0 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 133 places in 98 ms of which 1 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 137 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-05-15 20:10:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2371 ms
[2022-05-15 20:10:56] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:10:56] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:10:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-15 20:10:56] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-15 20:10:57] [INFO ] After 7348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1401 ms.
[2022-05-15 20:10:58] [INFO ] After 10422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 30021 ms.
Support contains 31 out of 512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 487/487 transitions.
Applied a total of 0 rules in 36 ms. Remains 512 /512 variables (removed 0) and now considering 487/487 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 487/487 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 487/487 transitions.
Applied a total of 0 rules in 22 ms. Remains 512 /512 variables (removed 0) and now considering 487/487 (removed 0) transitions.
// Phase 1: matrix 487 rows 512 cols
[2022-05-15 20:11:28] [INFO ] Computed 99 place invariants in 87 ms
[2022-05-15 20:11:29] [INFO ] Implicit Places using invariants in 661 ms returned [43, 49, 72, 77, 99, 104, 125, 131, 152, 157, 158, 181, 187, 208, 216, 223, 238, 244, 304, 309, 329, 334, 386, 392, 414, 416, 420, 475, 480, 484]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 663 ms to find 30 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 482/512 places, 487/487 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 482 transition count 474
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 469 transition count 474
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 469 transition count 474
Applied a total of 29 rules in 43 ms. Remains 469 /482 variables (removed 13) and now considering 474/487 (removed 13) transitions.
// Phase 1: matrix 474 rows 469 cols
[2022-05-15 20:11:29] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:11:29] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 474 rows 469 cols
[2022-05-15 20:11:29] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:11:29] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 20:11:54] [INFO ] Implicit Places using invariants and state equation in 25085 ms returned []
Implicit Place search using SMT with State Equation took 25318 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 469/512 places, 474/487 transitions.
Finished structural reductions, in 2 iterations. Remains : 469/512 places, 474/487 transitions.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((G(!(F(p0) U p0))||G(F(p1)))))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 479 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 559 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 556 transition count 533
Applied a total of 999 rules in 137 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:11:55] [INFO ] Computed 99 place invariants in 54 ms
[2022-05-15 20:11:55] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:11:55] [INFO ] Computed 99 place invariants in 44 ms
[2022-05-15 20:11:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:12:12] [INFO ] Implicit Places using invariants and state equation in 17381 ms returned []
Implicit Place search using SMT with State Equation took 17691 ms to find 0 implicit places.
[2022-05-15 20:12:12] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:12:12] [INFO ] Computed 99 place invariants in 51 ms
[2022-05-15 20:12:13] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 556/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s484 1), p1:(OR (LT s403 1) (LT s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14032 reset in 253 ms.
Product exploration explored 100000 steps with 13912 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 805 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 344497 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344497 steps, saw 172300 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:12:17] [INFO ] Computed 99 place invariants in 56 ms
[2022-05-15 20:12:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:12:17] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 40 ms returned sat
[2022-05-15 20:12:17] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 20:12:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:12:17] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2022-05-15 20:12:18] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 20:12:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:12:19] [INFO ] After 959ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 20:12:19] [INFO ] After 1017ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-15 20:12:19] [INFO ] After 1939ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1666 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 84 place count 554 transition count 451
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 164 place count 474 transition count 451
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 242 place count 474 transition count 451
Applied a total of 242 rules in 63 ms. Remains 474 /556 variables (removed 82) and now considering 451/533 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/556 places, 451/533 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519002 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 519002 steps, saw 259662 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 474 cols
[2022-05-15 20:12:24] [INFO ] Computed 99 place invariants in 51 ms
[2022-05-15 20:12:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 20:12:25] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2022-05-15 20:12:25] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:12:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:12:25] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2022-05-15 20:12:25] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:12:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:12:26] [INFO ] After 421ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:12:26] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-05-15 20:12:26] [INFO ] After 1012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 12 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 451/451 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 18 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
// Phase 1: matrix 451 rows 474 cols
[2022-05-15 20:12:28] [INFO ] Computed 99 place invariants in 43 ms
[2022-05-15 20:12:29] [INFO ] Implicit Places using invariants in 1377 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 418, 440, 445, 449, 466, 472]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1379 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 436/474 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 436 transition count 432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 417 transition count 432
Applied a total of 38 rules in 23 ms. Remains 417 /436 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:12:29] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:12:30] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:12:30] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:12:30] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:12:44] [INFO ] Implicit Places using invariants and state equation in 14407 ms returned []
Implicit Place search using SMT with State Equation took 14666 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 417/474 places, 432/451 transitions.
Finished structural reductions, in 2 iterations. Remains : 417/474 places, 432/451 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 547627 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 547627 steps, saw 273866 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:12:47] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:12:47] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:12:48] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:12:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:12:49] [INFO ] After 890ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:12:49] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:12:49] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 1 ms to minimize.
[2022-05-15 20:12:50] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:12:51] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:12:51] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:12:51] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:12:52] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:12:52] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:12:52] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:12:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:12:53] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:12:53] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:12:53] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:12:53] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:12:53] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:12:54] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:12:54] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:12:54] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:12:54] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 1 ms to minimize.
[2022-05-15 20:12:55] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:12:55] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:12:55] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:12:55] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 1 ms to minimize.
[2022-05-15 20:12:56] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 1 ms to minimize.
[2022-05-15 20:12:56] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:12:56] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7299 ms
[2022-05-15 20:12:56] [INFO ] After 8370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 719 ms.
[2022-05-15 20:12:57] [INFO ] After 9504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 14 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 432/432 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:12:59] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:12:59] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:12:59] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:12:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:13:14] [INFO ] Implicit Places using invariants and state equation in 14766 ms returned []
Implicit Place search using SMT with State Equation took 15044 ms to find 0 implicit places.
[2022-05-15 20:13:14] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2022-05-15 20:13:14] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:13:14] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 432/432 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 417 transition count 396
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 381 transition count 396
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 363 transition count 378
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 363 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 362 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 362 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 112 place count 361 transition count 376
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 361 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 359 transition count 374
Applied a total of 116 rules in 39 ms. Remains 359 /417 variables (removed 58) and now considering 374/432 (removed 58) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 359 cols
[2022-05-15 20:13:14] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:13:15] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:13:15] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:13:15] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:15] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:13:15] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2022-05-15 20:13:15] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 20:13:15] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:15] [INFO ] Flatten gal took : 40 ms
[2022-05-15 20:13:15] [INFO ] Flatten gal took : 38 ms
[2022-05-15 20:13:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10770527892192759461.gal : 17 ms
[2022-05-15 20:13:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3273069590214831886.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4512875909649681103;'/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/ReachabilityCardinality10770527892192759461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3273069590214831886.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/ReachabilityCardinality3273069590214831886.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 178
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :178 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 821
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :821 after 2989
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2989 after 9481
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9481 after 26528
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :26528 after 65152
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :65152 after 175649
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :175649 after 418823
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :418823 after 1.01297e+06
Detected timeout of ITS tools.
[2022-05-15 20:13:30] [INFO ] Flatten gal took : 33 ms
[2022-05-15 20:13:30] [INFO ] Applying decomposition
[2022-05-15 20:13:31] [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/graph3200337407799509412.txt' '-o' '/tmp/graph3200337407799509412.bin' '-w' '/tmp/graph3200337407799509412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3200337407799509412.bin' '-l' '-1' '-v' '-w' '/tmp/graph3200337407799509412.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:13:31] [INFO ] Decomposing Gal with order
[2022-05-15 20:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:13:31] [INFO ] Removed a total of 235 redundant transitions.
[2022-05-15 20:13:31] [INFO ] Flatten gal took : 97 ms
[2022-05-15 20:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 18 ms.
[2022-05-15 20:13:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11985304816249797879.gal : 11 ms
[2022-05-15 20:13:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4208980124115569435.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4512875909649681103;'/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/ReachabilityCardinality11985304816249797879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4208980124115569435.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality4208980124115569435.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 86
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :86 after 290
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :290 after 454
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :454 after 38959
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38959 after 241834
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8995461932188404153
[2022-05-15 20:13:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8995461932188404153
Running compilation step : cd /tmp/ltsmin8995461932188404153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 822 ms.
Running link step : cd /tmp/ltsmin8995461932188404153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8995461932188404153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-020-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 127056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 43 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:14:01] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 20:14:02] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:14:02] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 20:14:17] [INFO ] Implicit Places using invariants and state equation in 15201 ms returned []
Implicit Place search using SMT with State Equation took 15594 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:14:17] [INFO ] Invariants computation overflowed in 105 ms
[2022-05-15 20:14:17] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s924 1) (GEQ s1006 1)), p2:(OR (LT s599 1) (LT s706 1)), p0:(LT s456 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Product exploration explored 100000 steps with 50000 reset in 536 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 17515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 92 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:14:19] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:14:19] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:14:19] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:14:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:14:28] [INFO ] Implicit Places using invariants and state equation in 9078 ms returned []
Implicit Place search using SMT with State Equation took 9318 ms to find 0 implicit places.
[2022-05-15 20:14:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:14:28] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:14:28] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s279 1) (LT s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13822 reset in 199 ms.
Product exploration explored 100000 steps with 13826 reset in 229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 377614 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377614 steps, saw 188863 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:14:32] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:14:33] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:14:33] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:14:33] [INFO ] After 385ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:33] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:14:34] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:14:35] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2022-05-15 20:14:36] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-05-15 20:14:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2299 ms
[2022-05-15 20:14:36] [INFO ] After 2709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 20:14:36] [INFO ] After 3188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 48 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 414053 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 414053 steps, saw 207154 distinct states, run finished after 3002 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:14:39] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:14:39] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:14:40] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:14:40] [INFO ] After 650ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:40] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-05-15 20:14:41] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-15 20:14:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1963 ms
[2022-05-15 20:14:42] [INFO ] After 2670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-15 20:14:42] [INFO ] After 3089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 192 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 16 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:14:43] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:14:43] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:14:43] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:14:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:14:49] [INFO ] Implicit Places using invariants and state equation in 6009 ms returned []
Implicit Place search using SMT with State Equation took 6482 ms to find 0 implicit places.
[2022-05-15 20:14:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:14:49] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:14:49] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 476 transition count 417
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 439 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 438 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 438 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 78 place count 437 transition count 415
Applied a total of 78 rules in 35 ms. Remains 437 /476 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 437 cols
[2022-05-15 20:14:49] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:14:50] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:14:50] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:14:50] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:50] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-15 20:14:50] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 20:14:50] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:50] [INFO ] Flatten gal took : 42 ms
[2022-05-15 20:14:50] [INFO ] Flatten gal took : 40 ms
[2022-05-15 20:14:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1745695898447095271.gal : 5 ms
[2022-05-15 20:14:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18137522961350901854.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11180440586781802956;'/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/ReachabilityCardinality1745695898447095271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18137522961350901854.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/ReachabilityCardinality18137522961350901854.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 47
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :47 after 67
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :67 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :94 after 209
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :209 after 394
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :394 after 893
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :893 after 2275
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2275 after 5168
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5168 after 10749
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10749 after 21922
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :21922 after 44156
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :44156 after 88630
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :88630 after 177703
Detected timeout of ITS tools.
[2022-05-15 20:15:05] [INFO ] Flatten gal took : 40 ms
[2022-05-15 20:15:05] [INFO ] Applying decomposition
[2022-05-15 20:15:05] [INFO ] Flatten gal took : 39 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/graph16350240011301048349.txt' '-o' '/tmp/graph16350240011301048349.bin' '-w' '/tmp/graph16350240011301048349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16350240011301048349.bin' '-l' '-1' '-v' '-w' '/tmp/graph16350240011301048349.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:15:05] [INFO ] Decomposing Gal with order
[2022-05-15 20:15:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:15:06] [INFO ] Removed a total of 470 redundant transitions.
[2022-05-15 20:15:06] [INFO ] Flatten gal took : 100 ms
[2022-05-15 20:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 20 ms.
[2022-05-15 20:15:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8517312773207424352.gal : 9 ms
[2022-05-15 20:15:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12564374049581626396.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11180440586781802956;'/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/ReachabilityCardinality8517312773207424352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12564374049581626396.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality12564374049581626396.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 324
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :324 after 25073
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25073 after 165702
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :165702 after 370399
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16223554616279269035
[2022-05-15 20:15:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16223554616279269035
Running compilation step : cd /tmp/ltsmin16223554616279269035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1017 ms.
Running link step : cd /tmp/ltsmin16223554616279269035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16223554616279269035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 17 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:15:36] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:15:36] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:15:36] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 20:15:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:15:53] [INFO ] Implicit Places using invariants and state equation in 16825 ms returned []
Implicit Place search using SMT with State Equation took 17104 ms to find 0 implicit places.
[2022-05-15 20:15:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:15:53] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:15:53] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 775 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 370222 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370222 steps, saw 185163 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:15:57] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:15:57] [INFO ] After 424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:15:58] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:15:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:15:58] [INFO ] After 368ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:15:58] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:15:58] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:15:58] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:15:58] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:15:59] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:16:00] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2374 ms
[2022-05-15 20:16:00] [INFO ] After 2768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 20:16:00] [INFO ] After 3268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 37 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 417006 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 417006 steps, saw 208618 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:16:04] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:16:04] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:16:04] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:16:05] [INFO ] After 656ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:05] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2022-05-15 20:16:05] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 0 ms to minimize.
[2022-05-15 20:16:05] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:16:06] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-15 20:16:07] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-15 20:16:07] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-15 20:16:07] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:16:07] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-15 20:16:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2137 ms
[2022-05-15 20:16:07] [INFO ] After 2854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-15 20:16:07] [INFO ] After 3291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 200 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:16:08] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:16:08] [INFO ] Implicit Places using invariants in 487 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:16:08] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:16:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:16:12] [INFO ] Implicit Places using invariants and state equation in 3780 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
[2022-05-15 20:16:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:16:12] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:16:12] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 476 transition count 417
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 439 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 438 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 438 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 78 place count 437 transition count 415
Applied a total of 78 rules in 36 ms. Remains 437 /476 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 437 cols
[2022-05-15 20:16:12] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:16:12] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:16:13] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:16:13] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:13] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-15 20:16:13] [INFO ] After 238ms 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-15 20:16:13] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:13] [INFO ] Flatten gal took : 35 ms
[2022-05-15 20:16:13] [INFO ] Flatten gal took : 34 ms
[2022-05-15 20:16:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13852430222228421938.gal : 4 ms
[2022-05-15 20:16:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality78488920101845353.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12001423488839909939;'/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/ReachabilityCardinality13852430222228421938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality78488920101845353.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/ReachabilityCardinality78488920101845353.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 47
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :47 after 67
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :67 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :94 after 209
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :209 after 394
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :394 after 893
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :893 after 2275
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2275 after 5168
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5168 after 10749
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10749 after 21922
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :21922 after 44156
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :44156 after 88630
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :88630 after 177703
Detected timeout of ITS tools.
[2022-05-15 20:16:28] [INFO ] Flatten gal took : 35 ms
[2022-05-15 20:16:28] [INFO ] Applying decomposition
[2022-05-15 20:16:28] [INFO ] Flatten gal took : 34 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/graph8711953001080456314.txt' '-o' '/tmp/graph8711953001080456314.bin' '-w' '/tmp/graph8711953001080456314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8711953001080456314.bin' '-l' '-1' '-v' '-w' '/tmp/graph8711953001080456314.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:16:28] [INFO ] Decomposing Gal with order
[2022-05-15 20:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:16:28] [INFO ] Removed a total of 1968 redundant transitions.
[2022-05-15 20:16:28] [INFO ] Flatten gal took : 64 ms
[2022-05-15 20:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 53 ms.
[2022-05-15 20:16:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8988448592537890354.gal : 7 ms
[2022-05-15 20:16:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14409821435660099304.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12001423488839909939;'/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/ReachabilityCardinality8988448592537890354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14409821435660099304.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality14409821435660099304.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9888751985228237221
[2022-05-15 20:16:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9888751985228237221
Running compilation step : cd /tmp/ltsmin9888751985228237221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1013 ms.
Running link step : cd /tmp/ltsmin9888751985228237221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9888751985228237221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13883 reset in 104 ms.
Product exploration explored 100000 steps with 13899 reset in 124 ms.
Built C files in :
/tmp/ltsmin15540529840040154872
[2022-05-15 20:16:59] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:16:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:16:59] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:16:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:16:59] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:16:59] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:16:59] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15540529840040154872
Running compilation step : cd /tmp/ltsmin15540529840040154872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1135 ms.
Running link step : cd /tmp/ltsmin15540529840040154872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15540529840040154872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16063788712763437200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 13 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:17:14] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:17:14] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:17:14] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:17:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:17:25] [INFO ] Implicit Places using invariants and state equation in 10747 ms returned []
Implicit Place search using SMT with State Equation took 11010 ms to find 0 implicit places.
[2022-05-15 20:17:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:17:25] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:17:25] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Built C files in :
/tmp/ltsmin923795530196187029
[2022-05-15 20:17:25] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:17:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:17:25] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:17:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:17:25] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:17:25] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:17:25] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin923795530196187029
Running compilation step : cd /tmp/ltsmin923795530196187029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1217 ms.
Running link step : cd /tmp/ltsmin923795530196187029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin923795530196187029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8024313393883191807.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:17:40] [INFO ] Flatten gal took : 17 ms
[2022-05-15 20:17:40] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:17:40] [INFO ] Time to serialize gal into /tmp/LTL14171340068921862273.gal : 2 ms
[2022-05-15 20:17:40] [INFO ] Time to serialize properties into /tmp/LTL1067440563026379938.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14171340068921862273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1067440563026379938.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1417134...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((p532<1)||(p538<1))"))))
Formula 0 simplified : !FG"((p532<1)||(p538<1))"
Detected timeout of ITS tools.
[2022-05-15 20:17:55] [INFO ] Flatten gal took : 15 ms
[2022-05-15 20:17:56] [INFO ] Applying decomposition
[2022-05-15 20:17:56] [INFO ] Flatten gal took : 16 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/graph16382580807906606914.txt' '-o' '/tmp/graph16382580807906606914.bin' '-w' '/tmp/graph16382580807906606914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16382580807906606914.bin' '-l' '-1' '-v' '-w' '/tmp/graph16382580807906606914.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:17:56] [INFO ] Decomposing Gal with order
[2022-05-15 20:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:17:56] [INFO ] Removed a total of 404 redundant transitions.
[2022-05-15 20:17:56] [INFO ] Flatten gal took : 37 ms
[2022-05-15 20:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 9 ms.
[2022-05-15 20:17:56] [INFO ] Time to serialize gal into /tmp/LTL17786401883445233402.gal : 5 ms
[2022-05-15 20:17:56] [INFO ] Time to serialize properties into /tmp/LTL12628253264843975807.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17786401883445233402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12628253264843975807.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1778640...247
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.i0.u106.p532<1)||(i4.i0.u94.p538<1))"))))
Formula 0 simplified : !FG"((i4.i0.u106.p532<1)||(i4.i0.u94.p538<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9065667099390321980
[2022-05-15 20:18:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9065667099390321980
Running compilation step : cd /tmp/ltsmin9065667099390321980;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 850 ms.
Running link step : cd /tmp/ltsmin9065667099390321980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9065667099390321980;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 247015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(p0)) U p1)&&X(G((G(p3)&&p2)))))'
Support contains 6 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:18:26] [INFO ] Invariants computation overflowed in 132 ms
[2022-05-15 20:18:26] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:18:26] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 20:18:42] [INFO ] Implicit Places using invariants and state equation in 15618 ms returned []
Implicit Place search using SMT with State Equation took 16040 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:18:42] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-15 20:18:42] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p3)), true, (OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p3 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p3 p2 p1), acceptance={0} source=4 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p3:(GEQ s612 1), p2:(AND (GEQ s937 1) (GEQ s951 1)), p1:(AND (GEQ s910 1) (GEQ s930 1)), p0:(GEQ s354 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 16821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G((p0 U !(p1 U p2))) U p0))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 483 place count 814 transition count 715
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 999 place count 556 transition count 533
Applied a total of 999 rules in 135 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:18:43] [INFO ] Computed 99 place invariants in 63 ms
[2022-05-15 20:18:43] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:18:43] [INFO ] Computed 99 place invariants in 49 ms
[2022-05-15 20:18:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:18:55] [INFO ] Implicit Places using invariants and state equation in 11879 ms returned []
Implicit Place search using SMT with State Equation took 12221 ms to find 0 implicit places.
[2022-05-15 20:18:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 533 rows 556 cols
[2022-05-15 20:18:55] [INFO ] Computed 99 place invariants in 47 ms
[2022-05-15 20:18:55] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 556/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s76 1), p2:(AND (GEQ s5 1) (GEQ s553 1)), p1:(GEQ s388 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 12818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 816 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 481 place count 815 transition count 715
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 999 place count 556 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1001 place count 555 transition count 532
Applied a total of 1001 rules in 122 ms. Remains 555 /1057 variables (removed 502) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 555 cols
[2022-05-15 20:18:56] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-15 20:18:56] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 532 rows 555 cols
[2022-05-15 20:18:56] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:18:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:19:10] [INFO ] Implicit Places using invariants and state equation in 14342 ms returned []
Implicit Place search using SMT with State Equation took 14626 ms to find 0 implicit places.
[2022-05-15 20:19:10] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 532 rows 555 cols
[2022-05-15 20:19:10] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:19:10] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 532/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 555/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s221 1) (GEQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 15050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&X((F(p1)||p2))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 38 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:11] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 20:19:11] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:11] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 20:19:26] [INFO ] Implicit Places using invariants and state equation in 15260 ms returned []
Implicit Place search using SMT with State Equation took 15655 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:26] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 20:19:27] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s376 1), p1:(GEQ s217 1), p0:(GEQ s400 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-09 finished in 16336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(G(p0))))))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 68 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:19:27] [INFO ] Computed 99 place invariants in 52 ms
[2022-05-15 20:19:27] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:19:27] [INFO ] Computed 99 place invariants in 45 ms
[2022-05-15 20:19:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:19:44] [INFO ] Implicit Places using invariants and state equation in 16211 ms returned []
Implicit Place search using SMT with State Equation took 16611 ms to find 0 implicit places.
[2022-05-15 20:19:44] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:19:44] [INFO ] Computed 99 place invariants in 59 ms
[2022-05-15 20:19:44] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s433 1) (LT s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13862 reset in 104 ms.
Product exploration explored 100000 steps with 13905 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 377282 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377282 steps, saw 188695 distinct states, run finished after 3002 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:19:47] [INFO ] Computed 99 place invariants in 49 ms
[2022-05-15 20:19:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:19:47] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2022-05-15 20:19:49] [INFO ] After 1262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:19:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:19:49] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2022-05-15 20:19:50] [INFO ] After 1185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:19:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:19:50] [INFO ] After 308ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:19:50] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:19:50] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:19:51] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:19:52] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 1 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-15 20:19:53] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2022-05-15 20:19:54] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-05-15 20:19:54] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:19:54] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3556 ms
[2022-05-15 20:19:54] [INFO ] After 3928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 550 ms.
[2022-05-15 20:19:54] [INFO ] After 5785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1663 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 237 place count 475 transition count 453
Applied a total of 237 rules in 31 ms. Remains 475 /554 variables (removed 79) and now considering 453/532 (removed 79) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/554 places, 453/532 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407101 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407101 steps, saw 203670 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:19:59] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:20:01] [INFO ] After 1194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:02] [INFO ] After 1113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:20:03] [INFO ] After 861ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:20:03] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:20:04] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2022-05-15 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1796 ms
[2022-05-15 20:20:05] [INFO ] After 2713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-15 20:20:05] [INFO ] After 3945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 21 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:20:07] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:20:07] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:20:07] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:20:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:20:27] [INFO ] Implicit Places using invariants and state equation in 20305 ms returned [225, 253, 259, 281, 286, 306, 311, 332, 337, 359, 365, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 20777 ms to find 21 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 454/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 454 transition count 443
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 444 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 444 transition count 443
Applied a total of 21 rules in 28 ms. Remains 444 /454 variables (removed 10) and now considering 443/453 (removed 10) transitions.
// Phase 1: matrix 443 rows 444 cols
[2022-05-15 20:20:27] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:20:28] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 443 rows 444 cols
[2022-05-15 20:20:28] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:20:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:20:49] [INFO ] Implicit Places using invariants and state equation in 21176 ms returned []
Implicit Place search using SMT with State Equation took 21542 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 444/475 places, 443/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 444/475 places, 443/453 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422065 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422065 steps, saw 211124 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 443 rows 444 cols
[2022-05-15 20:20:52] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:20:53] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:53] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:20:54] [INFO ] After 314ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:20:54] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 3 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:20:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:20:56] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:20:56] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:20:56] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:20:56] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:20:56] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-15 20:20:57] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2022-05-15 20:20:58] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4180 ms
[2022-05-15 20:20:58] [INFO ] After 4569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-15 20:20:58] [INFO ] After 5188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 444/444 places, 443/443 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 444/444 places, 443/443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 444/444 places, 443/443 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 444 cols
[2022-05-15 20:21:00] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:21:00] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 443 rows 444 cols
[2022-05-15 20:21:00] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:21:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:21:14] [INFO ] Implicit Places using invariants and state equation in 13833 ms returned [68, 125, 146, 151, 152, 172, 177, 198, 204, 211, 229]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 14193 ms to find 11 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 433/444 places, 443/443 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 433 transition count 438
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 428 transition count 438
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 428 transition count 438
Applied a total of 12 rules in 22 ms. Remains 428 /433 variables (removed 5) and now considering 438/443 (removed 5) transitions.
// Phase 1: matrix 438 rows 428 cols
[2022-05-15 20:21:14] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:21:14] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 438 rows 428 cols
[2022-05-15 20:21:14] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:21:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:21:40] [INFO ] Implicit Places using invariants and state equation in 25591 ms returned []
Implicit Place search using SMT with State Equation took 25896 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 428/444 places, 438/443 transitions.
Finished structural reductions, in 2 iterations. Remains : 428/444 places, 438/443 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:21:40] [INFO ] Computed 99 place invariants in 51 ms
[2022-05-15 20:21:40] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:21:40] [INFO ] Computed 99 place invariants in 56 ms
[2022-05-15 20:21:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:21:50] [INFO ] Implicit Places using invariants and state equation in 9515 ms returned []
Implicit Place search using SMT with State Equation took 9820 ms to find 0 implicit places.
[2022-05-15 20:21:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:21:50] [INFO ] Computed 99 place invariants in 52 ms
[2022-05-15 20:21:50] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 377614 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377614 steps, saw 188862 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:21:53] [INFO ] Computed 99 place invariants in 52 ms
[2022-05-15 20:21:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:21:54] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 38 ms returned sat
[2022-05-15 20:21:55] [INFO ] After 1266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:21:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:21:55] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 36 ms returned sat
[2022-05-15 20:21:56] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:21:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:21:56] [INFO ] After 306ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:21:56] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:21:57] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:21:59] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:22:00] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-15 20:22:00] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:22:00] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2022-05-15 20:22:00] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3426 ms
[2022-05-15 20:22:00] [INFO ] After 3800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 549 ms.
[2022-05-15 20:22:00] [INFO ] After 5655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1663 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 237 place count 475 transition count 453
Applied a total of 237 rules in 31 ms. Remains 475 /554 variables (removed 79) and now considering 453/532 (removed 79) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/554 places, 453/532 transitions.
Incomplete random walk after 10000 steps, including 1311 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 412477 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 412477 steps, saw 206355 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:22:05] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:22:07] [INFO ] After 1187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:08] [INFO ] After 1112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:22:09] [INFO ] After 882ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:22:09] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:22:10] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:22:11] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:22:11] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1782 ms
[2022-05-15 20:22:11] [INFO ] After 2716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-15 20:22:11] [INFO ] After 3948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:22:13] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:22:13] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:22:13] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:22:13] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:22:36] [INFO ] Implicit Places using invariants and state equation in 23322 ms returned [259, 281, 286, 306, 311, 332, 337, 359, 365, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 23781 ms to find 19 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 456/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 456 transition count 444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 447 transition count 444
Applied a total of 19 rules in 25 ms. Remains 447 /456 variables (removed 9) and now considering 444/453 (removed 9) transitions.
// Phase 1: matrix 444 rows 447 cols
[2022-05-15 20:22:36] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:22:37] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 444 rows 447 cols
[2022-05-15 20:22:37] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-15 20:22:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:23:04] [INFO ] Implicit Places using invariants and state equation in 27057 ms returned []
Implicit Place search using SMT with State Equation took 27422 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 447/475 places, 444/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 447/475 places, 444/453 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427854 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427854 steps, saw 214017 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 447 cols
[2022-05-15 20:23:07] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:23:07] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:23:08] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:23:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:23:09] [INFO ] After 609ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:23:09] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 20:23:09] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 447/447 places, 444/444 transitions.
Applied a total of 0 rules in 8 ms. Remains 447 /447 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 444/444 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 447/447 places, 444/444 transitions.
Applied a total of 0 rules in 8 ms. Remains 447 /447 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 447 cols
[2022-05-15 20:23:11] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:23:11] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 444 rows 447 cols
[2022-05-15 20:23:11] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:23:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:23:27] [INFO ] Implicit Places using invariants and state equation in 16145 ms returned [204, 211, 225, 230, 253]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 16522 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 442/447 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 442 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 440 transition count 442
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 440 transition count 442
Applied a total of 6 rules in 23 ms. Remains 440 /442 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 440 cols
[2022-05-15 20:23:27] [INFO ] Computed 75 place invariants in 45 ms
[2022-05-15 20:23:28] [INFO ] Implicit Places using invariants in 729 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 731 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 426/447 places, 442/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 426 transition count 434
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 434
Applied a total of 16 rules in 17 ms. Remains 418 /426 variables (removed 8) and now considering 434/442 (removed 8) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:23:28] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:23:28] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:23:28] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:23:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:23:44] [INFO ] Implicit Places using invariants and state equation in 15262 ms returned []
Implicit Place search using SMT with State Equation took 15536 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 418/447 places, 434/444 transitions.
Finished structural reductions, in 3 iterations. Remains : 418/447 places, 434/444 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13878 reset in 108 ms.
Product exploration explored 100000 steps with 13897 reset in 131 ms.
Built C files in :
/tmp/ltsmin7791814638490865512
[2022-05-15 20:23:44] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:23:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:23:44] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:23:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:23:44] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:23:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:23:44] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7791814638490865512
Running compilation step : cd /tmp/ltsmin7791814638490865512;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1153 ms.
Running link step : cd /tmp/ltsmin7791814638490865512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7791814638490865512;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2935511883994924939.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 16 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:23:59] [INFO ] Computed 99 place invariants in 57 ms
[2022-05-15 20:23:59] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:24:00] [INFO ] Computed 99 place invariants in 56 ms
[2022-05-15 20:24:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 20:24:26] [INFO ] Implicit Places using invariants and state equation in 26481 ms returned []
Implicit Place search using SMT with State Equation took 26817 ms to find 0 implicit places.
[2022-05-15 20:24:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:24:26] [INFO ] Computed 99 place invariants in 46 ms
[2022-05-15 20:24:26] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Built C files in :
/tmp/ltsmin17786887164107148317
[2022-05-15 20:24:26] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:24:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:24:26] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:24:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:24:26] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:24:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:24:26] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17786887164107148317
Running compilation step : cd /tmp/ltsmin17786887164107148317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1159 ms.
Running link step : cd /tmp/ltsmin17786887164107148317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17786887164107148317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7590360318574386255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:24:41] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:24:41] [INFO ] Flatten gal took : 15 ms
[2022-05-15 20:24:41] [INFO ] Time to serialize gal into /tmp/LTL10780916814213139597.gal : 3 ms
[2022-05-15 20:24:41] [INFO ] Time to serialize properties into /tmp/LTL10929182386878462628.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10780916814213139597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10929182386878462628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1078091...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(G("((p798<1)||(p894<1))")))))))
Formula 0 simplified : !XGXFG"((p798<1)||(p894<1))"
Detected timeout of ITS tools.
[2022-05-15 20:24:56] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:24:56] [INFO ] Applying decomposition
[2022-05-15 20:24:56] [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/graph9425882295748729584.txt' '-o' '/tmp/graph9425882295748729584.bin' '-w' '/tmp/graph9425882295748729584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9425882295748729584.bin' '-l' '-1' '-v' '-w' '/tmp/graph9425882295748729584.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:24:57] [INFO ] Decomposing Gal with order
[2022-05-15 20:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:24:57] [INFO ] Removed a total of 408 redundant transitions.
[2022-05-15 20:24:57] [INFO ] Flatten gal took : 32 ms
[2022-05-15 20:24:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2022-05-15 20:24:57] [INFO ] Time to serialize gal into /tmp/LTL8011272409644855613.gal : 5 ms
[2022-05-15 20:24:57] [INFO ] Time to serialize properties into /tmp/LTL8280787249575668462.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8011272409644855613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8280787249575668462.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8011272...245
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(G("((i9.u162.p798<1)||(i9.u180.p894<1))")))))))
Formula 0 simplified : !XGXFG"((i9.u162.p798<1)||(i9.u180.p894<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7505891777878204951
[2022-05-15 20:25:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7505891777878204951
Running compilation step : cd /tmp/ltsmin7505891777878204951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 821 ms.
Running link step : cd /tmp/ltsmin7505891777878204951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7505891777878204951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 359904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 483 place count 814 transition count 713
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 565 place count 773 transition count 713
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 929 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1005 place count 553 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1006 place count 552 transition count 530
Applied a total of 1006 rules in 73 ms. Remains 552 /1057 variables (removed 505) and now considering 530/997 (removed 467) transitions.
// Phase 1: matrix 530 rows 552 cols
[2022-05-15 20:25:27] [INFO ] Computed 99 place invariants in 48 ms
[2022-05-15 20:25:27] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 530 rows 552 cols
[2022-05-15 20:25:27] [INFO ] Computed 99 place invariants in 44 ms
[2022-05-15 20:25:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:25:37] [INFO ] Implicit Places using invariants and state equation in 10319 ms returned []
Implicit Place search using SMT with State Equation took 10619 ms to find 0 implicit places.
[2022-05-15 20:25:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 530 rows 552 cols
[2022-05-15 20:25:38] [INFO ] Computed 99 place invariants in 50 ms
[2022-05-15 20:25:38] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 552/1057 places, 530/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 552/1057 places, 530/997 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 11041 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&F(X((!(p1 U p2)&&!p0)))&&p3)))'
Support contains 7 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 36 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:25:38] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 20:25:38] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:25:38] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 20:25:55] [INFO ] Implicit Places using invariants and state equation in 16347 ms returned []
Implicit Place search using SMT with State Equation took 16745 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:25:55] [INFO ] Invariants computation overflowed in 125 ms
[2022-05-15 20:25:55] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, true, (NOT p0), (OR p0 p2), p2]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s370 1), p0:(AND (GEQ s908 1) (GEQ s924 1)), p2:(AND (GEQ s747 1) (GEQ s774 1)), p1:(AND (GEQ s584 1) (GEQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 17540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(G(p0))))))'
[2022-05-15 20:25:56] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin139600587000691547
[2022-05-15 20:25:56] [INFO ] Applying decomposition
[2022-05-15 20:25:56] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2022-05-15 20:25:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:25:56] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2022-05-15 20:25:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:25:56] [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/graph7335483623332056743.txt' '-o' '/tmp/graph7335483623332056743.bin' '-w' '/tmp/graph7335483623332056743.weights'
[2022-05-15 20:25:56] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7335483623332056743.bin' '-l' '-1' '-v' '-w' '/tmp/graph7335483623332056743.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:25:56] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:25:56] [INFO ] Decomposing Gal with order
[2022-05-15 20:25:56] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin139600587000691547
Running compilation step : cd /tmp/ltsmin139600587000691547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 20:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:25:56] [INFO ] Removed a total of 284 redundant transitions.
[2022-05-15 20:25:56] [INFO ] Flatten gal took : 48 ms
[2022-05-15 20:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2022-05-15 20:25:56] [INFO ] Time to serialize gal into /tmp/LTLFireability1965533388370917159.gal : 17 ms
[2022-05-15 20:25:56] [INFO ] Time to serialize properties into /tmp/LTLFireability9777202939395649906.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1965533388370917159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9777202939395649906.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(G("((i7.u249.p532<1)||(i7.u231.p538<1))"))))
Formula 0 simplified : !FG"((i7.u249.p532<1)||(i7.u231.p538<1))"
Compilation finished in 2728 ms.
Running link step : cd /tmp/ltsmin139600587000691547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin139600587000691547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 20:51:38] [INFO ] Flatten gal took : 73 ms
[2022-05-15 20:51:38] [INFO ] Time to serialize gal into /tmp/LTLFireability18324001907358955208.gal : 3 ms
[2022-05-15 20:51:38] [INFO ] Time to serialize properties into /tmp/LTLFireability14666447209601443141.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18324001907358955208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14666447209601443141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 2 LTL properties
Checking formula 0 : !((F(G("((p532<1)||(p538<1))"))))
Formula 0 simplified : !FG"((p532<1)||(p538<1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin139600587000691547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin139600587000691547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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