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.r175-tall-165277024500477.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 PolyORBNT-COL-S05J80, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277024500477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 9.3K Apr 30 03:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 03:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652812393531

Running Version 202205111006
[2022-05-17 18:33:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2022-05-17 18:33:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:33:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 18:33:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:33:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2022-05-17 18:33:15] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 33 ms.
[2022-05-17 18:33:15] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 55 ms.
[2022-05-17 18:33:15] [INFO ] Unfolded 38 HLPN properties in 6 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:33:15] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-17 18:33:15] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-17 18:33:15] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 80 places in 13 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 712 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2022-05-17 18:33:16] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2022-05-17 18:33:16] [INFO ] Computed 182 place invariants in 196 ms
[2022-05-17 18:33:16] [INFO ] [Real]Absence check using 175 positive place invariants in 61 ms returned sat
[2022-05-17 18:33:16] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-17 18:33:17] [INFO ] After 1004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:17] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2022-05-17 18:33:17] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 18:33:21] [INFO ] After 3656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:23] [INFO ] After 1986ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:23] [INFO ] After 2123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-17 18:33:23] [INFO ] After 6114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 395 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2022-05-17 18:33:24] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2022-05-17 18:33:24] [INFO ] Computed 177 place invariants in 148 ms
[2022-05-17 18:33:25] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 55 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1189 places, 1426/1695 transitions.
Incomplete random walk after 1000000 steps, including 52091 resets, run finished after 6704 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2684 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2230858 steps, run timeout after 24001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 2230858 steps, saw 696239 distinct states, run finished after 24004 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:57] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:33:57] [INFO ] Computed 177 place invariants in 37 ms
[2022-05-17 18:33:57] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2022-05-17 18:33:57] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 31 ms returned sat
[2022-05-17 18:33:58] [INFO ] After 748ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:58] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2022-05-17 18:33:58] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:33:59] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:59] [INFO ] After 189ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:59] [INFO ] Deduced a trap composed of 326 places in 347 ms of which 2 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 330 places in 342 ms of which 1 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 309 places in 317 ms of which 2 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 335 places in 327 ms of which 1 ms to minimize.
[2022-05-17 18:34:01] [INFO ] Deduced a trap composed of 318 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:34:01] [INFO ] Deduced a trap composed of 338 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 315 places in 343 ms of which 1 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 333 places in 324 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 329 places in 318 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 312 places in 319 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 311 places in 325 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 335 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 323 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 320 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 278 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 305 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 344 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 323 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 0 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 323 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 299 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 4 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 332 places in 318 ms of which 1 ms to minimize.
[2022-05-17 18:34:16] [INFO ] Deduced a trap composed of 335 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:34:18] [INFO ] Deduced a trap composed of 323 places in 308 ms of which 0 ms to minimize.
[2022-05-17 18:34:19] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:19] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:20] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:20] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:21] [INFO ] Deduced a trap composed of 341 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:34:23] [INFO ] Deduced a trap composed of 329 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:23] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 0 ms to minimize.
[2022-05-17 18:34:24] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:34:24] [INFO ] Deduced a trap composed of 335 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:25] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:25] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:34:26] [INFO ] Deduced a trap composed of 317 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:34:26] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 0 ms to minimize.
[2022-05-17 18:34:27] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:27] [INFO ] Deduced a trap composed of 305 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:28] [INFO ] Deduced a trap composed of 332 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 3 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 341 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 317 places in 307 ms of which 3 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 338 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 0 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 332 places in 311 ms of which 2 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Deduced a trap composed of 347 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:34:43] [INFO ] Deduced a trap composed of 323 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:34:49] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:34:52] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:34:53] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:34:54] [INFO ] Deduced a trap composed of 317 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:34:54] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 323 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 332 places in 307 ms of which 0 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 0 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 311 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:35:17] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:35:18] [INFO ] Deduced a trap composed of 341 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:35:18] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 88634 ms
[2022-05-17 18:35:28] [INFO ] After 89027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:28] [INFO ] After 89714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 79 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 38 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2022-05-17 18:35:28] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:35:28] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-17 18:35:29] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2022-05-17 18:35:29] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:35:29] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-17 18:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:35:36] [INFO ] Implicit Places using invariants and state equation in 6682 ms returned []
Implicit Place search using SMT with State Equation took 8092 ms to find 0 implicit places.
[2022-05-17 18:35:36] [INFO ] Redundant transitions in 78 ms returned []
[2022-05-17 18:35:36] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:35:36] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-17 18:35:37] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5195 resets, run finished after 714 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:35:38] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:35:38] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-17 18:35:38] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2022-05-17 18:35:38] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:35:38] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:39] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2022-05-17 18:35:39] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:35:39] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:35:39] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:40] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 1 ms to minimize.
[2022-05-17 18:35:40] [INFO ] Deduced a trap composed of 330 places in 320 ms of which 1 ms to minimize.
[2022-05-17 18:35:40] [INFO ] Deduced a trap composed of 309 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:35:41] [INFO ] Deduced a trap composed of 335 places in 318 ms of which 1 ms to minimize.
[2022-05-17 18:35:41] [INFO ] Deduced a trap composed of 318 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:35:42] [INFO ] Deduced a trap composed of 338 places in 319 ms of which 1 ms to minimize.
[2022-05-17 18:35:42] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:35:42] [INFO ] Deduced a trap composed of 315 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:35:43] [INFO ] Deduced a trap composed of 333 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:35:43] [INFO ] Deduced a trap composed of 329 places in 319 ms of which 0 ms to minimize.
[2022-05-17 18:35:44] [INFO ] Deduced a trap composed of 312 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:35:44] [INFO ] Deduced a trap composed of 311 places in 320 ms of which 1 ms to minimize.
[2022-05-17 18:35:46] [INFO ] Deduced a trap composed of 335 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:35:46] [INFO ] Deduced a trap composed of 326 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:35:46] [INFO ] Deduced a trap composed of 323 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:35:47] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:35:47] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:35:47] [INFO ] Deduced a trap composed of 314 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:35:48] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:35:49] [INFO ] Deduced a trap composed of 278 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:35:49] [INFO ] Deduced a trap composed of 305 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:35:49] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:35:50] [INFO ] Deduced a trap composed of 317 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:35:50] [INFO ] Deduced a trap composed of 344 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:35:51] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:35:51] [INFO ] Deduced a trap composed of 320 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:35:51] [INFO ] Deduced a trap composed of 323 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:35:52] [INFO ] Deduced a trap composed of 323 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 323 places in 307 ms of which 0 ms to minimize.
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 317 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 329 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 299 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 311 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 335 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:35:59] [INFO ] Deduced a trap composed of 323 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:35:59] [INFO ] Deduced a trap composed of 323 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 320 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 332 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 326 places in 316 ms of which 0 ms to minimize.
[2022-05-17 18:36:01] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:36:03] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 0 ms to minimize.
[2022-05-17 18:36:04] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 0 ms to minimize.
[2022-05-17 18:36:04] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:36:05] [INFO ] Deduced a trap composed of 335 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:36:05] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:36:05] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:36:06] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 320 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 305 places in 305 ms of which 0 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 332 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:36:11] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:36:11] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:36:14] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:36:16] [INFO ] Deduced a trap composed of 326 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 338 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 317 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:36:21] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:36:22] [INFO ] Deduced a trap composed of 347 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:36:22] [INFO ] Deduced a trap composed of 320 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:36:23] [INFO ] Deduced a trap composed of 323 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:36:29] [INFO ] Deduced a trap composed of 329 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:36:31] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:36:32] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:36:33] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 0 ms to minimize.
[2022-05-17 18:36:34] [INFO ] Deduced a trap composed of 317 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:36:35] [INFO ] Deduced a trap composed of 302 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:36:35] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:36:36] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 320 places in 326 ms of which 1 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 311 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 329 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 311 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:37:08] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 88733 ms
[2022-05-17 18:37:08] [INFO ] After 89074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:08] [INFO ] After 89754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52367 resets, run finished after 6395 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2677 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1942298 steps, run timeout after 21001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 1942298 steps, saw 603716 distinct states, run finished after 21001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:37:37] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:37:37] [INFO ] Computed 177 place invariants in 49 ms
[2022-05-17 18:37:37] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2022-05-17 18:37:37] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:37:38] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:37:38] [INFO ] [Nat]Absence check using 170 positive place invariants in 32 ms returned sat
[2022-05-17 18:37:38] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:37:39] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:37:39] [INFO ] After 185ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:39] [INFO ] Deduced a trap composed of 326 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:37:40] [INFO ] Deduced a trap composed of 330 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:37:40] [INFO ] Deduced a trap composed of 309 places in 331 ms of which 1 ms to minimize.
[2022-05-17 18:37:40] [INFO ] Deduced a trap composed of 335 places in 325 ms of which 1 ms to minimize.
[2022-05-17 18:37:41] [INFO ] Deduced a trap composed of 318 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:37:41] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 0 ms to minimize.
[2022-05-17 18:37:41] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:37:42] [INFO ] Deduced a trap composed of 315 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:37:42] [INFO ] Deduced a trap composed of 333 places in 333 ms of which 1 ms to minimize.
[2022-05-17 18:37:43] [INFO ] Deduced a trap composed of 329 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:37:43] [INFO ] Deduced a trap composed of 312 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:37:44] [INFO ] Deduced a trap composed of 311 places in 324 ms of which 1 ms to minimize.
[2022-05-17 18:37:45] [INFO ] Deduced a trap composed of 335 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:37:45] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:37:46] [INFO ] Deduced a trap composed of 323 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:37:46] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:37:47] [INFO ] Deduced a trap composed of 320 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:37:47] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 335 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 278 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 305 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 0 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 317 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:37:50] [INFO ] Deduced a trap composed of 344 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:37:50] [INFO ] Deduced a trap composed of 329 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:37:51] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:37:51] [INFO ] Deduced a trap composed of 323 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:37:51] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 323 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 317 places in 310 ms of which 0 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 299 places in 306 ms of which 0 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 0 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 311 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:37:56] [INFO ] Deduced a trap composed of 335 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:37:58] [INFO ] Deduced a trap composed of 323 places in 311 ms of which 0 ms to minimize.
[2022-05-17 18:37:59] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:37:59] [INFO ] Deduced a trap composed of 320 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:38:00] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:38:00] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 341 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 329 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 335 places in 312 ms of which 0 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 326 places in 322 ms of which 1 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 0 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:38:08] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:38:09] [INFO ] Deduced a trap composed of 317 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:38:10] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:38:11] [INFO ] Deduced a trap composed of 341 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:38:13] [INFO ] Deduced a trap composed of 332 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 2 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 326 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 338 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 332 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 317 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 347 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:38:23] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:38:29] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:38:31] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:38:32] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:38:33] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:38:34] [INFO ] Deduced a trap composed of 317 places in 309 ms of which 3 ms to minimize.
[2022-05-17 18:38:34] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:38:35] [INFO ] Deduced a trap composed of 314 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:38:36] [INFO ] Deduced a trap composed of 323 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:38:40] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:38:44] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:38:46] [INFO ] Deduced a trap composed of 326 places in 296 ms of which 0 ms to minimize.
[2022-05-17 18:38:50] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:38:52] [INFO ] Deduced a trap composed of 332 places in 309 ms of which 2 ms to minimize.
[2022-05-17 18:38:57] [INFO ] Deduced a trap composed of 329 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:38:58] [INFO ] Deduced a trap composed of 341 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:38:58] [INFO ] Deduced a trap composed of 311 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:39:07] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 88462 ms
[2022-05-17 18:39:07] [INFO ] After 88825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:39:07] [INFO ] After 89506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 41 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 36 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2022-05-17 18:39:08] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:39:08] [INFO ] Computed 177 place invariants in 26 ms
[2022-05-17 18:39:09] [INFO ] Implicit Places using invariants in 1387 ms returned []
[2022-05-17 18:39:09] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:39:09] [INFO ] Computed 177 place invariants in 31 ms
[2022-05-17 18:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:39:16] [INFO ] Implicit Places using invariants and state equation in 6607 ms returned []
Implicit Place search using SMT with State Equation took 8000 ms to find 0 implicit places.
[2022-05-17 18:39:16] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-17 18:39:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:39:16] [INFO ] Computed 177 place invariants in 28 ms
[2022-05-17 18:39:17] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5202 resets, run finished after 638 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:39:17] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:39:17] [INFO ] Computed 177 place invariants in 32 ms
[2022-05-17 18:39:17] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2022-05-17 18:39:17] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:39:18] [INFO ] After 738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:39:18] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2022-05-17 18:39:18] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:39:19] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:39:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:39:19] [INFO ] After 182ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:39:19] [INFO ] Deduced a trap composed of 326 places in 318 ms of which 0 ms to minimize.
[2022-05-17 18:39:20] [INFO ] Deduced a trap composed of 330 places in 318 ms of which 1 ms to minimize.
[2022-05-17 18:39:20] [INFO ] Deduced a trap composed of 309 places in 319 ms of which 1 ms to minimize.
[2022-05-17 18:39:20] [INFO ] Deduced a trap composed of 335 places in 330 ms of which 1 ms to minimize.
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 318 places in 324 ms of which 1 ms to minimize.
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 338 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 338 places in 322 ms of which 1 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 315 places in 320 ms of which 1 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 333 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 312 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 311 places in 322 ms of which 1 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 335 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 326 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 323 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 320 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 335 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 278 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 305 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 1 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 317 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 344 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 329 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 323 places in 306 ms of which 0 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:39:33] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:39:33] [INFO ] Deduced a trap composed of 317 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:39:33] [INFO ] Deduced a trap composed of 329 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:39:34] [INFO ] Deduced a trap composed of 299 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:39:34] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:39:35] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:39:35] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:39:36] [INFO ] Deduced a trap composed of 335 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:39:38] [INFO ] Deduced a trap composed of 323 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:39:39] [INFO ] Deduced a trap composed of 323 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:39:39] [INFO ] Deduced a trap composed of 320 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:39:39] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:39:40] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:39:41] [INFO ] Deduced a trap composed of 341 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:39:42] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:39:43] [INFO ] Deduced a trap composed of 329 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:39:44] [INFO ] Deduced a trap composed of 314 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:39:44] [INFO ] Deduced a trap composed of 335 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:39:44] [INFO ] Deduced a trap composed of 332 places in 319 ms of which 0 ms to minimize.
[2022-05-17 18:39:45] [INFO ] Deduced a trap composed of 326 places in 324 ms of which 1 ms to minimize.
[2022-05-17 18:39:45] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 0 ms to minimize.
[2022-05-17 18:39:46] [INFO ] Deduced a trap composed of 326 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:39:47] [INFO ] Deduced a trap composed of 320 places in 315 ms of which 0 ms to minimize.
[2022-05-17 18:39:47] [INFO ] Deduced a trap composed of 305 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:39:48] [INFO ] Deduced a trap composed of 332 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:39:49] [INFO ] Deduced a trap composed of 317 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:39:50] [INFO ] Deduced a trap composed of 320 places in 312 ms of which 1 ms to minimize.
[2022-05-17 18:39:51] [INFO ] Deduced a trap composed of 341 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:39:53] [INFO ] Deduced a trap composed of 332 places in 318 ms of which 0 ms to minimize.
[2022-05-17 18:39:55] [INFO ] Deduced a trap composed of 317 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:39:56] [INFO ] Deduced a trap composed of 326 places in 317 ms of which 1 ms to minimize.
[2022-05-17 18:39:57] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:39:58] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:39:58] [INFO ] Deduced a trap composed of 338 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:39:59] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:40:00] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:40:00] [INFO ] Deduced a trap composed of 317 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:40:01] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:40:02] [INFO ] Deduced a trap composed of 347 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:40:02] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:40:03] [INFO ] Deduced a trap composed of 323 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:40:09] [INFO ] Deduced a trap composed of 329 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:40:11] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:40:12] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:40:13] [INFO ] Deduced a trap composed of 314 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:40:14] [INFO ] Deduced a trap composed of 317 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:40:14] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:40:15] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:40:16] [INFO ] Deduced a trap composed of 323 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:40:20] [INFO ] Deduced a trap composed of 332 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:40:24] [INFO ] Deduced a trap composed of 320 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:40:26] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:40:30] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:40:33] [INFO ] Deduced a trap composed of 332 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:40:38] [INFO ] Deduced a trap composed of 329 places in 314 ms of which 1 ms to minimize.
[2022-05-17 18:40:39] [INFO ] Deduced a trap composed of 341 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:40:39] [INFO ] Deduced a trap composed of 311 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:40:48] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 89008 ms
[2022-05-17 18:40:48] [INFO ] After 89331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:40:48] [INFO ] After 90049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 500 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 277907 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277907 steps, saw 83696 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:40:51] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:40:51] [INFO ] Computed 177 place invariants in 35 ms
[2022-05-17 18:40:51] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2022-05-17 18:40:51] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 18:40:52] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:40:52] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2022-05-17 18:40:52] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:40:53] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:40:53] [INFO ] After 586ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:40:54] [INFO ] Deduced a trap composed of 315 places in 325 ms of which 0 ms to minimize.
[2022-05-17 18:40:54] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2022-05-17 18:40:54] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:40:55] [INFO ] Deduced a trap composed of 308 places in 327 ms of which 1 ms to minimize.
[2022-05-17 18:40:55] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 1 ms to minimize.
[2022-05-17 18:40:56] [INFO ] Deduced a trap composed of 318 places in 337 ms of which 1 ms to minimize.
[2022-05-17 18:40:56] [INFO ] Deduced a trap composed of 317 places in 324 ms of which 1 ms to minimize.
[2022-05-17 18:40:56] [INFO ] Deduced a trap composed of 305 places in 322 ms of which 0 ms to minimize.
[2022-05-17 18:40:57] [INFO ] Deduced a trap composed of 330 places in 326 ms of which 1 ms to minimize.
[2022-05-17 18:40:58] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 0 ms to minimize.
[2022-05-17 18:40:58] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:40:58] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:40:59] [INFO ] Deduced a trap composed of 344 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:40:59] [INFO ] Deduced a trap composed of 326 places in 310 ms of which 1 ms to minimize.
[2022-05-17 18:41:00] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:41:00] [INFO ] Deduced a trap composed of 323 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:00] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:41:01] [INFO ] Deduced a trap composed of 326 places in 294 ms of which 0 ms to minimize.
[2022-05-17 18:41:01] [INFO ] Deduced a trap composed of 314 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:41:02] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:02] [INFO ] Deduced a trap composed of 347 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:03] [INFO ] Deduced a trap composed of 335 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:03] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:03] [INFO ] Deduced a trap composed of 329 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:41:04] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:41:04] [INFO ] Deduced a trap composed of 333 places in 318 ms of which 0 ms to minimize.
[2022-05-17 18:41:05] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:05] [INFO ] Deduced a trap composed of 305 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:41:06] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 0 ms to minimize.
[2022-05-17 18:41:06] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:41:08] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:41:08] [INFO ] Deduced a trap composed of 350 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:41:09] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:09] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:41:09] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:41:10] [INFO ] Deduced a trap composed of 326 places in 313 ms of which 0 ms to minimize.
[2022-05-17 18:41:11] [INFO ] Deduced a trap composed of 338 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:41:12] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:41:12] [INFO ] Deduced a trap composed of 335 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:13] [INFO ] Deduced a trap composed of 335 places in 305 ms of which 0 ms to minimize.
[2022-05-17 18:41:14] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:14] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:15] [INFO ] Deduced a trap composed of 329 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:41:15] [INFO ] Deduced a trap composed of 329 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:41:17] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:41:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:41:17] [INFO ] After 25191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 37 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2022-05-17 18:41:17] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:41:17] [INFO ] Computed 177 place invariants in 34 ms
[2022-05-17 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 520 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288804 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288804 steps, saw 87042 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:41:21] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:41:21] [INFO ] Computed 177 place invariants in 43 ms
[2022-05-17 18:41:21] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2022-05-17 18:41:21] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:41:22] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:41:22] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2022-05-17 18:41:22] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-17 18:41:23] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:41:23] [INFO ] After 587ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:41:24] [INFO ] Deduced a trap composed of 315 places in 322 ms of which 1 ms to minimize.
[2022-05-17 18:41:24] [INFO ] Deduced a trap composed of 326 places in 325 ms of which 0 ms to minimize.
[2022-05-17 18:41:24] [INFO ] Deduced a trap composed of 323 places in 320 ms of which 1 ms to minimize.
[2022-05-17 18:41:25] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:41:25] [INFO ] Deduced a trap composed of 338 places in 321 ms of which 1 ms to minimize.
[2022-05-17 18:41:26] [INFO ] Deduced a trap composed of 318 places in 322 ms of which 1 ms to minimize.
[2022-05-17 18:41:26] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 1 ms to minimize.
[2022-05-17 18:41:27] [INFO ] Deduced a trap composed of 305 places in 335 ms of which 1 ms to minimize.
[2022-05-17 18:41:27] [INFO ] Deduced a trap composed of 330 places in 329 ms of which 1 ms to minimize.
[2022-05-17 18:41:28] [INFO ] Deduced a trap composed of 306 places in 321 ms of which 0 ms to minimize.
[2022-05-17 18:41:28] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:41:28] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:41:29] [INFO ] Deduced a trap composed of 344 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:41:29] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 0 ms to minimize.
[2022-05-17 18:41:30] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:41:30] [INFO ] Deduced a trap composed of 323 places in 295 ms of which 0 ms to minimize.
[2022-05-17 18:41:30] [INFO ] Deduced a trap composed of 311 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:31] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 0 ms to minimize.
[2022-05-17 18:41:31] [INFO ] Deduced a trap composed of 314 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:41:32] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:32] [INFO ] Deduced a trap composed of 347 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:33] [INFO ] Deduced a trap composed of 335 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:33] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:41:33] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:41:34] [INFO ] Deduced a trap composed of 320 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:41:34] [INFO ] Deduced a trap composed of 333 places in 313 ms of which 0 ms to minimize.
[2022-05-17 18:41:35] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:35] [INFO ] Deduced a trap composed of 305 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:36] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:41:36] [INFO ] Deduced a trap composed of 317 places in 294 ms of which 0 ms to minimize.
[2022-05-17 18:41:38] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:41:38] [INFO ] Deduced a trap composed of 350 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:41:39] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:41:39] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:41:39] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:41:40] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:41:41] [INFO ] Deduced a trap composed of 338 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:41:42] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:41:42] [INFO ] Deduced a trap composed of 335 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:41:43] [INFO ] Deduced a trap composed of 335 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:44] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:41:45] [INFO ] Deduced a trap composed of 320 places in 306 ms of which 0 ms to minimize.
[2022-05-17 18:41:45] [INFO ] Deduced a trap composed of 329 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:41:45] [INFO ] Deduced a trap composed of 329 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:41:47] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2022-05-17 18:41:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:41:47] [INFO ] After 25242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 34 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 39 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2022-05-17 18:41:47] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:41:47] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-17 18:41:49] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2022-05-17 18:41:49] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:41:49] [INFO ] Computed 177 place invariants in 36 ms
[2022-05-17 18:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:41:55] [INFO ] Implicit Places using invariants and state equation in 6794 ms returned []
Implicit Place search using SMT with State Equation took 8200 ms to find 0 implicit places.
[2022-05-17 18:41:56] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 18:41:56] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2022-05-17 18:41:56] [INFO ] Computed 177 place invariants in 33 ms
[2022-05-17 18:41:57] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 146 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2022-05-17 18:41:57] [INFO ] Computed 177 place invariants in 30 ms
[2022-05-17 18:41:57] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2022-05-17 18:41:57] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:41:57] [INFO ] After 417ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:41:58] [INFO ] Deduced a trap composed of 327 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2022-05-17 18:41:58] [INFO ] After 849ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:41:58] [INFO ] After 1037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:41:58] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2022-05-17 18:41:58] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:41:58] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 327 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 312 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 330 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:00] [INFO ] Deduced a trap composed of 327 places in 309 ms of which 1 ms to minimize.
[2022-05-17 18:42:00] [INFO ] Deduced a trap composed of 309 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 330 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 312 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 333 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:42:03] [INFO ] Deduced a trap composed of 330 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:03] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:42:03] [INFO ] Deduced a trap composed of 321 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:42:04] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:04] [INFO ] Deduced a trap composed of 327 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 324 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 324 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:42:06] [INFO ] Deduced a trap composed of 321 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:42:06] [INFO ] Deduced a trap composed of 318 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:42:07] [INFO ] Deduced a trap composed of 312 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:42:07] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:42:07] [INFO ] Deduced a trap composed of 321 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 309 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 342 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 330 places in 293 ms of which 1 ms to minimize.
[2022-05-17 18:42:09] [INFO ] Deduced a trap composed of 321 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:09] [INFO ] Deduced a trap composed of 336 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 327 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 324 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:42:11] [INFO ] Deduced a trap composed of 330 places in 299 ms of which 0 ms to minimize.
[2022-05-17 18:42:11] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:42:12] [INFO ] Deduced a trap composed of 291 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:12] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 0 ms to minimize.
[2022-05-17 18:42:13] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 0 ms to minimize.
[2022-05-17 18:42:13] [INFO ] Deduced a trap composed of 315 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 330 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 321 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 327 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 339 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 315 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:16] [INFO ] Deduced a trap composed of 333 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:42:16] [INFO ] Deduced a trap composed of 339 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:17] [INFO ] Deduced a trap composed of 324 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:42:17] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:42:18] [INFO ] Deduced a trap composed of 336 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:18] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 333 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 327 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 315 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:20] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 1 ms to minimize.
[2022-05-17 18:42:20] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:42:21] [INFO ] Deduced a trap composed of 336 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:42:21] [INFO ] Deduced a trap composed of 330 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:21] [INFO ] Deduced a trap composed of 318 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:42:22] [INFO ] Deduced a trap composed of 321 places in 290 ms of which 0 ms to minimize.
[2022-05-17 18:42:23] [INFO ] Deduced a trap composed of 312 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:42:23] [INFO ] Deduced a trap composed of 327 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:24] [INFO ] Deduced a trap composed of 330 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 324 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 318 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:26] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:27] [INFO ] Deduced a trap composed of 324 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:42:30] [INFO ] Deduced a trap composed of 321 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:42:34] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 0 ms to minimize.
[2022-05-17 18:42:34] [INFO ] Deduced a trap composed of 333 places in 305 ms of which 1 ms to minimize.
[2022-05-17 18:42:35] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:42:37] [INFO ] Deduced a trap composed of 318 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:42:38] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:42:40] [INFO ] Deduced a trap composed of 303 places in 308 ms of which 1 ms to minimize.
[2022-05-17 18:42:49] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 50859 ms
[2022-05-17 18:42:49] [INFO ] After 51469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:42:49] [INFO ] After 51649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:42:50] [INFO ] Flatten gal took : 186 ms
[2022-05-17 18:42:50] [INFO ] Flatten gal took : 140 ms
[2022-05-17 18:42:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4968104187534286707.gal : 28 ms
[2022-05-17 18:42:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2419815607852335305.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12944958625245955246;'/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/ReachabilityCardinality4968104187534286707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2419815607852335305.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/ReachabilityCardinality2419815607852335305.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :38 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :55 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 94
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94 after 210
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210 after 5770
Detected timeout of ITS tools.
[2022-05-17 18:43:05] [INFO ] Flatten gal took : 91 ms
[2022-05-17 18:43:05] [INFO ] Applying decomposition
[2022-05-17 18:43:05] [INFO ] Flatten gal took : 79 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/graph10688732189045208723.txt' '-o' '/tmp/graph10688732189045208723.bin' '-w' '/tmp/graph10688732189045208723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10688732189045208723.bin' '-l' '-1' '-v' '-w' '/tmp/graph10688732189045208723.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:43:05] [INFO ] Decomposing Gal with order
[2022-05-17 18:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:43:06] [INFO ] Removed a total of 1544 redundant transitions.
[2022-05-17 18:43:06] [INFO ] Flatten gal took : 370 ms
[2022-05-17 18:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 62 ms.
[2022-05-17 18:43:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4928644525650248985.gal : 19 ms
[2022-05-17 18:43:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12801012509487089905.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12944958625245955246;'/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/ReachabilityCardinality4928644525650248985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12801012509487089905.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality12801012509487089905.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4.5861e+07
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4.5861e+07 after 4.66303e+08
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4.66303e+08 after 4.66328e+08
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4.66328e+08 after 4.66353e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.66353e+08 after 4.68566e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.68566e+08 after 4.68567e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.68567e+08 after 4.68569e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3548508728054992115
[2022-05-17 18:43:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3548508728054992115
Running compilation step : cd /tmp/ltsmin3548508728054992115;'/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 2773 ms.
Running link step : cd /tmp/ltsmin3548508728054992115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3548508728054992115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 133 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2022-05-17 18:43:36] [INFO ] Computed 177 place invariants in 25 ms
[2022-05-17 18:43:36] [INFO ] [Real]Absence check using 170 positive place invariants in 29 ms returned sat
[2022-05-17 18:43:36] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:43:37] [INFO ] After 398ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:43:37] [INFO ] Deduced a trap composed of 327 places in 289 ms of which 1 ms to minimize.
[2022-05-17 18:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2022-05-17 18:43:37] [INFO ] After 817ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:43:37] [INFO ] After 996ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:43:37] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2022-05-17 18:43:37] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2022-05-17 18:43:38] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:43:38] [INFO ] Deduced a trap composed of 327 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:43:39] [INFO ] Deduced a trap composed of 312 places in 293 ms of which 1 ms to minimize.
[2022-05-17 18:43:39] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:43:40] [INFO ] Deduced a trap composed of 327 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:43:40] [INFO ] Deduced a trap composed of 309 places in 292 ms of which 1 ms to minimize.
[2022-05-17 18:43:40] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:43:41] [INFO ] Deduced a trap composed of 330 places in 292 ms of which 0 ms to minimize.
[2022-05-17 18:43:41] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:43:41] [INFO ] Deduced a trap composed of 333 places in 298 ms of which 0 ms to minimize.
[2022-05-17 18:43:42] [INFO ] Deduced a trap composed of 324 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:43:42] [INFO ] Deduced a trap composed of 330 places in 290 ms of which 1 ms to minimize.
[2022-05-17 18:43:42] [INFO ] Deduced a trap composed of 324 places in 292 ms of which 1 ms to minimize.
[2022-05-17 18:43:43] [INFO ] Deduced a trap composed of 321 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:43:43] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:43:44] [INFO ] Deduced a trap composed of 327 places in 299 ms of which 0 ms to minimize.
[2022-05-17 18:43:44] [INFO ] Deduced a trap composed of 324 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:43:44] [INFO ] Deduced a trap composed of 324 places in 301 ms of which 0 ms to minimize.
[2022-05-17 18:43:45] [INFO ] Deduced a trap composed of 324 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:45] [INFO ] Deduced a trap composed of 321 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:43:46] [INFO ] Deduced a trap composed of 318 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:46] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:43:46] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:47] [INFO ] Deduced a trap composed of 321 places in 293 ms of which 0 ms to minimize.
[2022-05-17 18:43:47] [INFO ] Deduced a trap composed of 309 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:43:47] [INFO ] Deduced a trap composed of 342 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:48] [INFO ] Deduced a trap composed of 330 places in 313 ms of which 1 ms to minimize.
[2022-05-17 18:43:48] [INFO ] Deduced a trap composed of 321 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:43:49] [INFO ] Deduced a trap composed of 336 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:43:49] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:43:49] [INFO ] Deduced a trap composed of 327 places in 295 ms of which 0 ms to minimize.
[2022-05-17 18:43:50] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 0 ms to minimize.
[2022-05-17 18:43:50] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:51] [INFO ] Deduced a trap composed of 333 places in 290 ms of which 0 ms to minimize.
[2022-05-17 18:43:51] [INFO ] Deduced a trap composed of 291 places in 288 ms of which 1 ms to minimize.
[2022-05-17 18:43:52] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:52] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:43:53] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 0 ms to minimize.
[2022-05-17 18:43:53] [INFO ] Deduced a trap composed of 330 places in 299 ms of which 1 ms to minimize.
[2022-05-17 18:43:53] [INFO ] Deduced a trap composed of 321 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:43:54] [INFO ] Deduced a trap composed of 327 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:54] [INFO ] Deduced a trap composed of 339 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:43:55] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 0 ms to minimize.
[2022-05-17 18:43:55] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 1 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 339 places in 300 ms of which 1 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 330 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 336 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 312 places in 290 ms of which 0 ms to minimize.
[2022-05-17 18:43:58] [INFO ] Deduced a trap composed of 333 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:43:58] [INFO ] Deduced a trap composed of 327 places in 293 ms of which 1 ms to minimize.
[2022-05-17 18:43:59] [INFO ] Deduced a trap composed of 315 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:43:59] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 18:44:00] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:44:00] [INFO ] Deduced a trap composed of 336 places in 298 ms of which 1 ms to minimize.
[2022-05-17 18:44:00] [INFO ] Deduced a trap composed of 330 places in 291 ms of which 0 ms to minimize.
[2022-05-17 18:44:01] [INFO ] Deduced a trap composed of 318 places in 316 ms of which 1 ms to minimize.
[2022-05-17 18:44:01] [INFO ] Deduced a trap composed of 321 places in 292 ms of which 1 ms to minimize.
[2022-05-17 18:44:02] [INFO ] Deduced a trap composed of 312 places in 302 ms of which 1 ms to minimize.
[2022-05-17 18:44:02] [INFO ] Deduced a trap composed of 327 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:44:03] [INFO ] Deduced a trap composed of 330 places in 294 ms of which 1 ms to minimize.
[2022-05-17 18:44:04] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 0 ms to minimize.
[2022-05-17 18:44:04] [INFO ] Deduced a trap composed of 318 places in 291 ms of which 0 ms to minimize.
[2022-05-17 18:44:05] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:44:06] [INFO ] Deduced a trap composed of 312 places in 302 ms of which 0 ms to minimize.
[2022-05-17 18:44:06] [INFO ] Deduced a trap composed of 324 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:44:10] [INFO ] Deduced a trap composed of 321 places in 311 ms of which 1 ms to minimize.
[2022-05-17 18:44:13] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 1 ms to minimize.
[2022-05-17 18:44:14] [INFO ] Deduced a trap composed of 333 places in 303 ms of which 0 ms to minimize.
[2022-05-17 18:44:14] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 18:44:16] [INFO ] Deduced a trap composed of 318 places in 295 ms of which 0 ms to minimize.
[2022-05-17 18:44:18] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-17 18:44:20] [INFO ] Deduced a trap composed of 303 places in 303 ms of which 1 ms to minimize.
[2022-05-17 18:44:29] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 51060 ms
[2022-05-17 18:44:29] [INFO ] After 51566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:44:29] [INFO ] After 51752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:44:29] [INFO ] Flatten gal took : 71 ms
[2022-05-17 18:44:29] [INFO ] Flatten gal took : 70 ms
[2022-05-17 18:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16159010636476808005.gal : 10 ms
[2022-05-17 18:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16379656133204606735.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16159010636476808005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16379656133204606735.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/ReachabilityCardinality16379656133204606735.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :38 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :55 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 94
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94 after 210
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210 after 5770
Detected timeout of ITS tools.
[2022-05-17 18:44:44] [INFO ] Flatten gal took : 64 ms
[2022-05-17 18:44:44] [INFO ] Applying decomposition
[2022-05-17 18:44:44] [INFO ] Flatten gal took : 80 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/graph13991543292120772325.txt' '-o' '/tmp/graph13991543292120772325.bin' '-w' '/tmp/graph13991543292120772325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13991543292120772325.bin' '-l' '-1' '-v' '-w' '/tmp/graph13991543292120772325.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:44:45] [INFO ] Decomposing Gal with order
[2022-05-17 18:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:44:45] [INFO ] Removed a total of 1782 redundant transitions.
[2022-05-17 18:44:45] [INFO ] Flatten gal took : 160 ms
[2022-05-17 18:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 41 ms.
[2022-05-17 18:44:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4068341636533630955.gal : 11 ms
[2022-05-17 18:44:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16714154163002752636.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4068341636533630955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16714154163002752636.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16714154163002752636.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3.44237e+08
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3.44237e+08 after 3.48671e+08
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3.48671e+08 after 3.53104e+08
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3.53104e+08 after 3.57537e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.57537e+08 after 3.61971e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.61971e+08 after 3.66404e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.66404e+08 after 3.75271e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.75271e+08 after 3.88572e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.88572e+08 after 4.19606e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.19606e+08 after 4.72808e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.72808e+08 after 5.74778e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5369733724321254774
[2022-05-17 18:45:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5369733724321254774
Running compilation step : cd /tmp/ltsmin5369733724321254774;'/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 2690 ms.
Running link step : cd /tmp/ltsmin5369733724321254774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5369733724321254774;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:45:15] [INFO ] Flatten gal took : 59 ms
[2022-05-17 18:45:15] [INFO ] Flatten gal took : 60 ms
[2022-05-17 18:45:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11883551161930990145.gal : 7 ms
[2022-05-17 18:45:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15646922165933550898.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11883551161930990145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15646922165933550898.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/ReachabilityFireability15646922165933550898.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
Detected timeout of ITS tools.
[2022-05-17 18:45:18] [INFO ] Flatten gal took : 68 ms
[2022-05-17 18:45:18] [INFO ] Applying decomposition
[2022-05-17 18:45:18] [INFO ] Flatten gal took : 54 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/graph4238852744949773978.txt' '-o' '/tmp/graph4238852744949773978.bin' '-w' '/tmp/graph4238852744949773978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4238852744949773978.bin' '-l' '-1' '-v' '-w' '/tmp/graph4238852744949773978.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:45:18] [INFO ] Decomposing Gal with order
[2022-05-17 18:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:45:19] [INFO ] Removed a total of 1696 redundant transitions.
[2022-05-17 18:45:19] [INFO ] Flatten gal took : 173 ms
[2022-05-17 18:45:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 23 ms.
[2022-05-17 18:45:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8204135678194648775.gal : 14 ms
[2022-05-17 18:45:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12363685687732308541.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8204135678194648775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12363685687732308541.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability12363685687732308541.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 1.77977e+06
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.77977e+06 after 1.78118e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.78118e+06 after 1.78258e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.78258e+06 after 3.61446e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.61446e+06 after 5.55058e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8333492420079686353
[2022-05-17 18:45:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8333492420079686353
Running compilation step : cd /tmp/ltsmin8333492420079686353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8333492420079686353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8333492420079686353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 18:45:24] [INFO ] Flatten gal took : 53 ms
[2022-05-17 18:45:24] [INFO ] Flatten gal took : 53 ms
[2022-05-17 18:45:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7211546527376685395.gal : 7 ms
[2022-05-17 18:45:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4896666138598112216.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7211546527376685395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4896666138598112216.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/ReachabilityFireability4896666138598112216.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
Detected timeout of ITS tools.
[2022-05-17 18:45:54] [INFO ] Flatten gal took : 53 ms
[2022-05-17 18:45:54] [INFO ] Applying decomposition
[2022-05-17 18:45:54] [INFO ] Flatten gal took : 53 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/graph15113882691840433467.txt' '-o' '/tmp/graph15113882691840433467.bin' '-w' '/tmp/graph15113882691840433467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15113882691840433467.bin' '-l' '-1' '-v' '-w' '/tmp/graph15113882691840433467.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:45:54] [INFO ] Decomposing Gal with order
[2022-05-17 18:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:45:54] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-17 18:45:54] [INFO ] Flatten gal took : 155 ms
[2022-05-17 18:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 23 ms.
[2022-05-17 18:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10312475768146753329.gal : 10 ms
[2022-05-17 18:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2037311388251121377.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10312475768146753329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2037311388251121377.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability2037311388251121377.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4512
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4512 after 4588
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4588 after 4664
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4664 after 4740
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4740 after 4892
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4892 after 5044
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5044 after 5348
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5348 after 6032
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6032 after 7248
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13733552724732783327
[2022-05-17 18:46:24] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13733552724732783327
Running compilation step : cd /tmp/ltsmin13733552724732783327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' '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 2683 ms.
Running link step : cd /tmp/ltsmin13733552724732783327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13733552724732783327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:46:55] [INFO ] Flatten gal took : 53 ms
[2022-05-17 18:46:55] [INFO ] Flatten gal took : 65 ms
[2022-05-17 18:46:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8980725805323371834.gal : 5 ms
[2022-05-17 18:46:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12209255910419129900.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8980725805323371834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12209255910419129900.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/ReachabilityFireability12209255910419129900.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8974 after 18882
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :18882 after 38905
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :38905 after 807312
Detected timeout of ITS tools.
[2022-05-17 18:51:55] [INFO ] Flatten gal took : 52 ms
[2022-05-17 18:51:55] [INFO ] Applying decomposition
[2022-05-17 18:51:55] [INFO ] Flatten gal took : 53 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/graph5711024437903053523.txt' '-o' '/tmp/graph5711024437903053523.bin' '-w' '/tmp/graph5711024437903053523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5711024437903053523.bin' '-l' '-1' '-v' '-w' '/tmp/graph5711024437903053523.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:51:55] [INFO ] Decomposing Gal with order
[2022-05-17 18:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:51:55] [INFO ] Removed a total of 1688 redundant transitions.
[2022-05-17 18:51:55] [INFO ] Flatten gal took : 133 ms
[2022-05-17 18:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 20 ms.
[2022-05-17 18:51:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3497181587360003769.gal : 11 ms
[2022-05-17 18:51:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7292195950799118360.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3497181587360003769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7292195950799118360.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability7292195950799118360.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 67
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67 after 203
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :203 after 15500
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15500 after 32566
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32566 after 5.28958e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.28958e+07 after 5.28958e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.28958e+07 after 5.57446e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.57446e+08 after 5.58088e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.58088e+08 after 5.59204e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.59204e+08 after 5.64225e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15529927375969976111
[2022-05-17 18:56:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15529927375969976111
Running compilation step : cd /tmp/ltsmin15529927375969976111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' '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 2752 ms.
Running link step : cd /tmp/ltsmin15529927375969976111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15529927375969976111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.041: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.042: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.042: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.043: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.044: There are 1427 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.044: State length is 1010, there are 1426 groups
pins2lts-mc-linux64( 0/ 8), 0.044: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.044: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.044: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.044: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.044: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.044: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.045: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.177: ~2 levels ~960 states ~1600 transitions
pins2lts-mc-linux64( 5/ 8), 0.274: ~3 levels ~1920 states ~2560 transitions
pins2lts-mc-linux64( 6/ 8), 0.421: ~3 levels ~3840 states ~5120 transitions
pins2lts-mc-linux64( 6/ 8), 0.687: ~5 levels ~7680 states ~22080 transitions
pins2lts-mc-linux64( 6/ 8), 1.137: ~6 levels ~15360 states ~51912 transitions
pins2lts-mc-linux64( 6/ 8), 2.001: ~7 levels ~30720 states ~103800 transitions
pins2lts-mc-linux64( 6/ 8), 3.533: ~9 levels ~61440 states ~184464 transitions
pins2lts-mc-linux64( 6/ 8), 6.349: ~16 levels ~122880 states ~302104 transitions
pins2lts-mc-linux64( 6/ 8), 11.783: ~19 levels ~245760 states ~619752 transitions
pins2lts-mc-linux64( 7/ 8), 22.898: ~6 levels ~491520 states ~1304952 transitions
pins2lts-mc-linux64( 7/ 8), 44.387: ~10 levels ~983040 states ~1946632 transitions
pins2lts-mc-linux64( 7/ 8), 87.868: ~12 levels ~1966080 states ~4912848 transitions
pins2lts-mc-linux64( 2/ 8), 145.947: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 146.451:
pins2lts-mc-linux64( 0/ 8), 146.452: mean standard work distribution: 21.1% (states) 106.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 146.452:
pins2lts-mc-linux64( 0/ 8), 146.452: Explored 2632737 states 44799695 transitions, fanout: 17.016
pins2lts-mc-linux64( 0/ 8), 146.452: Total exploration time 146.400 sec (145.900 sec minimum, 146.029 sec on average)
pins2lts-mc-linux64( 0/ 8), 146.452: States per second: 17983, Transitions per second: 306009
pins2lts-mc-linux64( 0/ 8), 146.452:
pins2lts-mc-linux64( 0/ 8), 146.452: Queue width: 8B, total height: 16156072, memory: 123.26MB
pins2lts-mc-linux64( 0/ 8), 146.452: Tree memory: 398.8MB, 22.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 146.452: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 146.452: Stored 1469 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 146.452: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 146.452: Est. total memory use: 522.1MB (~1147.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15529927375969976111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15529927375969976111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 18:59:25] [INFO ] Flatten gal took : 51 ms
[2022-05-17 18:59:25] [INFO ] Flatten gal took : 52 ms
[2022-05-17 18:59:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6524406464919459122.gal : 5 ms
[2022-05-17 18:59:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6595012059157865108.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6524406464919459122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6595012059157865108.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/ReachabilityFireability6595012059157865108.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8974 after 18882
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :18882 after 38905

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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -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 1800 -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="PolyORBNT-COL-S05J80"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBNT-COL-S05J80, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277024500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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