Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652782521717

Running Version 202205111006
[2022-05-17 10:15:22] [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-17 10:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:15:23] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-05-17 10:15:23] [INFO ] Transformed 834 places.
[2022-05-17 10:15:23] [INFO ] Transformed 1242 transitions.
[2022-05-17 10:15:23] [INFO ] Found NUPN structural information;
[2022-05-17 10:15:23] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 10:15:23] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-5-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 772 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:15:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:23] [INFO ] Computed 23 place invariants in 34 ms
[2022-05-17 10:15:23] [INFO ] Implicit Places using invariants in 351 ms returned []
[2022-05-17 10:15:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:23] [INFO ] Computed 23 place invariants in 18 ms
[2022-05-17 10:15:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:24] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2022-05-17 10:15:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:24] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 10:15:25] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Support contains 772 out of 834 places after structural reductions.
[2022-05-17 10:15:25] [INFO ] Flatten gal took : 122 ms
[2022-05-17 10:15:25] [INFO ] Flatten gal took : 86 ms
[2022-05-17 10:15:25] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 26) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-17 10:15:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:26] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:15:27] [INFO ] [Real]Absence check using 17 positive place invariants in 46 ms returned sat
[2022-05-17 10:15:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-17 10:15:27] [INFO ] After 309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-17 10:15:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:27] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:15:27] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:15:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 10:15:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 10:15:28] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:15:29] [INFO ] After 379ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 168 places in 314 ms of which 5 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 63 places in 364 ms of which 2 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 1 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 185 places in 304 ms of which 2 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 2 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 151 places in 267 ms of which 1 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 150 places in 273 ms of which 2 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 1 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 182 places in 278 ms of which 1 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 182 places in 274 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 86 places in 295 ms of which 1 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 86 places in 295 ms of which 2 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 142 places in 295 ms of which 1 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 1 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 56 places in 272 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 102 places in 253 ms of which 1 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 1 ms to minimize.
[2022-05-17 10:15:40] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 0 ms to minimize.
[2022-05-17 10:15:40] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2022-05-17 10:15:40] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 1 ms to minimize.
[2022-05-17 10:15:40] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 3 ms to minimize.
[2022-05-17 10:15:41] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 1 ms to minimize.
[2022-05-17 10:15:41] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 0 ms to minimize.
[2022-05-17 10:15:41] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 0 ms to minimize.
[2022-05-17 10:15:41] [INFO ] Deduced a trap composed of 119 places in 211 ms of which 0 ms to minimize.
[2022-05-17 10:15:42] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 1 ms to minimize.
[2022-05-17 10:15:42] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 0 ms to minimize.
[2022-05-17 10:15:42] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 1 ms to minimize.
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 0 ms to minimize.
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2022-05-17 10:15:43] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 1 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 1 ms to minimize.
[2022-05-17 10:15:44] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 0 ms to minimize.
[2022-05-17 10:15:45] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 0 ms to minimize.
[2022-05-17 10:15:45] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 1 ms to minimize.
[2022-05-17 10:15:45] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2022-05-17 10:15:46] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 1 ms to minimize.
[2022-05-17 10:15:46] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 1 ms to minimize.
[2022-05-17 10:15:46] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 1 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 1 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 0 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 0 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 98 places in 236 ms of which 1 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 0 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 2 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 2 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 128 places in 183 ms of which 3 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 21026 ms
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 122 places in 180 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 1 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1096 ms
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 1 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 1 ms to minimize.
[2022-05-17 10:15:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 10:15:53] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 87 ms.
Support contains 38 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 834 transition count 905
Reduce places removed 337 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 340 rules applied. Total rules applied 677 place count 497 transition count 902
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 680 place count 494 transition count 902
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 680 place count 494 transition count 719
Deduced a syphon composed of 183 places in 1 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1046 place count 311 transition count 719
Applied a total of 1046 rules in 89 ms. Remains 311 /834 variables (removed 523) and now considering 719/1242 (removed 523) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/834 places, 719/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 519134 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 519134 steps, saw 77807 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 8 properties.
[2022-05-17 10:15:56] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 311 cols
[2022-05-17 10:15:56] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:15:56] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 10:15:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:15:57] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:15:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:15:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:15:57] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:15:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:57] [INFO ] After 204ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:16:00] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-05-17 10:16:01] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:02] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:16:03] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 6613 ms
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:16:04] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 563 ms
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 523 ms
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1216 ms
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 535 ms
[2022-05-17 10:16:08] [INFO ] After 10521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 421 ms.
[2022-05-17 10:16:08] [INFO ] After 11355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 4 ms.
Support contains 38 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 719/719 transitions.
Applied a total of 0 rules in 24 ms. Remains 311 /311 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 719/719 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 719/719 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2022-05-17 10:16:08] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 311 cols
[2022-05-17 10:16:08] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:16:08] [INFO ] Implicit Places using invariants in 192 ms returned [275, 287, 288, 289, 290, 291]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 199 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 305/311 places, 719/719 transitions.
Applied a total of 0 rules in 18 ms. Remains 305 /305 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 305/311 places, 719/719 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 526365 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526365 steps, saw 78531 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 8 properties.
[2022-05-17 10:16:12] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 305 cols
[2022-05-17 10:16:12] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:16:12] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 10:16:13] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:16:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 10:16:13] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:16:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:13] [INFO ] After 202ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4186 ms
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2022-05-17 10:16:18] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1008 ms
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:16:19] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 521 ms
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:20] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:16:21] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:16:22] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:16:22] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1926 ms
[2022-05-17 10:16:22] [INFO ] After 8493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 280 ms.
[2022-05-17 10:16:22] [INFO ] After 9171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 3 ms.
Support contains 38 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 719/719 transitions.
Applied a total of 0 rules in 13 ms. Remains 305 /305 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 719/719 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 719/719 transitions.
Applied a total of 0 rules in 15 ms. Remains 305 /305 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2022-05-17 10:16:22] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 305 cols
[2022-05-17 10:16:22] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:22] [INFO ] Implicit Places using invariants in 170 ms returned []
[2022-05-17 10:16:22] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 305 cols
[2022-05-17 10:16:22] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:16:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:23] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2022-05-17 10:16:23] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-17 10:16:23] [INFO ] Flow matrix only has 599 transitions (discarded 120 similar events)
// Phase 1: matrix 599 rows 305 cols
[2022-05-17 10:16:23] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:23] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 719/719 transitions.
Graph (trivial) has 482 edges and 305 vertex of which 163 / 305 are part of one of the 30 SCC in 3 ms
Free SCC test removed 133 places
Drop transitions removed 266 transitions
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 386 transitions.
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 162 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 23 place count 162 transition count 318
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 35 rules applied. Total rules applied 58 place count 142 transition count 364
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 137 transition count 359
Graph (trivial) has 72 edges and 137 vertex of which 41 / 137 are part of one of the 5 SCC in 0 ms
Free SCC test removed 36 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 101 transition count 359
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 110 place count 101 transition count 318
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 170 place count 101 transition count 258
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 174 place count 101 transition count 254
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 178 place count 97 transition count 254
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 97 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 188 place count 92 transition count 249
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 194 place count 92 transition count 249
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 92 transition count 248
Applied a total of 195 rules in 61 ms. Remains 92 /305 variables (removed 213) and now considering 248/719 (removed 471) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 248 rows 92 cols
[2022-05-17 10:16:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 10:16:23] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 10:16:23] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-17 10:16:23] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:7
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 10:16:23] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:16:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 10:16:23] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:16:24] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-17 10:16:24] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:16:24] [INFO ] Flatten gal took : 11 ms
[2022-05-17 10:16:24] [INFO ] Flatten gal took : 9 ms
[2022-05-17 10:16:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17690450937681518267.gal : 5 ms
[2022-05-17 10:16:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16786772143255244659.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4912585287064863701;'/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/ReachabilityCardinality17690450937681518267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16786772143255244659.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16786772143255244659.prop.
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,7 properties remain. new max is 2
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :5 after 7
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 2650
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :2650 after 98000
Reachability property AtomicPropp25 is true.
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :98000 after 570960
Reachability property AtomicPropp20 is true.
Reachability property AtomicPropp18 is true.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :570960 after 3.762e+07
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.762e+07 after 8.4237e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8.4237e+07 after 8.5141e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8.5141e+07 after 8.72988e+07
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.72988e+07 after 4.56958e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :4.56958e+08 after 6.67978e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6.67978e+08 after 7.00964e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.00964e+08 after 1.55311e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.05159e+09,3.54816,96316,2,5278,25,438868,9,0,622,308100,0
Total reachable state count : 6051594240

Verifying 8 reachability properties.
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,2.50823e+08,3.55104,96316,2,2626,25,438868,10,0,656,308100,0
Reachability property AtomicPropp14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp14,2.50823e+08,3.55199,96316,2,2626,25,438868,10,0,657,308100,0
Reachability property AtomicPropp18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,2.66112e+06,3.55243,96316,2,892,25,438868,11,0,659,308100,0
Reachability property AtomicPropp19 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp19,9.05748e+07,3.55335,96316,2,2824,25,438868,12,0,661,308100,0
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,38880,3.55416,96316,2,333,25,438868,13,0,666,308100,0
Reachability property AtomicPropp22 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp22,4.45907e+08,3.55528,96316,2,3631,25,438868,13,0,667,308100,0
Reachability property AtomicPropp23 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp23,3.82206e+08,3.55619,96316,2,2885,25,438868,13,0,668,308100,0
Reachability property AtomicPropp25 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp25,172800,3.55654,96316,2,333,25,438868,14,0,670,308100,0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(X(p0) U p1)||F(p2)))))'
Support contains 162 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:28] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:16:28] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-05-17 10:16:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:28] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:16:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:30] [INFO ] Implicit Places using invariants and state equation in 2484 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2022-05-17 10:16:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:30] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:16:31] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1 0) (EQ s131 0) (EQ s66 0) (EQ s5 0) (EQ s135 0) (EQ s70 0) (EQ s139 0) (EQ s9 0) (EQ s74 0) (EQ s13 0) (EQ s78 0) (EQ s17 0) (EQ s82 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 936 ms.
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p1) p0)
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-5-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-00 finished in 5688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(G(!p1)))))'
Support contains 36 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 28 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:33] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 10:16:34] [INFO ] Implicit Places using invariants in 293 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 295 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 90 ms :[p1, p1, true]
Running random walk in product with property : Peterson-PT-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s213 1) (EQ s219 1) (EQ s218 1) (EQ s217 1) (EQ s191 1) (EQ s220 1)), p0:(OR (EQ s142 1) (EQ s143 1) (EQ s146 1) (EQ s147 1) (EQ s144 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 176 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-01 finished in 449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 56 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 10:16:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 10:16:34] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 10:16:34] [INFO ] Implicit Places using invariants in 142 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 143 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s221 1) (EQ s255 1)) (AND (EQ s220 1) (EQ s249 1)) (AND (EQ s208 1) (EQ s223 1)) (AND (EQ s192 1) (EQ s224 1)) (AND (EQ s219 1) (EQ s239 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]]
Product exploration explored 100000 steps with 12458 reset in 664 ms.
Stack based approach found an accepted trace after 183 steps with 19 reset with depth 11 and stack size 11 in 2 ms.
FORMULA Peterson-PT-5-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-02 finished in 932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||X(X((G(F(p1))&&p2)))))'
Support contains 336 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:35] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:16:35] [INFO ] Implicit Places using invariants in 274 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 276 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 610 ms :[(NOT p1), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p0) p2) (AND p1 (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 9}, { cond=(NOT p2), acceptance={} source=4 dest: 10}, { cond=p2, acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(NOT p1), acceptance={} source=10 dest: 8}, { cond=true, acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 9}, { cond=true, acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(OR (EQ s261 1) (EQ s326 1) (EQ s257 1) (EQ s322 1) (EQ s269 1) (EQ s334 1) (EQ s265 1) (EQ s330 1) (EQ s277 1) (EQ s407 1) (EQ s208 1) (EQ s342 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2345 reset in 273 ms.
Stack based approach found an accepted trace after 112 steps with 4 reset with depth 105 and stack size 105 in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-03 finished in 1210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!F(p0))) U G(p1)))'
Support contains 66 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:36] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:36] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:16:36] [INFO ] Implicit Places using invariants in 274 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 278 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (AND (EQ s607 1) (EQ s805 1)) (AND (EQ s534 1) (EQ s810 1)) (AND (EQ s606 1) (EQ s799 1)) (AND (EQ s611 1) (EQ s803 1)) (AND (EQ s522 1) (EQ s...], 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]]
Entered a terminal (fully accepting) state of product in 21 steps with 6 reset in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-04 finished in 543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(X(G(p0)) U G(F(G(!p0)))))))'
Support contains 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 40 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2022-05-17 10:16:36] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2022-05-17 10:16:36] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:16:37] [INFO ] Implicit Places using invariants in 181 ms returned [268, 288, 289, 290, 291, 292]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 183 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s159 1) (EQ s158 1) (EQ s157 1) (EQ s156 1) (EQ s163 1) (EQ s162 1) (EQ s161 1) (EQ s160 1) (EQ s167 1) (EQ s166 1) (EQ s165 1) (EQ s164 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8493 reset in 299 ms.
Stack based approach found an accepted trace after 52 steps with 3 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-05 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&X(F(p1))))'
Support contains 162 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:37] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 10:16:37] [INFO ] Implicit Places using invariants in 240 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 242 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (EQ s403 1) (EQ s561 1)) (AND (EQ s404 1) (EQ s502 1)) (AND (EQ s397 1) (EQ s469 1)) (AND (EQ s399 1) (EQ s440 1)) (AND (EQ s404 1) (EQ s506 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 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-06 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X((X(p1)&&F(p1))) U G(!F(p1))))||p0)))'
Support contains 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 35 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 10:16:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 10:16:37] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:16:38] [INFO ] Implicit Places using invariants in 142 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 143 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (EQ s215 1) (EQ s240 1)) (AND (EQ s206 1) (EQ s245 1)) (AND (EQ s214 1) (EQ s234 1)) (AND (EQ s219 1) (EQ s238 1)) (AND (EQ s196 1) (EQ s224 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20884 reset in 478 ms.
Product exploration explored 100000 steps with 20980 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:16:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 10:16:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:16:39] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-5-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-07 finished in 1748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:39] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:39] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:16:39] [INFO ] Implicit Places using invariants in 286 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 287 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s535 1) (EQ s816 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-08 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(p1)||(p2 U p3)))))'
Support contains 7 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:40] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:40] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:16:40] [INFO ] Implicit Places using invariants in 287 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 288 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p3), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true]
Running random walk in product with property : Peterson-PT-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p3:(AND (EQ s535 1) (EQ s810 1)), p2:(AND (EQ s399 1) (EQ s775 1)), p0:(EQ s761 0), p1:(AND (EQ s774 1) (EQ s804 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLFireability-09 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&G(F(p1))))))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 834 transition count 887
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 479 transition count 886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 180 Pre rules applied. Total rules applied 712 place count 478 transition count 706
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1072 place count 298 transition count 706
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1132 place count 268 transition count 676
Applied a total of 1132 rules in 29 ms. Remains 268 /834 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
[2022-05-17 10:16:40] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2022-05-17 10:16:40] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:16:41] [INFO ] Implicit Places using invariants in 166 ms returned [232, 244, 245, 246, 247, 248]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 167 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/834 places, 676/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 262/834 places, 676/1242 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s224 1), p1:(EQ s225 0)], 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 0 reset in 166 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA Peterson-PT-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-10 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:41] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:16:41] [INFO ] Implicit Places using invariants in 283 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 285 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Peterson-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s404 1) (NEQ s823 1)), p0:(OR (EQ s391 0) (EQ s472 0))], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 658413 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 658413 steps, saw 265252 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:16:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:16:45] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:45] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 10:16:46] [INFO ] After 292ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:16:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:46] [INFO ] After 77ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:16:46] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:16:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 10:16:46] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:16:46] [INFO ] After 70ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:16:46] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 1 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:16:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 840 ms
[2022-05-17 10:16:47] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-17 10:16:47] [INFO ] After 1468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 828 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 828 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 469 transition count 883
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 718 place count 469 transition count 703
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1078 place count 289 transition count 703
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1138 place count 259 transition count 673
Applied a total of 1138 rules in 26 ms. Remains 259 /828 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/828 places, 673/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1344686 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1344686 steps, saw 193662 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:16:50] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:16:50] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:50] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:16:50] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:16:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:16:51] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:16:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:51] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:16:51] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:51] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:16:51] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2022-05-17 10:16:51] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:16:51] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2022-05-17 10:16:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 498 ms
[2022-05-17 10:16:51] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 10:16:51] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 6 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:16:51] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:16:51] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:16:51] [INFO ] Implicit Places using invariants in 166 ms returned []
[2022-05-17 10:16:51] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:16:51] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:16:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:52] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2022-05-17 10:16:52] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 10:16:52] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:16:52] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:16:52] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 176 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 146 places
Drop transitions removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 113 transition count 203
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 84 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 81 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 122 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 245 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 25 transition count 39
Applied a total of 251 rules in 12 ms. Remains 25 /259 variables (removed 234) and now considering 39/673 (removed 634) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2022-05-17 10:16:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 10:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 10:16:52] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:16:52] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:16:52] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 10:16:52] [INFO ] Flatten gal took : 7 ms
[2022-05-17 10:16:52] [INFO ] Flatten gal took : 2 ms
[2022-05-17 10:16:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14430666690861243373.gal : 1 ms
[2022-05-17 10:16:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7458273044522262619.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16113740563785624954;'/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/ReachabilityCardinality14430666690861243373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7458273044522262619.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/ReachabilityCardinality7458273044522262619.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.012646,3816,2,29,6,154,6,0,142,94,0
Total reachable state count : 8

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.012989,4256,2,28,6,154,7,0,148,94,0
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 828 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:16:53] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:53] [INFO ] Implicit Places using invariants in 274 ms returned []
[2022-05-17 10:16:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:16:53] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:16:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:56] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
[2022-05-17 10:16:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:16:56] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:16:56] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665154 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665154 steps, saw 266606 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:16:59] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:16:59] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-17 10:16:59] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 10:17:00] [INFO ] After 318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:17:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:00] [INFO ] After 80ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:17:00] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:17:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 10:17:00] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:17:00] [INFO ] After 69ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:17:01] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 1 ms to minimize.
[2022-05-17 10:17:01] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 1 ms to minimize.
[2022-05-17 10:17:01] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 1 ms to minimize.
[2022-05-17 10:17:01] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 1 ms to minimize.
[2022-05-17 10:17:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 852 ms
[2022-05-17 10:17:01] [INFO ] After 954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-17 10:17:01] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 828 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 828 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 469 transition count 883
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 718 place count 469 transition count 703
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1078 place count 289 transition count 703
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1138 place count 259 transition count 673
Applied a total of 1138 rules in 32 ms. Remains 259 /828 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/828 places, 673/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1364783 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1364783 steps, saw 197479 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:17:04] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:17:04] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:17:04] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:17:05] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:17:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:17:05] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:17:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:05] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:17:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 471 ms
[2022-05-17 10:17:05] [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 20 ms.
[2022-05-17 10:17:05] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 6 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:17:05] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:17:05] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:17:06] [INFO ] Implicit Places using invariants in 159 ms returned []
[2022-05-17 10:17:06] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:17:06] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:06] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2022-05-17 10:17:06] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 10:17:06] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:17:06] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:17:06] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 176 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 146 places
Drop transitions removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 113 transition count 203
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 84 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 81 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 122 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 245 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 25 transition count 39
Applied a total of 251 rules in 10 ms. Remains 25 /259 variables (removed 234) and now considering 39/673 (removed 634) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2022-05-17 10:17:06] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 10:17:06] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 10:17:06] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:17:06] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 10:17:06] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 10:17:06] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:17:06] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:17:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13884348577936590799.gal : 0 ms
[2022-05-17 10:17:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7986306347324399381.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4884851835340377193;'/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/ReachabilityCardinality13884348577936590799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7986306347324399381.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/ReachabilityCardinality7986306347324399381.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.005737,3812,2,29,6,154,6,0,142,94,0
Total reachable state count : 8

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.006097,4252,2,28,6,154,7,0,148,94,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 216 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 828 transition count 1242
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 156 Pre rules applied. Total rules applied 210 place count 828 transition count 1341
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 366 place count 828 transition count 1341
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 472 place count 722 transition count 1235
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 578 place count 722 transition count 1235
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 463 places in 0 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 781 place count 722 transition count 1235
Discarding 178 places :
Symmetric choice reduction at 1 with 178 rule applications. Total rules 959 place count 544 transition count 1057
Deduced a syphon composed of 285 places in 1 ms
Iterating global reduction 1 with 178 rules applied. Total rules applied 1137 place count 544 transition count 1057
Deduced a syphon composed of 285 places in 1 ms
Applied a total of 1137 rules in 118 ms. Remains 544 /828 variables (removed 284) and now considering 1057/1242 (removed 185) transitions.
[2022-05-17 10:17:08] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 10:17:08] [INFO ] Flow matrix only has 937 transitions (discarded 120 similar events)
// Phase 1: matrix 937 rows 544 cols
[2022-05-17 10:17:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:17:08] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 544/828 places, 1057/1242 transitions.
Finished structural reductions, in 1 iterations. Remains : 544/828 places, 1057/1242 transitions.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 279 ms.
Built C files in :
/tmp/ltsmin2775534596172680594
[2022-05-17 10:17:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2775534596172680594
Running compilation step : cd /tmp/ltsmin2775534596172680594;'/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 2067 ms.
Running link step : cd /tmp/ltsmin2775534596172680594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2775534596172680594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17842742513104827790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:17:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:17:24] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-17 10:17:24] [INFO ] Implicit Places using invariants in 303 ms returned []
[2022-05-17 10:17:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:17:24] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:17:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:26] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 2708 ms to find 0 implicit places.
[2022-05-17 10:17:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2022-05-17 10:17:26] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-17 10:17:27] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 828/828 places, 1242/1242 transitions.
Built C files in :
/tmp/ltsmin13901579111454794918
[2022-05-17 10:17:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13901579111454794918
Running compilation step : cd /tmp/ltsmin13901579111454794918;'/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 2019 ms.
Running link step : cd /tmp/ltsmin13901579111454794918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13901579111454794918;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7857280930890060413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 10:17:42] [INFO ] Flatten gal took : 68 ms
[2022-05-17 10:17:42] [INFO ] Flatten gal took : 56 ms
[2022-05-17 10:17:42] [INFO ] Time to serialize gal into /tmp/LTL2046324965803651747.gal : 7 ms
[2022-05-17 10:17:42] [INFO ] Time to serialize properties into /tmp/LTL6278498788602119033.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/LTL2046324965803651747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6278498788602119033.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/LTL2046324...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((WantSection_1_F==0)||(TestAlone_3_4_1==0))"))))&&(F("((WantSection_3_T==0)||(CS_3==0))"))))
Formula 0 simplified : !(XXG"((WantSection_1_F==0)||(TestAlone_3_4_1==0))" & F"((WantSection_3_T==0)||(CS_3==0))")
Detected timeout of ITS tools.
[2022-05-17 10:17:57] [INFO ] Flatten gal took : 39 ms
[2022-05-17 10:17:57] [INFO ] Applying decomposition
[2022-05-17 10:17:57] [INFO ] Flatten gal took : 48 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/graph672798239185977605.txt' '-o' '/tmp/graph672798239185977605.bin' '-w' '/tmp/graph672798239185977605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph672798239185977605.bin' '-l' '-1' '-v' '-w' '/tmp/graph672798239185977605.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:17:58] [INFO ] Decomposing Gal with order
[2022-05-17 10:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:17:58] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:17:58] [INFO ] Flatten gal took : 378 ms
[2022-05-17 10:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-17 10:17:58] [INFO ] Time to serialize gal into /tmp/LTL4522341363880789816.gal : 46 ms
[2022-05-17 10:17:58] [INFO ] Time to serialize properties into /tmp/LTL575309254393107816.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/LTL4522341363880789816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL575309254393107816.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/LTL4522341...244
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((i0.u177.WantSection_1_F==0)||(i19.u116.TestAlone_3_4_1==0))"))))&&(F("((i6.u182.WantSection_3_T==0)||(i30.u253.CS_3==0))"...159
Formula 0 simplified : !(XXG"((i0.u177.WantSection_1_F==0)||(i19.u116.TestAlone_3_4_1==0))" & F"((i6.u182.WantSection_3_T==0)||(i30.u253.CS_3==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12399790034202404304
[2022-05-17 10:18:13] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12399790034202404304
Running compilation step : cd /tmp/ltsmin12399790034202404304;'/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 2013 ms.
Running link step : cd /tmp/ltsmin12399790034202404304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12399790034202404304;'/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))))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-5-LTLFireability-11 finished in 107525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(p1))))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:18:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:18:28] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:18:29] [INFO ] Implicit Places using invariants in 298 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 299 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, true]
Running random walk in product with property : Peterson-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s399 1) (EQ s775 1)), p1:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 443 ms.
Product exploration explored 100000 steps with 33333 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-5-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLFireability-12 finished in 1461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X((X(X(p0))||F(p1)))||p2))))))'
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:18:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:18:30] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:18:30] [INFO ] Implicit Places using invariants in 290 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 291 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 1}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s325 1), p1:(EQ s220 1), p0:(EQ s706 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 175 reset in 187 ms.
Stack based approach found an accepted trace after 2711 steps with 7 reset with depth 228 and stack size 228 in 5 ms.
FORMULA Peterson-PT-5-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLFireability-14 finished in 901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Found a SL insensitive property : Peterson-PT-5-LTLFireability-11
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 834 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 179 Pre rules applied. Total rules applied 718 place count 475 transition count 704
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 29 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2022-05-17 10:18:31] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2022-05-17 10:18:31] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:18:31] [INFO ] Implicit Places using invariants in 163 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 164 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 260/834 places, 674/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/834 places, 674/1242 transitions.
Running random walk in product with property : Peterson-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s191 1) (NEQ s259 1)), p0:(OR (EQ s182 0) (EQ s192 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1373918 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1373918 steps, saw 198435 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:18:35] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:35] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:18:35] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:35] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:18:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:35] [INFO ] After 37ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:35] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:18:35] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:35] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:35] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:18:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:18:35] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2022-05-17 10:18:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 784 ms
[2022-05-17 10:18:36] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 10:18:36] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 260/260 places, 674/674 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 260 transition count 673
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 259 transition count 673
Applied a total of 2 rules in 12 ms. Remains 259 /260 variables (removed 1) and now considering 673/674 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/260 places, 673/674 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1372756 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1372756 steps, saw 198444 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:18:39] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:39] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:18:39] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:39] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:39] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:39] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:18:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 531 ms
[2022-05-17 10:18:40] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 10:18:40] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 12 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:18:40] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:40] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:18:40] [INFO ] Implicit Places using invariants in 166 ms returned []
[2022-05-17 10:18:40] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:40] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:41] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2022-05-17 10:18:41] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 10:18:41] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:41] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:41] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 176 / 259 are part of one of the 30 SCC in 1 ms
Free SCC test removed 146 places
Drop transitions removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 113 transition count 203
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 84 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 81 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 122 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 245 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 25 transition count 39
Applied a total of 251 rules in 8 ms. Remains 25 /259 variables (removed 234) and now considering 39/673 (removed 634) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2022-05-17 10:18:41] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 10:18:41] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 10:18:41] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:18:41] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:18:41] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 10:18:41] [INFO ] Flatten gal took : 2 ms
[2022-05-17 10:18:41] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:18:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9515459878231389783.gal : 1 ms
[2022-05-17 10:18:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2417365110184998219.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9765819715132086222;'/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/ReachabilityCardinality9515459878231389783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2417365110184998219.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2417365110184998219.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.011775,3812,2,29,6,154,6,0,142,94,0
Total reachable state count : 8

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.012223,4252,2,28,6,154,7,0,148,94,0
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 260 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 6 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-05-17 10:18:42] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:42] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:18:42] [INFO ] Implicit Places using invariants in 166 ms returned []
[2022-05-17 10:18:42] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:43] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2022-05-17 10:18:43] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:43] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:18:43] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1376305 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :{}
Probabilistic random walk after 1376305 steps, saw 198765 distinct states, run finished after 3001 ms. (steps per millisecond=458 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:18:46] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:46] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:46] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:18:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:46] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:46] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:46] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:47] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:18:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 767 ms
[2022-05-17 10:18:47] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 10:18:47] [INFO ] After 1027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 260/260 places, 674/674 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 260 transition count 673
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 259 transition count 673
Applied a total of 2 rules in 10 ms. Remains 259 /260 variables (removed 1) and now considering 673/674 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/260 places, 673/674 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1375192 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :{}
Probabilistic random walk after 1375192 steps, saw 198798 distinct states, run finished after 3001 ms. (steps per millisecond=458 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 10:18:50] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:50] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:50] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:51] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:18:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 10:18:51] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:51] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:18:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 537 ms
[2022-05-17 10:18:51] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 10:18:51] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 6 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2022-05-17 10:18:51] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:52] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-17 10:18:52] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:52] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:18:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:52] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2022-05-17 10:18:52] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 10:18:52] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2022-05-17 10:18:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 176 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 146 places
Drop transitions removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 113 transition count 203
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 84 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 81 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 35 rules applied. Total rules applied 122 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 3 with 123 rules applied. Total rules applied 245 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 25 transition count 39
Applied a total of 251 rules in 9 ms. Remains 25 /259 variables (removed 234) and now considering 39/673 (removed 634) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2022-05-17 10:18:52] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 10:18:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 10:18:52] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 10:18:52] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:18:52] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 10:18:52] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:18:52] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:18:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8493292569107233291.gal : 0 ms
[2022-05-17 10:18:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2444398976718914449.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms64628108674293922;'/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/ReachabilityCardinality8493292569107233291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2444398976718914449.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2444398976718914449.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.00916,3812,2,29,6,154,6,0,142,94,0
Total reachable state count : 8

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.009769,4252,2,28,6,154,7,0,148,94,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 181 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 674/674 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 260 transition count 674
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 674
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 15 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-05-17 10:18:54] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 10:18:54] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:18:54] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:18:54] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/260 places, 674/674 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Built C files in :
/tmp/ltsmin12367733527033569478
[2022-05-17 10:18:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12367733527033569478
Running compilation step : cd /tmp/ltsmin12367733527033569478;'/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 973 ms.
Running link step : cd /tmp/ltsmin12367733527033569478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12367733527033569478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3816536171824965348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-05-17 10:19:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:19:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:19:09] [INFO ] Implicit Places using invariants in 175 ms returned []
[2022-05-17 10:19:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:19:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:19:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:19:10] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2022-05-17 10:19:10] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-05-17 10:19:10] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:19:10] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Built C files in :
/tmp/ltsmin15826975221521046573
[2022-05-17 10:19:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15826975221521046573
Running compilation step : cd /tmp/ltsmin15826975221521046573;'/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 929 ms.
Running link step : cd /tmp/ltsmin15826975221521046573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15826975221521046573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2066605234041472416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 10:19:26] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:19:26] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:19:26] [INFO ] Time to serialize gal into /tmp/LTL12753505794190686541.gal : 2 ms
[2022-05-17 10:19:26] [INFO ] Time to serialize properties into /tmp/LTL14269219403853751190.ltl : 39 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/LTL12753505794190686541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14269219403853751190.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/LTL1275350...268
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((WantSection_1_F==0)||(TestAlone_3_4_1==0))"))))&&(F("((WantSection_3_T==0)||(CS_3==0))"))))
Formula 0 simplified : !(XXG"((WantSection_1_F==0)||(TestAlone_3_4_1==0))" & F"((WantSection_3_T==0)||(CS_3==0))")
Detected timeout of ITS tools.
[2022-05-17 10:19:41] [INFO ] Flatten gal took : 21 ms
[2022-05-17 10:19:41] [INFO ] Applying decomposition
[2022-05-17 10:19:41] [INFO ] Flatten gal took : 19 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/graph2466955875613633178.txt' '-o' '/tmp/graph2466955875613633178.bin' '-w' '/tmp/graph2466955875613633178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2466955875613633178.bin' '-l' '-1' '-v' '-w' '/tmp/graph2466955875613633178.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:19:41] [INFO ] Decomposing Gal with order
[2022-05-17 10:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:19:41] [INFO ] Removed a total of 914 redundant transitions.
[2022-05-17 10:19:41] [INFO ] Flatten gal took : 75 ms
[2022-05-17 10:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 16 ms.
[2022-05-17 10:19:41] [INFO ] Time to serialize gal into /tmp/LTL2521747879547661628.gal : 5 ms
[2022-05-17 10:19:41] [INFO ] Time to serialize properties into /tmp/LTL13907282335053212930.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/LTL2521747879547661628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13907282335053212930.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/LTL2521747...246
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((i12.u22.WantSection_1_F==0)||(i11.u0.TestAlone_3_4_1==0))"))))&&(F("((i3.u19.WantSection_3_T==0)||(i11.u18.CS_3==0))"))))
Formula 0 simplified : !(XXG"((i12.u22.WantSection_1_F==0)||(i11.u0.TestAlone_3_4_1==0))" & F"((i3.u19.WantSection_3_T==0)||(i11.u18.CS_3==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6127649509669041486
[2022-05-17 10:19:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6127649509669041486
Running compilation step : cd /tmp/ltsmin6127649509669041486;'/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 966 ms.
Running link step : cd /tmp/ltsmin6127649509669041486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6127649509669041486;'/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))))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-5-LTLFireability-11 finished in 100304 ms.
[2022-05-17 10:20:11] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5504812084923648606
[2022-05-17 10:20:11] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2022-05-17 10:20:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:20:11] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2022-05-17 10:20:11] [INFO ] Applying decomposition
[2022-05-17 10:20:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:20:11] [INFO ] Flatten gal took : 29 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/graph6499419611288305023.txt' '-o' '/tmp/graph6499419611288305023.bin' '-w' '/tmp/graph6499419611288305023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6499419611288305023.bin' '-l' '-1' '-v' '-w' '/tmp/graph6499419611288305023.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:20:11] [INFO ] Decomposing Gal with order
[2022-05-17 10:20:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:20:11] [INFO ] Removed a total of 1033 redundant transitions.
[2022-05-17 10:20:11] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2022-05-17 10:20:11] [INFO ] Flatten gal took : 53 ms
[2022-05-17 10:20:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 10:20:11] [INFO ] Time to serialize gal into /tmp/LTLFireability9244083221290461141.gal : 8 ms
[2022-05-17 10:20:11] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:20:11] [INFO ] Time to serialize properties into /tmp/LTLFireability77657986598842130.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/LTLFireability9244083221290461141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability77657986598842130.ltl' '-c' '-stutter-deadlock'
[2022-05-17 10:20:11] [INFO ] Built C files in 253ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5504812084923648606
Running compilation step : cd /tmp/ltsmin5504812084923648606;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'

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...265
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((i24.i3.u5.WantSection_1_F==0)||(i32.i0.u181.TestAlone_3_4_1==0))"))))&&(F("((i22.u218.WantSection_3_T!=1)||(i26.u145.CS_3...165
Formula 0 simplified : !(XXG"((i24.i3.u5.WantSection_1_F==0)||(i32.i0.u181.TestAlone_3_4_1==0))" & F"((i22.u218.WantSection_3_T!=1)||(i26.u145.CS_3!=1))")
Compilation finished in 3773 ms.
Running link step : cd /tmp/ltsmin5504812084923648606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin5504812084923648606;'/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))))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 10:41:52] [INFO ] Applying decomposition
[2022-05-17 10:41:53] [INFO ] Flatten gal took : 279 ms
[2022-05-17 10:41:53] [INFO ] Decomposing Gal with order
[2022-05-17 10:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:41:54] [INFO ] Removed a total of 771 redundant transitions.
[2022-05-17 10:41:54] [INFO ] Flatten gal took : 793 ms
[2022-05-17 10:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 60 ms.
[2022-05-17 10:41:54] [INFO ] Time to serialize gal into /tmp/LTLFireability16405605488217333913.gal : 41 ms
[2022-05-17 10:41:54] [INFO ] Time to serialize properties into /tmp/LTLFireability14523955414706809829.ltl : 3 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/LTLFireability16405605488217333913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14523955414706809829.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...269
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("((u15.WantSection_1_F==0)||(u2.TestAlone_3_4_1==0))"))))&&(F("((u13.WantSection_3_T!=1)||(u2.CS_3!=1))"))))
Formula 0 simplified : !(XXG"((u15.WantSection_1_F==0)||(u2.TestAlone_3_4_1==0))" & F"((u13.WantSection_3_T!=1)||(u2.CS_3!=1))")
Detected timeout of ITS tools.
[2022-05-17 11:03:31] [INFO ] Flatten gal took : 198 ms
[2022-05-17 11:03:34] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 11:03:34] [INFO ] Transformed 834 places.
[2022-05-17 11:03:34] [INFO ] Transformed 1242 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 11:03:34] [INFO ] Time to serialize gal into /tmp/LTLFireability7133073631749778837.gal : 18 ms
[2022-05-17 11:03:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15849053538533919312.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/LTLFireability7133073631749778837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15849053538533919312.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(X(G("((WantSection_1_F==0)||(TestAlone_3_4_1==0))"))))&&(F("((WantSection_3_T!=1)||(CS_3!=1))"))))
Formula 0 simplified : !(XXG"((WantSection_1_F==0)||(TestAlone_3_4_1==0))" & F"((WantSection_3_T!=1)||(CS_3!=1))")

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="Peterson-PT-5"
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 Peterson-PT-5, 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 r168-tall-165277016200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "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 ;