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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 9.4K Apr 30 04:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 93K 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 1652813330545

Running Version 202205111006
[2022-05-17 18:48:51] [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:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:48:51] [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:48:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:48:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2022-05-17 18:48:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 23 ms.
[2022-05-17 18:48:52] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 175 ms.
[2022-05-17 18:48:52] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:48:52] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-17 18:48:52] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-17 18:48:52] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 31 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1048 ms. (steps per millisecond=9 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :10
Running SMT prover for 6 properties.
[2022-05-17 18:48:54] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2022-05-17 18:48:54] [INFO ] Computed 92 place invariants in 118 ms
[2022-05-17 18:48:55] [INFO ] [Real]Absence check using 85 positive place invariants in 31 ms returned sat
[2022-05-17 18:48:55] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-17 18:48:55] [INFO ] After 602ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-17 18:48:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:48:55] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-17 18:48:55] [INFO ] After 230ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-17 18:48:56] [INFO ] After 1434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-17 18:48:56] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2022-05-17 18:48:56] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:48:58] [INFO ] After 2107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 18:48:59] [INFO ] After 1358ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 18:49:01] [INFO ] Deduced a trap composed of 324 places in 461 ms of which 2 ms to minimize.
[2022-05-17 18:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 591 ms
[2022-05-17 18:49:01] [INFO ] After 3130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1413 ms.
[2022-05-17 18:49:03] [INFO ] After 6940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 985 ms.
Support contains 81 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1872
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1869
Applied a total of 152 rules in 265 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
[2022-05-17 18:49:04] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2022-05-17 18:49:04] [INFO ] Computed 82 place invariants in 53 ms
[2022-05-17 18:49:05] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 583/664 places, 1254/1940 transitions.
Applied a total of 0 rules in 35 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 583/664 places, 1254/1940 transitions.
Incomplete random walk after 1000000 steps, including 65137 resets, run finished after 6645 ms. (steps per millisecond=150 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 1000001 steps, including 8659 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:49:13] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2022-05-17 18:49:13] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-17 18:49:13] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:49:13] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-17 18:49:13] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:49:13] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:49:13] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:49:13] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:49:13] [INFO ] After 238ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 244 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 0 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 227 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 221 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:49:18] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:49:18] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 1 ms to minimize.
[2022-05-17 18:49:18] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:49:19] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:49:19] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:49:19] [INFO ] Deduced a trap composed of 244 places in 265 ms of which 0 ms to minimize.
[2022-05-17 18:49:20] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:49:21] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:49:21] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:49:21] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:49:22] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:49:22] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:49:22] [INFO ] Deduced a trap composed of 246 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:49:23] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 3 ms to minimize.
[2022-05-17 18:49:23] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:49:23] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:49:23] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 246 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 3 ms to minimize.
[2022-05-17 18:49:25] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:49:25] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:49:27] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 250 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:49:29] [INFO ] Deduced a trap composed of 244 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:49:31] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:49:38] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 0 ms to minimize.
[2022-05-17 18:49:47] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 33933 ms
[2022-05-17 18:49:47] [INFO ] After 34247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:49:47] [INFO ] After 34673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1251
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 6 place count 580 transition count 1251
Applied a total of 6 rules in 53 ms. Remains 580 /583 variables (removed 3) and now considering 1251/1254 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/583 places, 1251/1254 transitions.
Incomplete random walk after 1000000 steps, including 72572 resets, run finished after 9055 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8904 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4838083 steps, run timeout after 30001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 4838083 steps, saw 831299 distinct states, run finished after 30002 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:50:28] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:50:28] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-17 18:50:28] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:50:28] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:50:28] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:50:29] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:50:29] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:50:29] [INFO ] After 778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:50:29] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:50:30] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:50:30] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:50:30] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:50:31] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 1 ms to minimize.
[2022-05-17 18:50:31] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:50:31] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:50:32] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:50:32] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2022-05-17 18:50:32] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:50:33] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 2 ms to minimize.
[2022-05-17 18:50:33] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:50:33] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 0 ms to minimize.
[2022-05-17 18:50:34] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:50:34] [INFO ] Deduced a trap composed of 247 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:50:35] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:50:35] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2022-05-17 18:50:35] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:50:36] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:50:36] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:50:36] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 2 ms to minimize.
[2022-05-17 18:50:37] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 4 ms to minimize.
[2022-05-17 18:50:37] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:50:37] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:50:38] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:50:39] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:50:40] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:50:40] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:50:40] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:50:41] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:50:46] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 0 ms to minimize.
[2022-05-17 18:50:50] [INFO ] Deduced a trap composed of 243 places in 264 ms of which 0 ms to minimize.
[2022-05-17 18:50:51] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:50:51] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:50:51] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:50:52] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:50:52] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:50:53] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:50:53] [INFO ] Deduced a trap composed of 249 places in 247 ms of which 0 ms to minimize.
[2022-05-17 18:50:54] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 1 ms to minimize.
[2022-05-17 18:50:54] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:50:54] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:50:55] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2022-05-17 18:50:55] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:50:55] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:50:56] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:50:56] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:50:57] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 1 ms to minimize.
[2022-05-17 18:50:58] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:50:59] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:50:59] [INFO ] Deduced a trap composed of 249 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:50:59] [INFO ] Deduced a trap composed of 249 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:51:00] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:51:00] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:51:01] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:51:01] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:51:01] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:51:01] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:51:02] [INFO ] Deduced a trap composed of 243 places in 296 ms of which 1 ms to minimize.
[2022-05-17 18:51:05] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:51:06] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:51:07] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:51:08] [INFO ] Deduced a trap composed of 237 places in 267 ms of which 1 ms to minimize.
[2022-05-17 18:51:09] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:51:09] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:51:10] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:51:11] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:51:12] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:51:12] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 1 ms to minimize.
[2022-05-17 18:51:14] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:51:18] [INFO ] Deduced a trap composed of 251 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:51:18] [INFO ] Deduced a trap composed of 252 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:51:19] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:51:19] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:51:21] [INFO ] Deduced a trap composed of 241 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:51:30] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 60103 ms
[2022-05-17 18:51:30] [INFO ] After 60259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:51:30] [INFO ] After 61153ms 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 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2022-05-17 18:51:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:51:30] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-17 18:51:30] [INFO ] Implicit Places using invariants in 459 ms returned []
[2022-05-17 18:51:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:51:30] [INFO ] Computed 82 place invariants in 29 ms
[2022-05-17 18:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:51:33] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
[2022-05-17 18:51:33] [INFO ] Redundant transitions in 82 ms returned []
[2022-05-17 18:51:33] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:51:33] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-17 18:51:33] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7292 resets, run finished after 1048 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:51:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:51:34] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-17 18:51:34] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:51:35] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:51:35] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:51:35] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:51:35] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:51:35] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:51:36] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:51:36] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:51:36] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 0 ms to minimize.
[2022-05-17 18:51:36] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2022-05-17 18:51:37] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:51:37] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2022-05-17 18:51:37] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:51:38] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:51:38] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:51:38] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:51:39] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:51:39] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:51:40] [INFO ] Deduced a trap composed of 241 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:51:40] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:51:40] [INFO ] Deduced a trap composed of 247 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:51:41] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:51:41] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2022-05-17 18:51:41] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:51:42] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:51:42] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:51:42] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:51:43] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:51:43] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:51:43] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:51:44] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:51:46] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:51:46] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:51:46] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:51:47] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:51:47] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:51:52] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:51:56] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:51:57] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:51:57] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:51:57] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:51:58] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:51:58] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:51:59] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:51:59] [INFO ] Deduced a trap composed of 249 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:52:00] [INFO ] Deduced a trap composed of 241 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:52:00] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:52:01] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:52:01] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:52:01] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:52:02] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2022-05-17 18:52:02] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:52:02] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:52:03] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:52:04] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:52:05] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:52:05] [INFO ] Deduced a trap composed of 249 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:52:06] [INFO ] Deduced a trap composed of 249 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:52:06] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:52:06] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:52:07] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:52:07] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2022-05-17 18:52:07] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:52:08] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:52:08] [INFO ] Deduced a trap composed of 243 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:52:11] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 1 ms to minimize.
[2022-05-17 18:52:12] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:52:13] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2022-05-17 18:52:14] [INFO ] Deduced a trap composed of 237 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:52:15] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:52:15] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:52:16] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:52:17] [INFO ] Deduced a trap composed of 244 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:52:18] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:52:18] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 0 ms to minimize.
[2022-05-17 18:52:20] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:52:24] [INFO ] Deduced a trap composed of 251 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:52:24] [INFO ] Deduced a trap composed of 252 places in 259 ms of which 0 ms to minimize.
[2022-05-17 18:52:25] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2022-05-17 18:52:25] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:52:26] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:52:35] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 59834 ms
[2022-05-17 18:52:35] [INFO ] After 59983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:52:35] [INFO ] After 60871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72638 resets, run finished after 9640 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8787 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5248620 steps, run timeout after 33001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 5248620 steps, saw 903894 distinct states, run finished after 33001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:53:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:53:20] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-17 18:53:20] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2022-05-17 18:53:20] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:53:20] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:53:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:53:20] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:53:21] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:53:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:53:21] [INFO ] After 92ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:53:21] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:22] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:53:22] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 1 ms to minimize.
[2022-05-17 18:53:22] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:53:22] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:53:23] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2022-05-17 18:53:23] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 1 ms to minimize.
[2022-05-17 18:53:23] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:53:24] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:53:24] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:53:24] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 0 ms to minimize.
[2022-05-17 18:53:25] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:53:25] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:53:26] [INFO ] Deduced a trap composed of 247 places in 264 ms of which 4 ms to minimize.
[2022-05-17 18:53:26] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:26] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:53:27] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:53:27] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:27] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:53:28] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:53:28] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:53:28] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:53:29] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:53:29] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:53:31] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:53:31] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:53:32] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:53:32] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:53:33] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:53:38] [INFO ] Deduced a trap composed of 238 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:53:42] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:53:42] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 1 ms to minimize.
[2022-05-17 18:53:42] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2022-05-17 18:53:42] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:53:43] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:53:44] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2022-05-17 18:53:44] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:53:45] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:53:45] [INFO ] Deduced a trap composed of 241 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:53:45] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:53:46] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:53:46] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:53:46] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:53:47] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2022-05-17 18:53:47] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:53:48] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:53:48] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:50] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:53:50] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:53:50] [INFO ] Deduced a trap composed of 249 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:53:51] [INFO ] Deduced a trap composed of 249 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:53:51] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:53:51] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2022-05-17 18:53:52] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:53:52] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:53:53] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:53] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 1 ms to minimize.
[2022-05-17 18:53:53] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:53:57] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:53:57] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:53:59] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 3 ms to minimize.
[2022-05-17 18:53:59] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:54:00] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:54:01] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:54:02] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:54:03] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 0 ms to minimize.
[2022-05-17 18:54:03] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:54:03] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:54:05] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:54:09] [INFO ] Deduced a trap composed of 251 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:54:09] [INFO ] Deduced a trap composed of 252 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:54:10] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:54:10] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:54:12] [INFO ] Deduced a trap composed of 241 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:54:21] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 59902 ms
[2022-05-17 18:54:21] [INFO ] After 60062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:54:21] [INFO ] After 60946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 22 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2022-05-17 18:54:21] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:54:21] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-17 18:54:21] [INFO ] Implicit Places using invariants in 432 ms returned []
[2022-05-17 18:54:21] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:54:21] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-17 18:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:54:25] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 3594 ms to find 0 implicit places.
[2022-05-17 18:54:25] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-17 18:54:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:54:25] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-17 18:54:25] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7283 resets, run finished after 995 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:54:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:54:26] [INFO ] Computed 82 place invariants in 30 ms
[2022-05-17 18:54:26] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:54:26] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 18:54:26] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:54:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:54:26] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:54:27] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:54:27] [INFO ] After 101ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:54:27] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 247 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:54:33] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2022-05-17 18:54:33] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:54:44] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:54:48] [INFO ] Deduced a trap composed of 243 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:54:48] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:54:48] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:54:48] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:54:49] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:54:50] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2022-05-17 18:54:50] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:54:50] [INFO ] Deduced a trap composed of 249 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:54:51] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 3 ms to minimize.
[2022-05-17 18:54:51] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:54:52] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2022-05-17 18:54:52] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:54:52] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:54:53] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:54:53] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:54:53] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:54:54] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:54:55] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:54:56] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:54:56] [INFO ] Deduced a trap composed of 249 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:54:57] [INFO ] Deduced a trap composed of 249 places in 264 ms of which 0 ms to minimize.
[2022-05-17 18:54:57] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:54:57] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2022-05-17 18:54:58] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:54:58] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:54:58] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:54:59] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:54:59] [INFO ] Deduced a trap composed of 243 places in 248 ms of which 1 ms to minimize.
[2022-05-17 18:55:02] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:55:03] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:55:04] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:55:05] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:55:06] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2022-05-17 18:55:06] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:55:07] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:55:08] [INFO ] Deduced a trap composed of 244 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:55:09] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:55:09] [INFO ] Deduced a trap composed of 251 places in 251 ms of which 0 ms to minimize.
[2022-05-17 18:55:11] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:55:14] [INFO ] Deduced a trap composed of 251 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:55:15] [INFO ] Deduced a trap composed of 252 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:55:15] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:55:16] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:55:17] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:55:26] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 59081 ms
[2022-05-17 18:55:26] [INFO ] After 59231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:55:26] [INFO ] After 60097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 748 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469689 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469689 steps, saw 75945 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:55:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:55:29] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-17 18:55:30] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:55:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:55:30] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:55:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:55:30] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:55:30] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:55:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:55:30] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:55:31] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:55:31] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 0 ms to minimize.
[2022-05-17 18:55:31] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 0 ms to minimize.
[2022-05-17 18:55:32] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:55:32] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2022-05-17 18:55:32] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 1 ms to minimize.
[2022-05-17 18:55:33] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:55:33] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2022-05-17 18:55:33] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:55:34] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:55:34] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:55:34] [INFO ] Deduced a trap composed of 241 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:55:35] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:55:35] [INFO ] Deduced a trap composed of 247 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:55:36] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 0 ms to minimize.
[2022-05-17 18:55:36] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:55:36] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:55:37] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:55:37] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:55:37] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 0 ms to minimize.
[2022-05-17 18:55:38] [INFO ] Deduced a trap composed of 245 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:55:38] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2022-05-17 18:55:38] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:55:39] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:55:40] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:55:41] [INFO ] Deduced a trap composed of 246 places in 250 ms of which 0 ms to minimize.
[2022-05-17 18:55:41] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2022-05-17 18:55:41] [INFO ] Deduced a trap composed of 238 places in 247 ms of which 0 ms to minimize.
[2022-05-17 18:55:42] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:55:47] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:55:51] [INFO ] Deduced a trap composed of 243 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:55:51] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 0 ms to minimize.
[2022-05-17 18:55:52] [INFO ] Deduced a trap composed of 243 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:55:52] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:55:52] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:55:53] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2022-05-17 18:55:53] [INFO ] Deduced a trap composed of 247 places in 248 ms of which 0 ms to minimize.
[2022-05-17 18:55:54] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:55:54] [INFO ] Deduced a trap composed of 246 places in 255 ms of which 1 ms to minimize.
[2022-05-17 18:55:54] [INFO ] Deduced a trap composed of 244 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:55:55] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 24047 ms
[2022-05-17 18:55:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:55:55] [INFO ] After 25014ms 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 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2022-05-17 18:55:55] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:55:55] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-17 18:55:55] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 477517 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477517 steps, saw 77246 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:55:58] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:55:58] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-17 18:55:58] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:55:58] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 18:55:58] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:55:58] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2022-05-17 18:55:58] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:55:59] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:55:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:55:59] [INFO ] After 94ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:56:00] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:56:00] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 0 ms to minimize.
[2022-05-17 18:56:00] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2022-05-17 18:56:01] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 0 ms to minimize.
[2022-05-17 18:56:01] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 0 ms to minimize.
[2022-05-17 18:56:01] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 1 ms to minimize.
[2022-05-17 18:56:01] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:56:02] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2022-05-17 18:56:02] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2022-05-17 18:56:03] [INFO ] Deduced a trap composed of 240 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:56:03] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 0 ms to minimize.
[2022-05-17 18:56:03] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 1 ms to minimize.
[2022-05-17 18:56:04] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2022-05-17 18:56:04] [INFO ] Deduced a trap composed of 247 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:56:04] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:56:05] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2022-05-17 18:56:05] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2022-05-17 18:56:05] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:56:06] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2022-05-17 18:56:06] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:56:06] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 1 ms to minimize.
[2022-05-17 18:56:07] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2022-05-17 18:56:07] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2022-05-17 18:56:07] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:56:09] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2022-05-17 18:56:09] [INFO ] Deduced a trap composed of 246 places in 257 ms of which 0 ms to minimize.
[2022-05-17 18:56:10] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:56:10] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2022-05-17 18:56:11] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 0 ms to minimize.
[2022-05-17 18:56:16] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 1 ms to minimize.
[2022-05-17 18:56:20] [INFO ] Deduced a trap composed of 243 places in 264 ms of which 0 ms to minimize.
[2022-05-17 18:56:20] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 0 ms to minimize.
[2022-05-17 18:56:20] [INFO ] Deduced a trap composed of 243 places in 254 ms of which 1 ms to minimize.
[2022-05-17 18:56:21] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2022-05-17 18:56:21] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2022-05-17 18:56:21] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2022-05-17 18:56:22] [INFO ] Deduced a trap composed of 247 places in 252 ms of which 1 ms to minimize.
[2022-05-17 18:56:22] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2022-05-17 18:56:23] [INFO ] Deduced a trap composed of 246 places in 291 ms of which 1 ms to minimize.
[2022-05-17 18:56:23] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 1 ms to minimize.
[2022-05-17 18:56:23] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 24044 ms
[2022-05-17 18:56:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:56:23] [INFO ] After 25014ms 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 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 21 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2022-05-17 18:56:23] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:56:23] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-17 18:56:24] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-05-17 18:56:24] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:56:24] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-17 18:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:56:27] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 3951 ms to find 0 implicit places.
[2022-05-17 18:56:27] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-17 18:56:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-17 18:56:27] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-17 18:56:28] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
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 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 107 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2022-05-17 18:56:28] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-17 18:56:28] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2022-05-17 18:56:28] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:56:28] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:56:28] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2022-05-17 18:56:28] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:56:29] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:56:29] [INFO ] Deduced a trap composed of 238 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:56:30] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 1 ms to minimize.
[2022-05-17 18:56:30] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:56:30] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:56:31] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:31] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:56:31] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:31] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:56:32] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:32] [INFO ] Deduced a trap composed of 238 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:32] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:32] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:56:33] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:33] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:33] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:33] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:34] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:34] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:56:34] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:35] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:56:35] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:56:35] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 0 ms to minimize.
[2022-05-17 18:56:35] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:36] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:36] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:36] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:36] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:37] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:37] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:37] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:56:37] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 0 ms to minimize.
[2022-05-17 18:56:38] [INFO ] Deduced a trap composed of 224 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:56:38] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:56:38] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 0 ms to minimize.
[2022-05-17 18:56:38] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:56:39] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:56:39] [INFO ] Deduced a trap composed of 228 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:56:39] [INFO ] Deduced a trap composed of 238 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:56:40] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:56:40] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:40] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:56:40] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:56:41] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:41] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:41] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:56:41] [INFO ] Deduced a trap composed of 226 places in 232 ms of which 0 ms to minimize.
[2022-05-17 18:56:42] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:42] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:42] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:56:42] [INFO ] Deduced a trap composed of 244 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:43] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:56:43] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:56:43] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:56:44] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:56:44] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:44] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:56:44] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:45] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:56:45] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:45] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:56:46] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:46] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:46] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:46] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:56:47] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:56:47] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:47] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:56:47] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:48] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:48] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 0 ms to minimize.
[2022-05-17 18:56:48] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:48] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:49] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:56:49] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:56:49] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:56:50] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:56:50] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:50] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:50] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:56:51] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:51] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:56:51] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:56:51] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:56:52] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:56:52] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:56:52] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:56:52] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:56:53] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:56:53] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:56:53] [INFO ] Deduced a trap composed of 234 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:56:54] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:56:54] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:56:55] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:56:57] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:56:57] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:56:59] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:56:59] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:56:59] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:57:03] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:57:03] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:57:03] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:57:04] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:57:04] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:57:04] [INFO ] Deduced a trap composed of 224 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:57:04] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:57:05] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:57:05] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:57:05] [INFO ] Deduced a trap composed of 226 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:57:07] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:57:08] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:57:08] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:57:08] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:57:09] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:57:09] [INFO ] Deduced a trap composed of 228 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:57:09] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:57:09] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:57:10] [INFO ] Deduced a trap composed of 226 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:57:11] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:57:20] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 50677 ms
[2022-05-17 18:57:20] [INFO ] After 52017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:57:20] [INFO ] After 52121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:57:21] [INFO ] Flatten gal took : 192 ms
[2022-05-17 18:57:21] [INFO ] Flatten gal took : 155 ms
[2022-05-17 18:57:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14088057535809826261.gal : 29 ms
[2022-05-17 18:57:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16174578367069606557.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16314962892935094897;'/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/ReachabilityCardinality14088057535809826261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16174578367069606557.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/ReachabilityCardinality16174578367069606557.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 70
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :70 after 72
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :72 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 78
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :81 after 86
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86 after 113
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :113 after 754
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :754 after 788
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :788 after 856
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :856 after 1072
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1072 after 34520
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :34520 after 36636
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :36636 after 46494
Detected timeout of ITS tools.
[2022-05-17 18:57:36] [INFO ] Flatten gal took : 83 ms
[2022-05-17 18:57:36] [INFO ] Applying decomposition
[2022-05-17 18:57:36] [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/graph10784092576215874109.txt' '-o' '/tmp/graph10784092576215874109.bin' '-w' '/tmp/graph10784092576215874109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10784092576215874109.bin' '-l' '-1' '-v' '-w' '/tmp/graph10784092576215874109.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:57:36] [INFO ] Decomposing Gal with order
[2022-05-17 18:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:57:37] [INFO ] Removed a total of 1380 redundant transitions.
[2022-05-17 18:57:37] [INFO ] Flatten gal took : 521 ms
[2022-05-17 18:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 621 labels/synchronizations in 55 ms.
[2022-05-17 18:57:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11551504999043586850.gal : 19 ms
[2022-05-17 18:57:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2587281761132340093.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16314962892935094897;'/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/ReachabilityCardinality11551504999043586850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2587281761132340093.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/ReachabilityCardinality2587281761132340093.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10704892059436279459
[2022-05-17 18:57:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10704892059436279459
Running compilation step : cd /tmp/ltsmin10704892059436279459;'/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 2534 ms.
Running link step : cd /tmp/ltsmin10704892059436279459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10704892059436279459;'/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 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 108 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2022-05-17 18:58:07] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-17 18:58:07] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-17 18:58:07] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:58:07] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:58:07] [INFO ] [Nat]Absence check using 75 positive place invariants in 13 ms returned sat
[2022-05-17 18:58:07] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:58:08] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:58:09] [INFO ] Deduced a trap composed of 238 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:09] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:09] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:09] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:58:10] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:10] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:58:10] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:10] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:11] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:58:11] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:11] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:58:12] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:12] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 3 ms to minimize.
[2022-05-17 18:58:12] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:58:12] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:58:13] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:58:13] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:58:13] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:58:13] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:58:14] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:58:14] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:14] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 1 ms to minimize.
[2022-05-17 18:58:14] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:15] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:58:15] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:58:15] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:16] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:58:16] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:16] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:58:16] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:58:17] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:17] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:58:17] [INFO ] Deduced a trap composed of 226 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:58:17] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:58:18] [INFO ] Deduced a trap composed of 228 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:58:18] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:18] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:58:18] [INFO ] Deduced a trap composed of 238 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:58:19] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:19] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:19] [INFO ] Deduced a trap composed of 232 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:19] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:20] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:20] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:58:20] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:58:21] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:21] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:21] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:21] [INFO ] Deduced a trap composed of 232 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:22] [INFO ] Deduced a trap composed of 244 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:22] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:22] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:22] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:58:23] [INFO ] Deduced a trap composed of 232 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:23] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:58:23] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:24] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 1 ms to minimize.
[2022-05-17 18:58:24] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:58:24] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:58:24] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:25] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:58:25] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:25] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:25] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:58:26] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:58:26] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:58:26] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:27] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:27] [INFO ] Deduced a trap composed of 224 places in 229 ms of which 1 ms to minimize.
[2022-05-17 18:58:27] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:58:27] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:28] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:28] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:58:28] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:58:28] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:29] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:58:29] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:58:29] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:58:29] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:58:30] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 1 ms to minimize.
[2022-05-17 18:58:30] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:58:30] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:58:31] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:31] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:58:31] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:58:31] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:58:32] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:32] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:58:32] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:32] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:58:33] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:58:33] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:58:34] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:58:36] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:58:36] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:58:38] [INFO ] Deduced a trap composed of 232 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:58:38] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:58:38] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:42] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:58:42] [INFO ] Deduced a trap composed of 224 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:58:42] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:58:43] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:58:43] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:43] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 0 ms to minimize.
[2022-05-17 18:58:44] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:58:44] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:58:44] [INFO ] Deduced a trap composed of 232 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:58:44] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:58:46] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 0 ms to minimize.
[2022-05-17 18:58:47] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:58:47] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:58:48] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:48] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:58:48] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:58:48] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:58:49] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:58:49] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:58:50] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:58:59] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 50727 ms
[2022-05-17 18:58:59] [INFO ] After 52052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:58:59] [INFO ] After 52168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:59:00] [INFO ] Flatten gal took : 70 ms
[2022-05-17 18:59:00] [INFO ] Flatten gal took : 67 ms
[2022-05-17 18:59:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16818934641114412806.gal : 9 ms
[2022-05-17 18:59:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3073354489972893681.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/ReachabilityCardinality16818934641114412806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3073354489972893681.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/ReachabilityCardinality3073354489972893681.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 70
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :70 after 72
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :72 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 78
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :81 after 86
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86 after 113
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :113 after 754
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :754 after 788
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :788 after 856
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :856 after 1072
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1072 after 34520
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :34520 after 36636
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :36636 after 46494
Detected timeout of ITS tools.
[2022-05-17 18:59:15] [INFO ] Flatten gal took : 64 ms
[2022-05-17 18:59:15] [INFO ] Applying decomposition
[2022-05-17 18:59:15] [INFO ] Flatten gal took : 65 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/graph16092441137574750512.txt' '-o' '/tmp/graph16092441137574750512.bin' '-w' '/tmp/graph16092441137574750512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16092441137574750512.bin' '-l' '-1' '-v' '-w' '/tmp/graph16092441137574750512.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:59:15] [INFO ] Decomposing Gal with order
[2022-05-17 18:59:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:59:15] [INFO ] Removed a total of 3447 redundant transitions.
[2022-05-17 18:59:15] [INFO ] Flatten gal took : 139 ms
[2022-05-17 18:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 53 ms.
[2022-05-17 18:59:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10604597464149844684.gal : 93 ms
[2022-05-17 18:59:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7805647401577462579.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/ReachabilityCardinality10604597464149844684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7805647401577462579.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/ReachabilityCardinality7805647401577462579.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3.99218e+06
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3.99218e+06 after 3.99219e+06
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3.99219e+06 after 3.99219e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3.99219e+06 after 3.9922e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.9922e+06 after 4.7929e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1071864539061429286
[2022-05-17 18:59:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1071864539061429286
Running compilation step : cd /tmp/ltsmin1071864539061429286;'/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 2459 ms.
Running link step : cd /tmp/ltsmin1071864539061429286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1071864539061429286;'/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:59:46] [INFO ] Flatten gal took : 56 ms
[2022-05-17 18:59:46] [INFO ] Flatten gal took : 70 ms
[2022-05-17 18:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7782357965903805544.gal : 8 ms
[2022-05-17 18:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11024394967114041162.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/ReachabilityFireability7782357965903805544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11024394967114041162.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/ReachabilityFireability11024394967114041162.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2022-05-17 18:59:49] [INFO ] Flatten gal took : 55 ms
[2022-05-17 18:59:49] [INFO ] Applying decomposition
[2022-05-17 18:59:49] [INFO ] Flatten gal took : 55 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/graph16040485593708532145.txt' '-o' '/tmp/graph16040485593708532145.bin' '-w' '/tmp/graph16040485593708532145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16040485593708532145.bin' '-l' '-1' '-v' '-w' '/tmp/graph16040485593708532145.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:59:49] [INFO ] Decomposing Gal with order
[2022-05-17 18:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:59:49] [INFO ] Removed a total of 3162 redundant transitions.
[2022-05-17 18:59:49] [INFO ] Flatten gal took : 115 ms
[2022-05-17 18:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 32 ms.
[2022-05-17 18:59:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9153210180298610243.gal : 11 ms
[2022-05-17 18:59:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9537676686310204820.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/ReachabilityFireability9153210180298610243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9537676686310204820.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/ReachabilityFireability9537676686310204820.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14555308940708600646
[2022-05-17 18:59:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14555308940708600646
Running compilation step : cd /tmp/ltsmin14555308940708600646;'/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/ltsmin14555308940708600646;'/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/ltsmin14555308940708600646;'/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:59:54] [INFO ] Flatten gal took : 60 ms
[2022-05-17 18:59:54] [INFO ] Flatten gal took : 57 ms
[2022-05-17 18:59:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5968551961686588510.gal : 8 ms
[2022-05-17 18:59:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3297835852587372152.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/ReachabilityFireability5968551961686588510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3297835852587372152.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/ReachabilityFireability3297835852587372152.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52516 after 155030
Detected timeout of ITS tools.
[2022-05-17 19:00:24] [INFO ] Flatten gal took : 52 ms
[2022-05-17 19:00:24] [INFO ] Applying decomposition
[2022-05-17 19:00:25] [INFO ] Flatten gal took : 51 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/graph11834306511292453475.txt' '-o' '/tmp/graph11834306511292453475.bin' '-w' '/tmp/graph11834306511292453475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11834306511292453475.bin' '-l' '-1' '-v' '-w' '/tmp/graph11834306511292453475.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:00:25] [INFO ] Decomposing Gal with order
[2022-05-17 19:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:00:25] [INFO ] Removed a total of 3070 redundant transitions.
[2022-05-17 19:00:25] [INFO ] Flatten gal took : 107 ms
[2022-05-17 19:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 22 ms.
[2022-05-17 19:00:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5887776252691671721.gal : 8 ms
[2022-05-17 19:00:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14333598576468676231.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/ReachabilityFireability5887776252691671721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14333598576468676231.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/ReachabilityFireability14333598576468676231.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 4022
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4022 after 4022
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4022 after 4024
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4024 after 4346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4346 after 4646
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4646 after 16164
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :16164 after 133212
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :133212 after 291796
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :291796 after 640425
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2225209158550763955
[2022-05-17 19:00:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2225209158550763955
Running compilation step : cd /tmp/ltsmin2225209158550763955;'/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 2422 ms.
Running link step : cd /tmp/ltsmin2225209158550763955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2225209158550763955;'/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 19:01:25] [INFO ] Flatten gal took : 53 ms
[2022-05-17 19:01:25] [INFO ] Flatten gal took : 53 ms
[2022-05-17 19:01:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2663681812196746149.gal : 6 ms
[2022-05-17 19:01:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10895277442312844943.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/ReachabilityFireability2663681812196746149.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10895277442312844943.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/ReachabilityFireability10895277442312844943.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52516 after 155030
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :155030 after 510246
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :510246 after 1.18005e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.18005e+06 after 2.83108e+06
Detected timeout of ITS tools.
[2022-05-17 19:06:25] [INFO ] Flatten gal took : 72 ms
[2022-05-17 19:06:25] [INFO ] Applying decomposition
[2022-05-17 19:06:25] [INFO ] Flatten gal took : 51 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/graph1883471344031877975.txt' '-o' '/tmp/graph1883471344031877975.bin' '-w' '/tmp/graph1883471344031877975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1883471344031877975.bin' '-l' '-1' '-v' '-w' '/tmp/graph1883471344031877975.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:06:26] [INFO ] Decomposing Gal with order
[2022-05-17 19:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:06:26] [INFO ] Removed a total of 3072 redundant transitions.
[2022-05-17 19:06:26] [INFO ] Flatten gal took : 117 ms
[2022-05-17 19:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 25 ms.
[2022-05-17 19:06:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14206626413445125670.gal : 8 ms
[2022-05-17 19:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10261939575100010820.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/ReachabilityFireability14206626413445125670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10261939575100010820.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...300
Loading property file /tmp/ReachabilityFireability10261939575100010820.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2253519575448026743
[2022-05-17 19:11:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2253519575448026743
Running compilation step : cd /tmp/ltsmin2253519575448026743;'/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 2465 ms.
Running link step : cd /tmp/ltsmin2253519575448026743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2253519575448026743;'/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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.027: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.030: There are 1252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 580, there are 1251 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.027: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.126: ~5 levels ~960 states ~8456 transitions
pins2lts-mc-linux64( 0/ 8), 0.164: ~5 levels ~1920 states ~15632 transitions
pins2lts-mc-linux64( 0/ 8), 0.364: ~7 levels ~3840 states ~43096 transitions
pins2lts-mc-linux64( 1/ 8), 0.581: ~4 levels ~7680 states ~43976 transitions
pins2lts-mc-linux64( 1/ 8), 0.891: ~5 levels ~15360 states ~66760 transitions
pins2lts-mc-linux64( 1/ 8), 1.421: ~6 levels ~30720 states ~108728 transitions
pins2lts-mc-linux64( 1/ 8), 2.343: ~8 levels ~61440 states ~160424 transitions
pins2lts-mc-linux64( 1/ 8), 4.164: ~12 levels ~122880 states ~479080 transitions
pins2lts-mc-linux64( 1/ 8), 7.537: ~13 levels ~245760 states ~1405864 transitions
pins2lts-mc-linux64( 1/ 8), 14.023: ~14 levels ~491520 states ~3152216 transitions
pins2lts-mc-linux64( 1/ 8), 27.028: ~14 levels ~983040 states ~6336440 transitions
pins2lts-mc-linux64( 1/ 8), 53.064: ~15 levels ~1966080 states ~12079992 transitions
pins2lts-mc-linux64( 1/ 8), 104.872: ~17 levels ~3932160 states ~22055368 transitions
pins2lts-mc-linux64( 4/ 8), 158.328: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 159.375:
pins2lts-mc-linux64( 0/ 8), 159.375: mean standard work distribution: 12.1% (states) 47.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 159.375:
pins2lts-mc-linux64( 0/ 8), 159.375: Explored 5174711 states 69096406 transitions, fanout: 13.353
pins2lts-mc-linux64( 0/ 8), 159.375: Total exploration time 159.330 sec (158.310 sec minimum, 158.539 sec on average)
pins2lts-mc-linux64( 0/ 8), 159.375: States per second: 32478, Transitions per second: 433669
pins2lts-mc-linux64( 0/ 8), 159.375:
pins2lts-mc-linux64( 0/ 8), 159.375: Queue width: 8B, total height: 18044988, memory: 137.67MB
pins2lts-mc-linux64( 0/ 8), 159.375: Tree memory: 430.8MB, 19.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 159.375: Tree fill ratio (roots/leafs): 17.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 159.375: Stored 1285 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 159.375: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 159.375: Est. total memory use: 568.5MB (~1161.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2253519575448026743;'/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/ltsmin2253519575448026743;'/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 19:14:08] [INFO ] Flatten gal took : 53 ms
[2022-05-17 19:14:08] [INFO ] Flatten gal took : 50 ms
[2022-05-17 19:14:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5719888206000505597.gal : 5 ms
[2022-05-17 19:14:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1264080127025574098.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/ReachabilityFireability5719888206000505597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1264080127025574098.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/ReachabilityFireability1264080127025574098.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52516 after 155030
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :155030 after 510246
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :510246 after 1.18005e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.18005e+06 after 2.83108e+06

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-S10J30"
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-S10J30, 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-165277024500487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 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 ;