Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 45K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621011434056

Running Version 0
[2021-05-14 16:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 16:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 16:57:15] [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.
[2021-05-14 16:57:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 16:57:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 565 ms
[2021-05-14 16:57:16] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-5-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 16:57:16] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 4 ms.
[2021-05-14 16:57:16] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2634113178883858036.dot
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100003 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=943 ) properties (out of 14) seen :11
Running SMT prover for 3 properties.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 16:57:16] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-14 16:57:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
FORMULA Peterson-COL-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 16:57:16] [INFO ] Flatten gal took : 15 ms
[2021-05-14 16:57:16] [INFO ] Flatten gal took : 2 ms
[2021-05-14 16:57:16] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions in 29 ms.
[2021-05-14 16:57:16] [INFO ] Unfolded HLPN properties in 2 ms.
Successfully produced net in file /tmp/petri1001_10539815103864773163.dot
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 11) seen :3
FORMULA Peterson-COL-5-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :1
FORMULA Peterson-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :2
FORMULA Peterson-COL-5-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :1
FORMULA Peterson-COL-5-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2021-05-14 16:57:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 16:57:17] [INFO ] Computed 23 place invariants in 17 ms
[2021-05-14 16:57:17] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-14 16:57:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:17] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-14 16:57:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:57:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-14 16:57:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:18] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-14 16:57:18] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 16:57:18] [INFO ] [Nat]Added 230 Read/Feed constraints in 57 ms returned sat
[2021-05-14 16:57:18] [INFO ] Deduced a trap composed of 127 places in 277 ms of which 4 ms to minimize.
[2021-05-14 16:57:18] [INFO ] Deduced a trap composed of 183 places in 275 ms of which 2 ms to minimize.
[2021-05-14 16:57:19] [INFO ] Deduced a trap composed of 95 places in 263 ms of which 2 ms to minimize.
[2021-05-14 16:57:19] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 2 ms to minimize.
[2021-05-14 16:57:19] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 1 ms to minimize.
[2021-05-14 16:57:20] [INFO ] Deduced a trap composed of 100 places in 249 ms of which 0 ms to minimize.
[2021-05-14 16:57:20] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
[2021-05-14 16:57:20] [INFO ] Deduced a trap composed of 67 places in 304 ms of which 2 ms to minimize.
[2021-05-14 16:57:21] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 1 ms to minimize.
[2021-05-14 16:57:21] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 1 ms to minimize.
[2021-05-14 16:57:21] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 1 ms to minimize.
[2021-05-14 16:57:22] [INFO ] Deduced a trap composed of 143 places in 226 ms of which 0 ms to minimize.
[2021-05-14 16:57:22] [INFO ] Deduced a trap composed of 119 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:57:22] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 1 ms to minimize.
[2021-05-14 16:57:22] [INFO ] Deduced a trap composed of 127 places in 227 ms of which 1 ms to minimize.
[2021-05-14 16:57:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 16:57:23] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:23] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Real]Added 230 Read/Feed constraints in 42 ms returned sat
[2021-05-14 16:57:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:57:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:23] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-14 16:57:23] [INFO ] [Nat]Added 230 Read/Feed constraints in 58 ms returned sat
[2021-05-14 16:57:24] [INFO ] Deduced a trap composed of 96 places in 278 ms of which 1 ms to minimize.
[2021-05-14 16:57:24] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 1 ms to minimize.
[2021-05-14 16:57:24] [INFO ] Deduced a trap composed of 90 places in 250 ms of which 1 ms to minimize.
[2021-05-14 16:57:25] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 1 ms to minimize.
[2021-05-14 16:57:25] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 1 ms to minimize.
[2021-05-14 16:57:25] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2021-05-14 16:57:25] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 2 ms to minimize.
[2021-05-14 16:57:26] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 1 ms to minimize.
[2021-05-14 16:57:26] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2021-05-14 16:57:26] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
[2021-05-14 16:57:27] [INFO ] Deduced a trap composed of 255 places in 278 ms of which 0 ms to minimize.
[2021-05-14 16:57:27] [INFO ] Deduced a trap composed of 194 places in 254 ms of which 1 ms to minimize.
[2021-05-14 16:57:27] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2021-05-14 16:57:28] [INFO ] Deduced a trap composed of 188 places in 250 ms of which 1 ms to minimize.
[2021-05-14 16:57:28] [INFO ] Deduced a trap composed of 219 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:57:28] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 1 ms to minimize.
[2021-05-14 16:57:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 16:57:28] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:57:28] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 16:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:29] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-14 16:57:29] [INFO ] [Real]Added 230 Read/Feed constraints in 43 ms returned sat
[2021-05-14 16:57:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:57:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:57:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 16:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:29] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-14 16:57:29] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 16:57:29] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 0 ms to minimize.
[2021-05-14 16:57:30] [INFO ] Deduced a trap composed of 227 places in 255 ms of which 0 ms to minimize.
[2021-05-14 16:57:30] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 2 ms to minimize.
[2021-05-14 16:57:30] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 1 ms to minimize.
[2021-05-14 16:57:30] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 0 ms to minimize.
[2021-05-14 16:57:31] [INFO ] Deduced a trap composed of 115 places in 218 ms of which 1 ms to minimize.
[2021-05-14 16:57:31] [INFO ] Deduced a trap composed of 276 places in 241 ms of which 1 ms to minimize.
[2021-05-14 16:57:31] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 1 ms to minimize.
[2021-05-14 16:57:32] [INFO ] Deduced a trap composed of 56 places in 247 ms of which 0 ms to minimize.
[2021-05-14 16:57:32] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 1 ms to minimize.
[2021-05-14 16:57:32] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 0 ms to minimize.
[2021-05-14 16:57:32] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 1 ms to minimize.
[2021-05-14 16:57:33] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 1 ms to minimize.
[2021-05-14 16:57:33] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 0 ms to minimize.
[2021-05-14 16:57:33] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 1 ms to minimize.
[2021-05-14 16:57:34] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 0 ms to minimize.
[2021-05-14 16:57:34] [INFO ] Deduced a trap composed of 85 places in 259 ms of which 1 ms to minimize.
[2021-05-14 16:57:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 16:57:34] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 16:57:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:34] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-14 16:57:34] [INFO ] [Real]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 16:57:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:57:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 16:57:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:57:35] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-14 16:57:35] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 16:57:35] [INFO ] Deduced a trap composed of 108 places in 231 ms of which 1 ms to minimize.
[2021-05-14 16:57:35] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 1 ms to minimize.
[2021-05-14 16:57:36] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 1 ms to minimize.
[2021-05-14 16:57:36] [INFO ] Deduced a trap composed of 159 places in 233 ms of which 1 ms to minimize.
[2021-05-14 16:57:36] [INFO ] Deduced a trap composed of 108 places in 238 ms of which 0 ms to minimize.
[2021-05-14 16:57:37] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2021-05-14 16:57:37] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 1 ms to minimize.
[2021-05-14 16:57:37] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 1 ms to minimize.
[2021-05-14 16:57:37] [INFO ] Deduced a trap composed of 129 places in 237 ms of which 0 ms to minimize.
[2021-05-14 16:57:38] [INFO ] Deduced a trap composed of 93 places in 260 ms of which 1 ms to minimize.
[2021-05-14 16:57:38] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 1 ms to minimize.
[2021-05-14 16:57:38] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 0 ms to minimize.
[2021-05-14 16:57:38] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 0 ms to minimize.
[2021-05-14 16:57:39] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2021-05-14 16:57:39] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 0 ms to minimize.
[2021-05-14 16:57:39] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2021-05-14 16:57:40] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2021-05-14 16:57:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Fused 4 Parikh solutions to 1 different solutions.
Support contains 792 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 41 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2021-05-14 16:57:40] [INFO ] Flatten gal took : 96 ms
[2021-05-14 16:57:40] [INFO ] Flatten gal took : 81 ms
[2021-05-14 16:57:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7471956768138847451.gal : 21 ms
[2021-05-14 16:57:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6175433731263034130.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7471956768138847451.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6175433731263034130.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7471956768138847451.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6175433731263034130.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6175433731263034130.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 18
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :18 after 36
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :36 after 42
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :42 after 214
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :214 after 268
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :268 after 488
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :488 after 1722
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1722 after 4638
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4638 after 23001
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :23001 after 112784
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :112784 after 177422
Detected timeout of ITS tools.
[2021-05-14 16:57:55] [INFO ] Flatten gal took : 61 ms
[2021-05-14 16:57:55] [INFO ] Applying decomposition
[2021-05-14 16:57:55] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8873879021729004853.txt, -o, /tmp/graph8873879021729004853.bin, -w, /tmp/graph8873879021729004853.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8873879021729004853.bin, -l, -1, -v, -w, /tmp/graph8873879021729004853.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:57:56] [INFO ] Decomposing Gal with order
[2021-05-14 16:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:57:57] [INFO ] Removed a total of 654 redundant transitions.
[2021-05-14 16:57:57] [INFO ] Flatten gal took : 966 ms
[2021-05-14 16:57:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 38 ms.
[2021-05-14 16:57:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2571266104708232277.gal : 11 ms
[2021-05-14 16:57:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4761886067909899004.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2571266104708232277.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4761886067909899004.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2571266104708232277.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4761886067909899004.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4761886067909899004.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :5 after 16
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16 after 26
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :26 after 32
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :32 after 64
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :64 after 290
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :290 after 402
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :402 after 634
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :634 after 2339
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2339 after 7096
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :7096 after 14327
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :14327 after 33646
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1287199869910697194
[2021-05-14 16:58:12] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1287199869910697194
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1287199869910697194]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1287199869910697194] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1287199869910697194] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6199 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 857159 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :{}
Interrupted Best-First random walk after 660472 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1185 ms. (steps per millisecond=843 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4954 ms. (steps per millisecond=201 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5946675 steps, run timeout after 30003 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 5946675 steps, saw 995167 distinct states, run finished after 30003 ms. (steps per millisecond=198 ) properties seen :{}
Running SMT prover for 4 properties.
[2021-05-14 16:59:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 16:59:06] [INFO ] Computed 23 place invariants in 13 ms
[2021-05-14 16:59:06] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:59:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:59:06] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-14 16:59:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:59:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:59:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:59:07] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2021-05-14 16:59:07] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 16:59:07] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 16:59:07] [INFO ] Deduced a trap composed of 127 places in 269 ms of which 0 ms to minimize.
[2021-05-14 16:59:07] [INFO ] Deduced a trap composed of 183 places in 260 ms of which 2 ms to minimize.
[2021-05-14 16:59:08] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 4 ms to minimize.
[2021-05-14 16:59:08] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 0 ms to minimize.
[2021-05-14 16:59:08] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 1 ms to minimize.
[2021-05-14 16:59:08] [INFO ] Deduced a trap composed of 100 places in 249 ms of which 0 ms to minimize.
[2021-05-14 16:59:09] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2021-05-14 16:59:09] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 1 ms to minimize.
[2021-05-14 16:59:09] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 0 ms to minimize.
[2021-05-14 16:59:10] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 0 ms to minimize.
[2021-05-14 16:59:10] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 0 ms to minimize.
[2021-05-14 16:59:10] [INFO ] Deduced a trap composed of 143 places in 239 ms of which 9 ms to minimize.
[2021-05-14 16:59:10] [INFO ] Deduced a trap composed of 119 places in 226 ms of which 0 ms to minimize.
[2021-05-14 16:59:11] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 0 ms to minimize.
[2021-05-14 16:59:11] [INFO ] Deduced a trap composed of 127 places in 227 ms of which 1 ms to minimize.
[2021-05-14 16:59:11] [INFO ] Deduced a trap composed of 195 places in 212 ms of which 0 ms to minimize.
[2021-05-14 16:59:11] [INFO ] Deduced a trap composed of 127 places in 227 ms of which 0 ms to minimize.
[2021-05-14 16:59:12] [INFO ] Deduced a trap composed of 127 places in 227 ms of which 1 ms to minimize.
[2021-05-14 16:59:12] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 1 ms to minimize.
[2021-05-14 16:59:12] [INFO ] Deduced a trap composed of 199 places in 219 ms of which 1 ms to minimize.
[2021-05-14 16:59:13] [INFO ] Deduced a trap composed of 126 places in 237 ms of which 1 ms to minimize.
[2021-05-14 16:59:13] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 1 ms to minimize.
[2021-05-14 16:59:13] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 0 ms to minimize.
[2021-05-14 16:59:13] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 0 ms to minimize.
[2021-05-14 16:59:14] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 0 ms to minimize.
[2021-05-14 16:59:14] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 1 ms to minimize.
[2021-05-14 16:59:14] [INFO ] Deduced a trap composed of 153 places in 223 ms of which 0 ms to minimize.
[2021-05-14 16:59:15] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 0 ms to minimize.
[2021-05-14 16:59:15] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 0 ms to minimize.
[2021-05-14 16:59:15] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 1 ms to minimize.
[2021-05-14 16:59:15] [INFO ] Deduced a trap composed of 78 places in 227 ms of which 1 ms to minimize.
[2021-05-14 16:59:16] [INFO ] Deduced a trap composed of 101 places in 223 ms of which 0 ms to minimize.
[2021-05-14 16:59:16] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 0 ms to minimize.
[2021-05-14 16:59:16] [INFO ] Deduced a trap composed of 108 places in 222 ms of which 0 ms to minimize.
[2021-05-14 16:59:16] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 0 ms to minimize.
[2021-05-14 16:59:17] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 1 ms to minimize.
[2021-05-14 16:59:17] [INFO ] Deduced a trap composed of 217 places in 223 ms of which 0 ms to minimize.
[2021-05-14 16:59:17] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 0 ms to minimize.
[2021-05-14 16:59:18] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 1 ms to minimize.
[2021-05-14 16:59:18] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 1 ms to minimize.
[2021-05-14 16:59:18] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2021-05-14 16:59:18] [INFO ] Deduced a trap composed of 220 places in 225 ms of which 0 ms to minimize.
[2021-05-14 16:59:19] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 0 ms to minimize.
[2021-05-14 16:59:19] [INFO ] Deduced a trap composed of 134 places in 226 ms of which 0 ms to minimize.
[2021-05-14 16:59:19] [INFO ] Deduced a trap composed of 112 places in 223 ms of which 1 ms to minimize.
[2021-05-14 16:59:20] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 1 ms to minimize.
[2021-05-14 16:59:20] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2021-05-14 16:59:20] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 0 ms to minimize.
[2021-05-14 16:59:20] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:59:21] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 0 ms to minimize.
[2021-05-14 16:59:21] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 0 ms to minimize.
[2021-05-14 16:59:21] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2021-05-14 16:59:22] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 0 ms to minimize.
[2021-05-14 16:59:22] [INFO ] Deduced a trap composed of 114 places in 221 ms of which 1 ms to minimize.
[2021-05-14 16:59:23] [INFO ] Deduced a trap composed of 82 places in 240 ms of which 1 ms to minimize.
[2021-05-14 16:59:23] [INFO ] Deduced a trap composed of 127 places in 245 ms of which 1 ms to minimize.
[2021-05-14 16:59:23] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
[2021-05-14 16:59:24] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 1 ms to minimize.
[2021-05-14 16:59:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 58 trap constraints in 19495 ms
[2021-05-14 16:59:26] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:59:26] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 16:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:59:26] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-14 16:59:27] [INFO ] [Real]Added 230 Read/Feed constraints in 38 ms returned sat
[2021-05-14 16:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:59:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-14 16:59:27] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 16:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:59:27] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2021-05-14 16:59:27] [INFO ] [Nat]Added 230 Read/Feed constraints in 56 ms returned sat
[2021-05-14 16:59:27] [INFO ] Deduced a trap composed of 96 places in 276 ms of which 0 ms to minimize.
[2021-05-14 16:59:28] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 1 ms to minimize.
[2021-05-14 16:59:28] [INFO ] Deduced a trap composed of 90 places in 243 ms of which 1 ms to minimize.
[2021-05-14 16:59:28] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2021-05-14 16:59:29] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 0 ms to minimize.
[2021-05-14 16:59:29] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2021-05-14 16:59:29] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 0 ms to minimize.
[2021-05-14 16:59:29] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 0 ms to minimize.
[2021-05-14 16:59:30] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2021-05-14 16:59:30] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2021-05-14 16:59:30] [INFO ] Deduced a trap composed of 255 places in 229 ms of which 1 ms to minimize.
[2021-05-14 16:59:31] [INFO ] Deduced a trap composed of 194 places in 236 ms of which 0 ms to minimize.
[2021-05-14 16:59:31] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 1 ms to minimize.
[2021-05-14 16:59:31] [INFO ] Deduced a trap composed of 188 places in 224 ms of which 0 ms to minimize.
[2021-05-14 16:59:31] [INFO ] Deduced a trap composed of 219 places in 225 ms of which 1 ms to minimize.
[2021-05-14 16:59:32] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 1 ms to minimize.
[2021-05-14 16:59:32] [INFO ] Deduced a trap composed of 78 places in 219 ms of which 1 ms to minimize.
[2021-05-14 16:59:32] [INFO ] Deduced a trap composed of 78 places in 221 ms of which 1 ms to minimize.
[2021-05-14 16:59:32] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 0 ms to minimize.
[2021-05-14 16:59:33] [INFO ] Deduced a trap composed of 108 places in 230 ms of which 1 ms to minimize.
[2021-05-14 16:59:33] [INFO ] Deduced a trap composed of 187 places in 229 ms of which 1 ms to minimize.
[2021-05-14 16:59:33] [INFO ] Deduced a trap composed of 184 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:59:33] [INFO ] Deduced a trap composed of 119 places in 223 ms of which 0 ms to minimize.
[2021-05-14 16:59:34] [INFO ] Deduced a trap composed of 93 places in 246 ms of which 1 ms to minimize.
[2021-05-14 16:59:34] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 1 ms to minimize.
[2021-05-14 16:59:34] [INFO ] Deduced a trap composed of 82 places in 231 ms of which 1 ms to minimize.
[2021-05-14 16:59:35] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 0 ms to minimize.
[2021-05-14 16:59:35] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 0 ms to minimize.
[2021-05-14 16:59:35] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 0 ms to minimize.
[2021-05-14 16:59:35] [INFO ] Deduced a trap composed of 183 places in 230 ms of which 0 ms to minimize.
[2021-05-14 16:59:36] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 0 ms to minimize.
[2021-05-14 16:59:36] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:59:36] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 1 ms to minimize.
[2021-05-14 16:59:36] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 1 ms to minimize.
[2021-05-14 16:59:37] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2021-05-14 16:59:37] [INFO ] Deduced a trap composed of 183 places in 213 ms of which 1 ms to minimize.
[2021-05-14 16:59:37] [INFO ] Deduced a trap composed of 135 places in 206 ms of which 0 ms to minimize.
[2021-05-14 16:59:37] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 1 ms to minimize.
[2021-05-14 16:59:38] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 1 ms to minimize.
[2021-05-14 16:59:38] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2021-05-14 16:59:38] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2021-05-14 16:59:38] [INFO ] Deduced a trap composed of 123 places in 205 ms of which 0 ms to minimize.
[2021-05-14 16:59:39] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2021-05-14 16:59:39] [INFO ] Deduced a trap composed of 218 places in 191 ms of which 0 ms to minimize.
[2021-05-14 16:59:39] [INFO ] Deduced a trap composed of 134 places in 202 ms of which 1 ms to minimize.
[2021-05-14 16:59:40] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 1 ms to minimize.
[2021-05-14 16:59:40] [INFO ] Deduced a trap composed of 71 places in 262 ms of which 0 ms to minimize.
[2021-05-14 16:59:40] [INFO ] Deduced a trap composed of 106 places in 260 ms of which 1 ms to minimize.
[2021-05-14 16:59:41] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 1 ms to minimize.
[2021-05-14 16:59:41] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 1 ms to minimize.
[2021-05-14 16:59:41] [INFO ] Deduced a trap composed of 104 places in 210 ms of which 1 ms to minimize.
[2021-05-14 16:59:42] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 1 ms to minimize.
[2021-05-14 16:59:42] [INFO ] Deduced a trap composed of 130 places in 201 ms of which 1 ms to minimize.
[2021-05-14 16:59:42] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 1 ms to minimize.
[2021-05-14 16:59:42] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 1 ms to minimize.
[2021-05-14 16:59:43] [INFO ] Deduced a trap composed of 108 places in 219 ms of which 1 ms to minimize.
[2021-05-14 16:59:43] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 1 ms to minimize.
[2021-05-14 16:59:43] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 0 ms to minimize.
[2021-05-14 16:59:43] [INFO ] Deduced a trap composed of 102 places in 203 ms of which 1 ms to minimize.
[2021-05-14 16:59:44] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 0 ms to minimize.
[2021-05-14 16:59:44] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 0 ms to minimize.
[2021-05-14 16:59:44] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:59:45] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 1 ms to minimize.
[2021-05-14 16:59:45] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 0 ms to minimize.
[2021-05-14 16:59:45] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 1 ms to minimize.
[2021-05-14 16:59:45] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 1 ms to minimize.
[2021-05-14 16:59:46] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 1 ms to minimize.
[2021-05-14 16:59:46] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 0 ms to minimize.
[2021-05-14 16:59:46] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 1 ms to minimize.
[2021-05-14 16:59:46] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2021-05-14 16:59:47] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 0 ms to minimize.
[2021-05-14 16:59:47] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 1 ms to minimize.
[2021-05-14 16:59:47] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 1 ms to minimize.
[2021-05-14 16:59:48] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 0 ms to minimize.
[2021-05-14 16:59:48] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 1 ms to minimize.
[2021-05-14 16:59:48] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 1 ms to minimize.
[2021-05-14 16:59:49] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 0 ms to minimize.
[2021-05-14 16:59:49] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 0 ms to minimize.
[2021-05-14 16:59:49] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2021-05-14 16:59:49] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 0 ms to minimize.
[2021-05-14 16:59:50] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 1 ms to minimize.
[2021-05-14 16:59:50] [INFO ] Deduced a trap composed of 101 places in 190 ms of which 1 ms to minimize.
[2021-05-14 16:59:50] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 1 ms to minimize.
[2021-05-14 16:59:51] [INFO ] Deduced a trap composed of 193 places in 199 ms of which 1 ms to minimize.
[2021-05-14 16:59:51] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 1 ms to minimize.
[2021-05-14 16:59:51] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 0 ms to minimize.
[2021-05-14 16:59:51] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2021-05-14 16:59:52] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2021-05-14 16:59:52] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2021-05-14 16:59:52] [INFO ] Deduced a trap composed of 115 places in 204 ms of which 1 ms to minimize.
[2021-05-14 16:59:53] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 1 ms to minimize.
[2021-05-14 16:59:53] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 1 ms to minimize.
[2021-05-14 16:59:53] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 1 ms to minimize.
[2021-05-14 16:59:53] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 0 ms to minimize.
[2021-05-14 16:59:54] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 1 ms to minimize.
[2021-05-14 16:59:54] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 1 ms to minimize.
[2021-05-14 16:59:54] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 1 ms to minimize.
[2021-05-14 16:59:54] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 1 ms to minimize.
[2021-05-14 16:59:56] [INFO ] Deduced a trap composed of 72 places in 233 ms of which 0 ms to minimize.
[2021-05-14 16:59:56] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 1 ms to minimize.
[2021-05-14 16:59:56] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2021-05-14 16:59:57] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 1 ms to minimize.
[2021-05-14 16:59:57] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 0 ms to minimize.
[2021-05-14 16:59:57] [INFO ] Deduced a trap composed of 140 places in 212 ms of which 0 ms to minimize.
[2021-05-14 16:59:57] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2021-05-14 16:59:58] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 0 ms to minimize.
[2021-05-14 16:59:58] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 1 ms to minimize.
[2021-05-14 16:59:58] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 1 ms to minimize.
[2021-05-14 16:59:58] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 0 ms to minimize.
[2021-05-14 16:59:59] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2021-05-14 16:59:59] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 0 ms to minimize.
[2021-05-14 16:59:59] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2021-05-14 17:00:12] [INFO ] Deduced a trap composed of 2 places in 321 ms of which 1 ms to minimize.
[2021-05-14 17:00:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 17:00:12] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-14 17:00:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-14 17:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:00:12] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-14 17:00:12] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 17:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:00:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2021-05-14 17:00:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 17:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:00:13] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-14 17:00:13] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2021-05-14 17:00:13] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 0 ms to minimize.
[2021-05-14 17:00:13] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 1 ms to minimize.
[2021-05-14 17:00:14] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 1 ms to minimize.
[2021-05-14 17:00:14] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 0 ms to minimize.
[2021-05-14 17:00:14] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 0 ms to minimize.
[2021-05-14 17:00:15] [INFO ] Deduced a trap composed of 115 places in 210 ms of which 1 ms to minimize.
[2021-05-14 17:00:15] [INFO ] Deduced a trap composed of 276 places in 275 ms of which 0 ms to minimize.
[2021-05-14 17:00:15] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 0 ms to minimize.
[2021-05-14 17:00:15] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 0 ms to minimize.
[2021-05-14 17:00:16] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 1 ms to minimize.
[2021-05-14 17:00:16] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 1 ms to minimize.
[2021-05-14 17:00:16] [INFO ] Deduced a trap composed of 136 places in 273 ms of which 1 ms to minimize.
[2021-05-14 17:00:17] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 1 ms to minimize.
[2021-05-14 17:00:17] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 0 ms to minimize.
[2021-05-14 17:00:17] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 1 ms to minimize.
[2021-05-14 17:00:18] [INFO ] Deduced a trap composed of 138 places in 258 ms of which 0 ms to minimize.
[2021-05-14 17:00:18] [INFO ] Deduced a trap composed of 85 places in 229 ms of which 1 ms to minimize.
[2021-05-14 17:00:18] [INFO ] Deduced a trap composed of 134 places in 230 ms of which 0 ms to minimize.
[2021-05-14 17:00:18] [INFO ] Deduced a trap composed of 138 places in 249 ms of which 0 ms to minimize.
[2021-05-14 17:00:19] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 0 ms to minimize.
[2021-05-14 17:00:19] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 1 ms to minimize.
[2021-05-14 17:00:19] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 1 ms to minimize.
[2021-05-14 17:00:20] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 1 ms to minimize.
[2021-05-14 17:00:20] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 1 ms to minimize.
[2021-05-14 17:00:20] [INFO ] Deduced a trap composed of 163 places in 223 ms of which 1 ms to minimize.
[2021-05-14 17:00:20] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2021-05-14 17:00:21] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2021-05-14 17:00:21] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 1 ms to minimize.
[2021-05-14 17:00:21] [INFO ] Deduced a trap composed of 174 places in 215 ms of which 1 ms to minimize.
[2021-05-14 17:00:21] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 1 ms to minimize.
[2021-05-14 17:00:22] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 1 ms to minimize.
[2021-05-14 17:00:22] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 1 ms to minimize.
[2021-05-14 17:00:22] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2021-05-14 17:00:22] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 0 ms to minimize.
[2021-05-14 17:00:23] [INFO ] Deduced a trap composed of 123 places in 187 ms of which 1 ms to minimize.
[2021-05-14 17:00:23] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 0 ms to minimize.
[2021-05-14 17:00:23] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:00:23] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 1 ms to minimize.
[2021-05-14 17:00:23] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2021-05-14 17:00:24] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 0 ms to minimize.
[2021-05-14 17:00:24] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:00:24] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2021-05-14 17:00:24] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:00:24] [INFO ] Deduced a trap composed of 115 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:00:25] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:00:25] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 1 ms to minimize.
[2021-05-14 17:00:25] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 0 ms to minimize.
[2021-05-14 17:00:25] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 0 ms to minimize.
[2021-05-14 17:00:25] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 1 ms to minimize.
[2021-05-14 17:00:26] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:00:26] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:00:26] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 1 ms to minimize.
[2021-05-14 17:00:26] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2021-05-14 17:00:26] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:00:27] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2021-05-14 17:00:27] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2021-05-14 17:00:27] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 0 ms to minimize.
[2021-05-14 17:00:27] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2021-05-14 17:00:27] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2021-05-14 17:00:28] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:00:28] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 0 ms to minimize.
[2021-05-14 17:00:28] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 0 ms to minimize.
[2021-05-14 17:00:28] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 0 ms to minimize.
[2021-05-14 17:00:29] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 1 ms to minimize.
[2021-05-14 17:00:29] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2021-05-14 17:00:29] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
[2021-05-14 17:00:29] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 0 ms to minimize.
[2021-05-14 17:00:29] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2021-05-14 17:00:30] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-14 17:00:30] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-14 17:00:30] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:00:30] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2021-05-14 17:00:30] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2021-05-14 17:00:31] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2021-05-14 17:00:31] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2021-05-14 17:00:31] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 1 ms to minimize.
[2021-05-14 17:00:31] [INFO ] Deduced a trap composed of 89 places in 192 ms of which 1 ms to minimize.
[2021-05-14 17:00:32] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:00:32] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 0 ms to minimize.
[2021-05-14 17:00:32] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 1 ms to minimize.
[2021-05-14 17:00:33] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2021-05-14 17:00:33] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:00:33] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 0 ms to minimize.
[2021-05-14 17:00:33] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 0 ms to minimize.
[2021-05-14 17:00:33] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 0 ms to minimize.
[2021-05-14 17:00:34] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 0 ms to minimize.
[2021-05-14 17:00:34] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 1 ms to minimize.
[2021-05-14 17:00:34] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2021-05-14 17:00:34] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:00:35] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 0 ms to minimize.
[2021-05-14 17:00:35] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2021-05-14 17:00:35] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2021-05-14 17:00:35] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 1 ms to minimize.
[2021-05-14 17:00:36] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 0 ms to minimize.
[2021-05-14 17:00:36] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2021-05-14 17:00:37] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
[2021-05-14 17:00:37] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 0 ms to minimize.
[2021-05-14 17:00:38] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2021-05-14 17:00:38] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:00:41] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2021-05-14 17:00:41] [INFO ] Deduced a trap composed of 126 places in 186 ms of which 1 ms to minimize.
[2021-05-14 17:00:41] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 1 ms to minimize.
[2021-05-14 17:00:41] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2021-05-14 17:00:42] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:00:42] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:00:42] [INFO ] Deduced a trap composed of 192 places in 192 ms of which 0 ms to minimize.
[2021-05-14 17:00:42] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:00:43] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 0 ms to minimize.
[2021-05-14 17:00:43] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 1 ms to minimize.
[2021-05-14 17:00:43] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 1 ms to minimize.
[2021-05-14 17:00:43] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 0 ms to minimize.
[2021-05-14 17:00:44] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:00:44] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 0 ms to minimize.
[2021-05-14 17:00:45] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:00:45] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 1 ms to minimize.
[2021-05-14 17:00:45] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2021-05-14 17:00:46] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 0 ms to minimize.
[2021-05-14 17:00:47] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 0 ms to minimize.
[2021-05-14 17:00:48] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 0 ms to minimize.
[2021-05-14 17:00:49] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:00:50] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 1 ms to minimize.
[2021-05-14 17:00:50] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:00:51] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 1 ms to minimize.
[2021-05-14 17:00:51] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:00:54] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:00:54] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 0 ms to minimize.
[2021-05-14 17:00:54] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 0 ms to minimize.
[2021-05-14 17:00:55] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:00:55] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:00:55] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:00:58] [INFO ] Deduced a trap composed of 2 places in 295 ms of which 1 ms to minimize.
[2021-05-14 17:00:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 17:00:58] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 17:00:58] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 17:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:00:58] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-14 17:00:58] [INFO ] [Real]Added 230 Read/Feed constraints in 49 ms returned sat
[2021-05-14 17:00:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:00:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-14 17:00:58] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 17:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:00:59] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-14 17:00:59] [INFO ] [Nat]Added 230 Read/Feed constraints in 47 ms returned sat
[2021-05-14 17:00:59] [INFO ] Deduced a trap composed of 108 places in 224 ms of which 0 ms to minimize.
[2021-05-14 17:00:59] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 0 ms to minimize.
[2021-05-14 17:00:59] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 1 ms to minimize.
[2021-05-14 17:01:00] [INFO ] Deduced a trap composed of 159 places in 261 ms of which 1 ms to minimize.
[2021-05-14 17:01:00] [INFO ] Deduced a trap composed of 108 places in 232 ms of which 1 ms to minimize.
[2021-05-14 17:01:00] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2021-05-14 17:01:01] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 0 ms to minimize.
[2021-05-14 17:01:01] [INFO ] Deduced a trap composed of 77 places in 226 ms of which 1 ms to minimize.
[2021-05-14 17:01:01] [INFO ] Deduced a trap composed of 129 places in 230 ms of which 1 ms to minimize.
[2021-05-14 17:01:01] [INFO ] Deduced a trap composed of 93 places in 233 ms of which 1 ms to minimize.
[2021-05-14 17:01:02] [INFO ] Deduced a trap composed of 123 places in 236 ms of which 1 ms to minimize.
[2021-05-14 17:01:02] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 0 ms to minimize.
[2021-05-14 17:01:02] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 1 ms to minimize.
[2021-05-14 17:01:03] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2021-05-14 17:01:03] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 1 ms to minimize.
[2021-05-14 17:01:03] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 0 ms to minimize.
[2021-05-14 17:01:03] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 1 ms to minimize.
[2021-05-14 17:01:04] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 1 ms to minimize.
[2021-05-14 17:01:04] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2021-05-14 17:01:04] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 0 ms to minimize.
[2021-05-14 17:01:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 5482 ms
FORMULA Peterson-COL-5-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-5-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Support contains 336 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 684 transition count 1092
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 300 place count 684 transition count 1038
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 408 place count 630 transition count 1038
Applied a total of 408 rules in 98 ms. Remains 630 /834 variables (removed 204) and now considering 1038/1242 (removed 204) transitions.
Finished structural reductions, in 1 iterations. Remains : 630/834 places, 1038/1242 transitions.
[2021-05-14 17:01:04] [INFO ] Flatten gal took : 38 ms
[2021-05-14 17:01:04] [INFO ] Flatten gal took : 37 ms
[2021-05-14 17:01:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2981678630894402182.gal : 4 ms
[2021-05-14 17:01:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8828073064230533972.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2981678630894402182.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8828073064230533972.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2981678630894402182.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8828073064230533972.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8828073064230533972.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 128
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :128 after 321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :321 after 986
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :986 after 1726
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1726 after 9338
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9338 after 33796
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33796 after 48987
Detected timeout of ITS tools.
[2021-05-14 17:01:19] [INFO ] Flatten gal took : 43 ms
[2021-05-14 17:01:19] [INFO ] Applying decomposition
[2021-05-14 17:01:19] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3920883098887602304.txt, -o, /tmp/graph3920883098887602304.bin, -w, /tmp/graph3920883098887602304.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3920883098887602304.bin, -l, -1, -v, -w, /tmp/graph3920883098887602304.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 17:01:20] [INFO ] Decomposing Gal with order
[2021-05-14 17:01:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:01:20] [INFO ] Removed a total of 1045 redundant transitions.
[2021-05-14 17:01:20] [INFO ] Flatten gal took : 211 ms
[2021-05-14 17:01:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 18 ms.
[2021-05-14 17:01:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17235276680410219894.gal : 6 ms
[2021-05-14 17:01:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14417915597316670580.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17235276680410219894.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14417915597316670580.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17235276680410219894.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14417915597316670580.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14417915597316670580.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 133
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :133 after 198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :198 after 1004
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1004 after 1400
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1400 after 9107
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9107 after 12353
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12353 after 27473
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :27473 after 133783
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :133783 after 227262
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18327382056621935840
[2021-05-14 17:01:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18327382056621935840
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18327382056621935840]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18327382056621935840] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18327382056621935840] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3170 ms. (steps per millisecond=315 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 702767 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7491813 steps, run timeout after 30001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 7491813 steps, saw 1091029 distinct states, run finished after 30001 ms. (steps per millisecond=249 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 17:02:15] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 630 cols
[2021-05-14 17:02:15] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-14 17:02:15] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2021-05-14 17:02:15] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 17:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:02:15] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-14 17:02:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:02:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2021-05-14 17:02:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 17:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:02:16] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-14 17:02:16] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 17:02:16] [INFO ] [Nat]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 17:02:16] [INFO ] Deduced a trap composed of 155 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:02:16] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:16] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 1 ms to minimize.
[2021-05-14 17:02:16] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 0 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2021-05-14 17:02:17] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 0 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 1 ms to minimize.
[2021-05-14 17:02:18] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 1 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:02:19] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 0 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 144 places in 104 ms of which 0 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 1 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 1 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:02:20] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 1 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 0 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2021-05-14 17:02:21] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2021-05-14 17:02:22] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:02:22] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 0 ms to minimize.
[2021-05-14 17:02:22] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 1 ms to minimize.
[2021-05-14 17:02:22] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 0 ms to minimize.
[2021-05-14 17:02:22] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 0 ms to minimize.
[2021-05-14 17:02:23] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 1 ms to minimize.
[2021-05-14 17:02:23] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 1 ms to minimize.
[2021-05-14 17:02:23] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:02:23] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 0 ms to minimize.
[2021-05-14 17:02:23] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:02:24] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 1 ms to minimize.
[2021-05-14 17:02:24] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 1 ms to minimize.
[2021-05-14 17:02:24] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2021-05-14 17:02:24] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:02:24] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:02:25] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:25] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2021-05-14 17:02:25] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 1 ms to minimize.
[2021-05-14 17:02:25] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:02:25] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:02:26] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:26] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:02:26] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 0 ms to minimize.
[2021-05-14 17:02:26] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:02:26] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 1 ms to minimize.
[2021-05-14 17:02:27] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2021-05-14 17:02:27] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 0 ms to minimize.
[2021-05-14 17:02:27] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:02:27] [INFO ] Deduced a trap composed of 213 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:02:27] [INFO ] Deduced a trap composed of 200 places in 158 ms of which 1 ms to minimize.
[2021-05-14 17:02:28] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 1 ms to minimize.
[2021-05-14 17:02:28] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:02:28] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:02:28] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:02:28] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:02:29] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:02:29] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:02:29] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2021-05-14 17:02:29] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2021-05-14 17:02:29] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 1 ms to minimize.
[2021-05-14 17:02:30] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:02:31] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:02:31] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 1 ms to minimize.
[2021-05-14 17:02:31] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:02:31] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 0 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 1 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 1 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 1 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:02:32] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 1 ms to minimize.
[2021-05-14 17:02:33] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:02:33] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 1 ms to minimize.
[2021-05-14 17:02:33] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:02:33] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2021-05-14 17:02:33] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2021-05-14 17:02:34] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:02:34] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2021-05-14 17:02:34] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:02:34] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 0 ms to minimize.
[2021-05-14 17:02:34] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:02:35] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 0 ms to minimize.
[2021-05-14 17:02:35] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 0 ms to minimize.
[2021-05-14 17:02:35] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 0 ms to minimize.
[2021-05-14 17:02:35] [INFO ] Deduced a trap composed of 127 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:35] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2021-05-14 17:02:36] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 0 ms to minimize.
[2021-05-14 17:02:36] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:02:36] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:02:37] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:02:37] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:02:38] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2021-05-14 17:02:38] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 0 ms to minimize.
[2021-05-14 17:02:39] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:02:39] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2021-05-14 17:02:39] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:02:39] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 0 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 0 ms to minimize.
[2021-05-14 17:02:40] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:02:41] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:02:41] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 0 ms to minimize.
[2021-05-14 17:02:41] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 0 ms to minimize.
[2021-05-14 17:02:41] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2021-05-14 17:02:41] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:02:43] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 0 ms to minimize.
[2021-05-14 17:02:43] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:02:43] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:02:43] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 0 ms to minimize.
[2021-05-14 17:03:01] [INFO ] Deduced a trap composed of 2 places in 216 ms of which 1 ms to minimize.
[2021-05-14 17:03:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 17:03:01] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:03:01] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Real]Added 230 Read/Feed constraints in 33 ms returned sat
[2021-05-14 17:03:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:03:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:03:01] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-14 17:03:01] [INFO ] [Nat]Added 230 Read/Feed constraints in 36 ms returned sat
[2021-05-14 17:03:02] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:02] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:03:02] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:03:02] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:03:02] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 0 ms to minimize.
[2021-05-14 17:03:03] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2021-05-14 17:03:03] [INFO ] Deduced a trap composed of 129 places in 196 ms of which 0 ms to minimize.
[2021-05-14 17:03:03] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:03:03] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:03] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:03:04] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:03:04] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:04] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:03:04] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2021-05-14 17:03:04] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:03:05] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:03:05] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2021-05-14 17:03:05] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 1 ms to minimize.
[2021-05-14 17:03:05] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:03:06] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:03:06] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2021-05-14 17:03:06] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:06] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:03:06] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 0 ms to minimize.
[2021-05-14 17:03:07] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:03:07] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:03:07] [INFO ] Deduced a trap composed of 104 places in 190 ms of which 1 ms to minimize.
[2021-05-14 17:03:07] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 0 ms to minimize.
[2021-05-14 17:03:07] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:03:08] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2021-05-14 17:03:08] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:03:08] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 0 ms to minimize.
[2021-05-14 17:03:08] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:03:08] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 0 ms to minimize.
[2021-05-14 17:03:09] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:03:09] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 1 ms to minimize.
[2021-05-14 17:03:09] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:03:09] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 1 ms to minimize.
[2021-05-14 17:03:09] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 0 ms to minimize.
[2021-05-14 17:03:10] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2021-05-14 17:03:10] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2021-05-14 17:03:10] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:03:10] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2021-05-14 17:03:10] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:03:11] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:03:11] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:11] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2021-05-14 17:03:11] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:03:12] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:03:12] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:03:12] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:03:12] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 0 ms to minimize.
[2021-05-14 17:03:12] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 0 ms to minimize.
[2021-05-14 17:03:13] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:03:13] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:03:13] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:03:13] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2021-05-14 17:03:13] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:14] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:03:14] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:03:14] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:03:14] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:03:14] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:15] [INFO ] Deduced a trap composed of 195 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:03:15] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 1 ms to minimize.
[2021-05-14 17:03:15] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 1 ms to minimize.
[2021-05-14 17:03:15] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:03:15] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 1 ms to minimize.
[2021-05-14 17:03:16] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 1 ms to minimize.
[2021-05-14 17:03:16] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 1 ms to minimize.
[2021-05-14 17:03:16] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 0 ms to minimize.
[2021-05-14 17:03:16] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 1 ms to minimize.
[2021-05-14 17:03:17] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 0 ms to minimize.
[2021-05-14 17:03:17] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2021-05-14 17:03:17] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 0 ms to minimize.
[2021-05-14 17:03:17] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 0 ms to minimize.
[2021-05-14 17:03:18] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 1 ms to minimize.
[2021-05-14 17:03:25] [INFO ] Deduced a trap composed of 31 places in 7399 ms of which 0 ms to minimize.
[2021-05-14 17:03:25] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 1 ms to minimize.
[2021-05-14 17:03:25] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:03:26] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 1 ms to minimize.
[2021-05-14 17:03:26] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:03:26] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:03:26] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:03:26] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:03:27] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2021-05-14 17:03:27] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:03:27] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2021-05-14 17:03:27] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:03:27] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 1 ms to minimize.
[2021-05-14 17:03:28] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 0 ms to minimize.
[2021-05-14 17:03:28] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:03:28] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:03:28] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2021-05-14 17:03:28] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 0 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 0 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 0 ms to minimize.
[2021-05-14 17:03:29] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 0 ms to minimize.
[2021-05-14 17:03:30] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:03:30] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:03:30] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:03:30] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 0 ms to minimize.
[2021-05-14 17:03:30] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 1 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 0 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 1 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2021-05-14 17:03:31] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 0 ms to minimize.
[2021-05-14 17:03:32] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 0 ms to minimize.
[2021-05-14 17:03:32] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:03:32] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 1 ms to minimize.
[2021-05-14 17:03:32] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2021-05-14 17:03:32] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 1 ms to minimize.
[2021-05-14 17:03:33] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:03:33] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:03:33] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:03:33] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 1 ms to minimize.
[2021-05-14 17:03:34] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:03:34] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:03:34] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:03:34] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:03:34] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:03:35] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 1 ms to minimize.
[2021-05-14 17:03:35] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2021-05-14 17:03:35] [INFO ] Deduced a trap composed of 99 places in 224 ms of which 1 ms to minimize.
[2021-05-14 17:03:35] [INFO ] Deduced a trap composed of 98 places in 192 ms of which 1 ms to minimize.
[2021-05-14 17:03:36] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2021-05-14 17:03:36] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 1 ms to minimize.
[2021-05-14 17:03:36] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 0 ms to minimize.
[2021-05-14 17:03:36] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:03:36] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 0 ms to minimize.
[2021-05-14 17:03:37] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2021-05-14 17:03:37] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:03:37] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:03:37] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:03:38] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:03:38] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:03:38] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 1 ms to minimize.
[2021-05-14 17:03:38] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:03:39] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 0 ms to minimize.
[2021-05-14 17:03:39] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 0 ms to minimize.
[2021-05-14 17:03:39] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:03:39] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:03:40] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 0 ms to minimize.
[2021-05-14 17:03:40] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2021-05-14 17:03:40] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2021-05-14 17:03:40] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2021-05-14 17:03:41] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 0 ms to minimize.
[2021-05-14 17:03:41] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2021-05-14 17:03:41] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 1 ms to minimize.
[2021-05-14 17:03:41] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:03:42] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:03:42] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 1 ms to minimize.
[2021-05-14 17:03:42] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 1 ms to minimize.
[2021-05-14 17:03:42] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2021-05-14 17:03:43] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2021-05-14 17:03:44] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2021-05-14 17:03:44] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:03:44] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2021-05-14 17:03:44] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 0 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2021-05-14 17:03:45] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2021-05-14 17:03:46] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 0 ms to minimize.
[2021-05-14 17:03:46] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 0 ms to minimize.
[2021-05-14 17:03:46] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 1 ms to minimize.
[2021-05-14 17:03:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Fused 2 Parikh solutions to 1 different solutions.
Support contains 336 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 1038/1038 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 630/630 places, 1038/1038 transitions.
Starting structural reductions, iteration 0 : 630/630 places, 1038/1038 transitions.
Applied a total of 0 rules in 20 ms. Remains 630 /630 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2021-05-14 17:03:46] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 630 cols
[2021-05-14 17:03:46] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-14 17:03:46] [INFO ] Implicit Places using invariants in 152 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 153 ms to find 6 implicit places.
[2021-05-14 17:03:46] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-14 17:03:46] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:03:46] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-14 17:03:47] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Starting structural reductions, iteration 1 : 624/630 places, 1038/1038 transitions.
Applied a total of 0 rules in 19 ms. Remains 624 /624 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2021-05-14 17:03:47] [INFO ] Redundant transitions in 93 ms returned []
[2021-05-14 17:03:47] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:03:47] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 17:03:47] [INFO ] Dead Transitions using invariants and state equation in 427 ms returned []
Finished structural reductions, in 2 iterations. Remains : 624/630 places, 1038/1038 transitions.
[2021-05-14 17:03:47] [INFO ] Flatten gal took : 28 ms
[2021-05-14 17:03:47] [INFO ] Flatten gal took : 28 ms
[2021-05-14 17:03:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1771458426474330606.gal : 4 ms
[2021-05-14 17:03:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17923978542001003284.prop : 248 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1771458426474330606.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17923978542001003284.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1771458426474330606.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17923978542001003284.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17923978542001003284.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 154
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :154 after 475
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :475 after 1205
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1205 after 1831
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1831 after 11137
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11137 after 37512
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :37512 after 54087
Detected timeout of ITS tools.
[2021-05-14 17:04:10] [INFO ] Flatten gal took : 28 ms
[2021-05-14 17:04:10] [INFO ] Applying decomposition
[2021-05-14 17:04:10] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11725824904378221284.txt, -o, /tmp/graph11725824904378221284.bin, -w, /tmp/graph11725824904378221284.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11725824904378221284.bin, -l, -1, -v, -w, /tmp/graph11725824904378221284.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 17:04:10] [INFO ] Decomposing Gal with order
[2021-05-14 17:04:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:04:11] [INFO ] Removed a total of 1023 redundant transitions.
[2021-05-14 17:04:11] [INFO ] Flatten gal took : 203 ms
[2021-05-14 17:04:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 13 ms.
[2021-05-14 17:04:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16387875918808130176.gal : 6 ms
[2021-05-14 17:04:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2375594324036819127.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16387875918808130176.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2375594324036819127.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16387875918808130176.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2375594324036819127.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2375594324036819127.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 135
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :135 after 290
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :290 after 1112
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1112 after 1539
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1539 after 10406
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10406 after 13910
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13910 after 103258
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :103258 after 142497
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :142497 after 277089
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12235508357095928540
[2021-05-14 17:04:26] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12235508357095928540
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12235508357095928540]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12235508357095928540] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12235508357095928540] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3059 ms. (steps per millisecond=326 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 697692 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7610505 steps, run timeout after 30001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 7610505 steps, saw 1109059 distinct states, run finished after 30001 ms. (steps per millisecond=253 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 17:05:06] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:05:06] [INFO ] Computed 17 place invariants in 20 ms
[2021-05-14 17:05:06] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2021-05-14 17:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:05:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-14 17:05:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:05:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:05:06] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-14 17:05:06] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 17:05:06] [INFO ] [Nat]Added 230 Read/Feed constraints in 39 ms returned sat
[2021-05-14 17:05:06] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:05:07] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:05:07] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 0 ms to minimize.
[2021-05-14 17:05:07] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:05:07] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 0 ms to minimize.
[2021-05-14 17:05:07] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:05:08] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:05:08] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 0 ms to minimize.
[2021-05-14 17:05:08] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2021-05-14 17:05:08] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:05:08] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 0 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 0 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:05:09] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
[2021-05-14 17:05:10] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:05:10] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:05:10] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 0 ms to minimize.
[2021-05-14 17:05:10] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:05:10] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:05:11] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:05:11] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 0 ms to minimize.
[2021-05-14 17:05:11] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 1 ms to minimize.
[2021-05-14 17:05:11] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:05:11] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2021-05-14 17:05:12] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:05:12] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 0 ms to minimize.
[2021-05-14 17:05:12] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:05:12] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:05:12] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:05:13] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 1 ms to minimize.
[2021-05-14 17:05:13] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 1 ms to minimize.
[2021-05-14 17:05:13] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:05:13] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 1 ms to minimize.
[2021-05-14 17:05:13] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 0 ms to minimize.
[2021-05-14 17:05:14] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:05:14] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:05:14] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:05:14] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 0 ms to minimize.
[2021-05-14 17:05:14] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 0 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 0 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 115 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2021-05-14 17:05:15] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 1 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 1 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 0 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 0 ms to minimize.
[2021-05-14 17:05:16] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 1 ms to minimize.
[2021-05-14 17:05:17] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:05:17] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2021-05-14 17:05:17] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:05:17] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 0 ms to minimize.
[2021-05-14 17:05:17] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 0 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 0 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:05:18] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 0 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 1 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 0 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 1 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 0 ms to minimize.
[2021-05-14 17:05:19] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:05:20] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2021-05-14 17:05:20] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:05:20] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 0 ms to minimize.
[2021-05-14 17:05:20] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 0 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 0 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 1 ms to minimize.
[2021-05-14 17:05:21] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 0 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 0 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 1 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 1 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:05:22] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:05:23] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:05:23] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 0 ms to minimize.
[2021-05-14 17:05:23] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 1 ms to minimize.
[2021-05-14 17:05:23] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:05:24] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:05:24] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:05:24] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:05:24] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:05:24] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2021-05-14 17:05:25] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 0 ms to minimize.
[2021-05-14 17:05:25] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2021-05-14 17:05:25] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 0 ms to minimize.
[2021-05-14 17:05:25] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 0 ms to minimize.
[2021-05-14 17:05:25] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 1 ms to minimize.
[2021-05-14 17:05:26] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:05:26] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:05:26] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:05:26] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:05:27] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:05:27] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:05:27] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2021-05-14 17:05:27] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2021-05-14 17:05:27] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 0 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:05:28] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 1 ms to minimize.
[2021-05-14 17:05:29] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:05:29] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 1 ms to minimize.
[2021-05-14 17:05:29] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:05:29] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2021-05-14 17:05:29] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 1 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 0 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:05:30] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:05:31] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 0 ms to minimize.
[2021-05-14 17:05:31] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2021-05-14 17:05:31] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:05:31] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 1 ms to minimize.
[2021-05-14 17:05:31] [INFO ] Deduced a trap composed of 129 places in 167 ms of which 1 ms to minimize.
[2021-05-14 17:05:32] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:05:32] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 0 ms to minimize.
[2021-05-14 17:05:51] [INFO ] Deduced a trap composed of 2 places in 212 ms of which 1 ms to minimize.
[2021-05-14 17:05:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 17:05:51] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:05:51] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-14 17:05:51] [INFO ] [Real]Added 230 Read/Feed constraints in 37 ms returned sat
[2021-05-14 17:05:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:05:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:05:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:05:52] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-14 17:05:52] [INFO ] [Nat]Added 230 Read/Feed constraints in 41 ms returned sat
[2021-05-14 17:05:52] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 1 ms to minimize.
[2021-05-14 17:05:52] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:05:52] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 1 ms to minimize.
[2021-05-14 17:05:52] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:05:53] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 1 ms to minimize.
[2021-05-14 17:05:53] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2021-05-14 17:05:53] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2021-05-14 17:05:53] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2021-05-14 17:05:53] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 0 ms to minimize.
[2021-05-14 17:05:54] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 0 ms to minimize.
[2021-05-14 17:05:54] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:05:54] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:05:54] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:05:55] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:05:55] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 1 ms to minimize.
[2021-05-14 17:05:55] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2021-05-14 17:05:55] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:05:55] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:05:56] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:05:56] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:05:56] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 0 ms to minimize.
[2021-05-14 17:05:56] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2021-05-14 17:05:56] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:05:57] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:05:57] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 0 ms to minimize.
[2021-05-14 17:05:57] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:05:57] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 1 ms to minimize.
[2021-05-14 17:05:57] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 1 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:05:58] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 0 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 1 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 0 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 0 ms to minimize.
[2021-05-14 17:05:59] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 0 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 0 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 1 ms to minimize.
[2021-05-14 17:06:00] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 1 ms to minimize.
[2021-05-14 17:06:01] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:06:01] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:06:01] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 0 ms to minimize.
[2021-05-14 17:06:01] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:06:02] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:06:02] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:06:02] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:06:02] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:06:02] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:06:03] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:06:03] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:06:03] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2021-05-14 17:06:03] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:06:03] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 1 ms to minimize.
[2021-05-14 17:06:04] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 0 ms to minimize.
[2021-05-14 17:06:04] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 11 ms to minimize.
[2021-05-14 17:06:04] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:06:04] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:06:04] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:06:05] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 0 ms to minimize.
[2021-05-14 17:06:05] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 0 ms to minimize.
[2021-05-14 17:06:05] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:06:05] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2021-05-14 17:06:05] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 1 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 0 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2021-05-14 17:06:06] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 0 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2021-05-14 17:06:07] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2021-05-14 17:06:08] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2021-05-14 17:06:08] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2021-05-14 17:06:08] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 1 ms to minimize.
[2021-05-14 17:06:08] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:06:09] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:06:09] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:06:09] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:06:09] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:06:09] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:06:10] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 1 ms to minimize.
[2021-05-14 17:06:18] [INFO ] Deduced a trap composed of 92 places in 7994 ms of which 0 ms to minimize.
[2021-05-14 17:06:18] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 1 ms to minimize.
[2021-05-14 17:06:18] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 0 ms to minimize.
[2021-05-14 17:06:19] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2021-05-14 17:06:19] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:06:20] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:06:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2021-05-14 17:06:20] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:06:20] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:06:20] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:06:21] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:06:21] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:06:21] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:06:21] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 0 ms to minimize.
[2021-05-14 17:06:21] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 0 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 1 ms to minimize.
[2021-05-14 17:06:22] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 0 ms to minimize.
[2021-05-14 17:06:23] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2021-05-14 17:06:23] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2021-05-14 17:06:23] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2021-05-14 17:06:23] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 0 ms to minimize.
[2021-05-14 17:06:24] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:06:24] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:06:24] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 1 ms to minimize.
[2021-05-14 17:06:24] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2021-05-14 17:06:24] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2021-05-14 17:06:25] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 0 ms to minimize.
[2021-05-14 17:06:25] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 1 ms to minimize.
[2021-05-14 17:06:25] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2021-05-14 17:06:25] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2021-05-14 17:06:25] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:06:26] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 1 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2021-05-14 17:06:27] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 0 ms to minimize.
[2021-05-14 17:06:28] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 0 ms to minimize.
[2021-05-14 17:06:28] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2021-05-14 17:06:28] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 0 ms to minimize.
[2021-05-14 17:06:28] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2021-05-14 17:06:29] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2021-05-14 17:06:29] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2021-05-14 17:06:29] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 0 ms to minimize.
[2021-05-14 17:06:29] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 0 ms to minimize.
[2021-05-14 17:06:30] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2021-05-14 17:06:30] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 0 ms to minimize.
[2021-05-14 17:06:30] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 0 ms to minimize.
[2021-05-14 17:06:31] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 0 ms to minimize.
[2021-05-14 17:06:31] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2021-05-14 17:06:32] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2021-05-14 17:06:37] [INFO ] Deduced a trap composed of 2 places in 209 ms of which 0 ms to minimize.
[2021-05-14 17:06:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Fused 2 Parikh solutions to 1 different solutions.
Support contains 336 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 1038/1038 transitions.
Applied a total of 0 rules in 20 ms. Remains 624 /624 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 1038/1038 transitions.
Starting structural reductions, iteration 0 : 624/624 places, 1038/1038 transitions.
Applied a total of 0 rules in 21 ms. Remains 624 /624 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2021-05-14 17:06:37] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:06:37] [INFO ] Computed 17 place invariants in 20 ms
[2021-05-14 17:06:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2021-05-14 17:06:37] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:06:37] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 17:06:37] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 17:06:38] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2021-05-14 17:06:38] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-14 17:06:38] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:06:38] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 17:06:38] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 1038/1038 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-14 17:06:38] [INFO ] Flow matrix only has 918 transitions (discarded 120 similar events)
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:06:38] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 17:06:39] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:06:39] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-14 17:06:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:06:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:06:39] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-14 17:06:39] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 17:06:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 37 ms returned sat
[2021-05-14 17:06:39] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:06:39] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:06:40] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2021-05-14 17:06:40] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:06:40] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2021-05-14 17:06:40] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2021-05-14 17:06:40] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 1 ms to minimize.
[2021-05-14 17:06:41] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 0 ms to minimize.
[2021-05-14 17:06:41] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 0 ms to minimize.
[2021-05-14 17:06:41] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:06:41] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 1 ms to minimize.
[2021-05-14 17:06:41] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:06:42] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2021-05-14 17:06:42] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:06:42] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 0 ms to minimize.
[2021-05-14 17:06:42] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 0 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 0 ms to minimize.
[2021-05-14 17:06:43] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 0 ms to minimize.
[2021-05-14 17:06:44] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 0 ms to minimize.
[2021-05-14 17:06:44] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 1 ms to minimize.
[2021-05-14 17:06:44] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2021-05-14 17:06:44] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 0 ms to minimize.
[2021-05-14 17:06:44] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:06:45] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 1 ms to minimize.
[2021-05-14 17:06:46] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:06:46] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:06:46] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:06:46] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:06:46] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2021-05-14 17:06:47] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:06:47] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 0 ms to minimize.
[2021-05-14 17:06:47] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:06:47] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:06:47] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:06:48] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:06:48] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2021-05-14 17:06:48] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 1 ms to minimize.
[2021-05-14 17:06:48] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:06:48] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 0 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 0 ms to minimize.
[2021-05-14 17:06:49] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 0 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 0 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 1 ms to minimize.
[2021-05-14 17:06:50] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 1 ms to minimize.
[2021-05-14 17:06:51] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 0 ms to minimize.
[2021-05-14 17:06:52] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 1 ms to minimize.
[2021-05-14 17:06:52] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 0 ms to minimize.
[2021-05-14 17:06:52] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:06:52] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 0 ms to minimize.
[2021-05-14 17:06:52] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 1 ms to minimize.
[2021-05-14 17:06:53] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2021-05-14 17:06:53] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 0 ms to minimize.
[2021-05-14 17:06:53] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:06:53] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 1 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 0 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 1 ms to minimize.
[2021-05-14 17:06:54] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 1 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 0 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 0 ms to minimize.
[2021-05-14 17:06:55] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 0 ms to minimize.
[2021-05-14 17:06:56] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2021-05-14 17:06:56] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2021-05-14 17:06:56] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:06:56] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 1 ms to minimize.
[2021-05-14 17:06:57] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:06:57] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:06:57] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 1 ms to minimize.
[2021-05-14 17:06:57] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2021-05-14 17:06:57] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2021-05-14 17:06:58] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 0 ms to minimize.
[2021-05-14 17:06:58] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 0 ms to minimize.
[2021-05-14 17:06:58] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:06:58] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 1 ms to minimize.
[2021-05-14 17:06:58] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:06:59] [INFO ] Deduced a trap composed of 2 places in 221 ms of which 0 ms to minimize.
[2021-05-14 17:06:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 17:06:59] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:06:59] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-14 17:06:59] [INFO ] [Real]Added 230 Read/Feed constraints in 34 ms returned sat
[2021-05-14 17:06:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:06:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2021-05-14 17:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:07:00] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-14 17:07:00] [INFO ] [Nat]Added 230 Read/Feed constraints in 39 ms returned sat
[2021-05-14 17:07:00] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:07:00] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 0 ms to minimize.
[2021-05-14 17:07:00] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 0 ms to minimize.
[2021-05-14 17:07:00] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2021-05-14 17:07:01] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 1 ms to minimize.
[2021-05-14 17:07:01] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2021-05-14 17:07:01] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 0 ms to minimize.
[2021-05-14 17:07:01] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2021-05-14 17:07:01] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2021-05-14 17:07:02] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 0 ms to minimize.
[2021-05-14 17:07:02] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:07:02] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 1 ms to minimize.
[2021-05-14 17:07:02] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 0 ms to minimize.
[2021-05-14 17:07:02] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 0 ms to minimize.
[2021-05-14 17:07:03] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2021-05-14 17:07:03] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2021-05-14 17:07:03] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2021-05-14 17:07:03] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 0 ms to minimize.
[2021-05-14 17:07:03] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 1 ms to minimize.
[2021-05-14 17:07:04] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2021-05-14 17:07:04] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 1 ms to minimize.
[2021-05-14 17:07:04] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 0 ms to minimize.
[2021-05-14 17:07:04] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 0 ms to minimize.
[2021-05-14 17:07:04] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2021-05-14 17:07:05] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 1 ms to minimize.
[2021-05-14 17:07:05] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 1 ms to minimize.
[2021-05-14 17:07:05] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:07:05] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 1 ms to minimize.
[2021-05-14 17:07:05] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 0 ms to minimize.
[2021-05-14 17:07:06] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:07:06] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:07:06] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:07:06] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:07:06] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 1 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 0 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 0 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 1 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 0 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2021-05-14 17:07:07] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 0 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 0 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 1 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 1 ms to minimize.
[2021-05-14 17:07:08] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 0 ms to minimize.
[2021-05-14 17:07:09] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2021-05-14 17:07:09] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:07:09] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 0 ms to minimize.
[2021-05-14 17:07:09] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:07:10] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 0 ms to minimize.
[2021-05-14 17:07:10] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 1 ms to minimize.
[2021-05-14 17:07:10] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 0 ms to minimize.
[2021-05-14 17:07:10] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2021-05-14 17:07:10] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2021-05-14 17:07:11] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 0 ms to minimize.
[2021-05-14 17:07:11] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 0 ms to minimize.
[2021-05-14 17:07:11] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 1 ms to minimize.
[2021-05-14 17:07:11] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 0 ms to minimize.
[2021-05-14 17:07:11] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 1 ms to minimize.
[2021-05-14 17:07:12] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 1 ms to minimize.
[2021-05-14 17:07:12] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 0 ms to minimize.
[2021-05-14 17:07:12] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2021-05-14 17:07:12] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 0 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 1 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 1 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 1 ms to minimize.
[2021-05-14 17:07:13] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 1 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 0 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2021-05-14 17:07:14] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 1 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 0 ms to minimize.
[2021-05-14 17:07:15] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 0 ms to minimize.
[2021-05-14 17:07:16] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2021-05-14 17:07:16] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 0 ms to minimize.
[2021-05-14 17:07:16] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:07:16] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 0 ms to minimize.
[2021-05-14 17:07:17] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 1 ms to minimize.
[2021-05-14 17:07:17] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 0 ms to minimize.
[2021-05-14 17:07:17] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 0 ms to minimize.
[2021-05-14 17:07:17] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 0 ms to minimize.
[2021-05-14 17:07:17] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 1 ms to minimize.
[2021-05-14 17:07:18] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2021-05-14 17:07:18] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2021-05-14 17:07:18] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2021-05-14 17:07:19] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 0 ms to minimize.
[2021-05-14 17:07:19] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2021-05-14 17:07:20] [INFO ] Deduced a trap composed of 2 places in 218 ms of which 0 ms to minimize.
[2021-05-14 17:07:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 17:07:20] [INFO ] Flatten gal took : 27 ms
[2021-05-14 17:07:20] [INFO ] Flatten gal took : 25 ms
[2021-05-14 17:07:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5640606523998308898.gal : 3 ms
[2021-05-14 17:07:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15113094367674265199.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5640606523998308898.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15113094367674265199.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5640606523998308898.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15113094367674265199.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15113094367674265199.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 154
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :154 after 475
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :475 after 1205
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1205 after 1831
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1831 after 11137
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11137 after 37512
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :37512 after 54087
SDD proceeding with computation,2 properties remain. new max is 32768
Detected timeout of ITS tools.
[2021-05-14 17:07:40] [INFO ] Flatten gal took : 25 ms
[2021-05-14 17:07:40] [INFO ] Applying decomposition
[2021-05-14 17:07:40] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5714970875941831938.txt, -o, /tmp/graph5714970875941831938.bin, -w, /tmp/graph5714970875941831938.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5714970875941831938.bin, -l, -1, -v, -w, /tmp/graph5714970875941831938.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 17:07:40] [INFO ] Decomposing Gal with order
[2021-05-14 17:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:07:40] [INFO ] Removed a total of 1027 redundant transitions.
[2021-05-14 17:07:40] [INFO ] Flatten gal took : 210 ms
[2021-05-14 17:07:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 10 ms.
[2021-05-14 17:07:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16718008489241803630.gal : 6 ms
[2021-05-14 17:07:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16796873015833184289.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16718008489241803630.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16796873015833184289.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16718008489241803630.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16796873015833184289.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16796873015833184289.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 140
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :140 after 290
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :290 after 1129
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1129 after 1550
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1550 after 31959
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :31959 after 34976
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :34976 after 54085
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :54085 after 91304
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :91304 after 275980
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :275980 after 562263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6737311473780340697
[2021-05-14 17:08:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6737311473780340697
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6737311473780340697]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6737311473780340697] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6737311473780340697] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 624 transition count 918
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 198 place count 582 transition count 1182
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 223 place count 582 transition count 1157
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 259 place count 582 transition count 1157
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 279 place count 582 transition count 1137
Applied a total of 279 rules in 67 ms. Remains 582 /624 variables (removed 42) and now considering 1137/1038 (removed -99) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1137 rows 582 cols
[2021-05-14 17:08:02] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 17:08:02] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-14 17:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:08:03] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-14 17:08:03] [INFO ] Computed and/alt/rep : 761/847/761 causal constraints (skipped 359 transitions) in 69 ms.
[2021-05-14 17:08:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:08:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-14 17:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:08:04] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2021-05-14 17:08:04] [INFO ] Computed and/alt/rep : 761/847/761 causal constraints (skipped 359 transitions) in 76 ms.
[2021-05-14 17:08:07] [INFO ] Added : 318 causal constraints over 64 iterations in 2797 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-14 17:08:07] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 17:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 17:08:07] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-14 17:08:07] [INFO ] Computed and/alt/rep : 761/847/761 causal constraints (skipped 359 transitions) in 68 ms.
[2021-05-14 17:08:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 17:08:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 17:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 17:08:08] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2021-05-14 17:08:08] [INFO ] Computed and/alt/rep : 761/847/761 causal constraints (skipped 359 transitions) in 62 ms.
[2021-05-14 17:08:10] [INFO ] Added : 310 causal constraints over 62 iterations in 2519 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-14 17:08:10] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8546705686186229371
[2021-05-14 17:08:10] [INFO ] Computing symmetric may disable matrix : 1038 transitions.
[2021-05-14 17:08:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 17:08:10] [INFO ] Flatten gal took : 30 ms
[2021-05-14 17:08:10] [INFO ] Applying decomposition
[2021-05-14 17:08:10] [INFO ] Computing symmetric may enable matrix : 1038 transitions.
[2021-05-14 17:08:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 17:08:11] [INFO ] Flatten gal took : 38 ms
[2021-05-14 17:08:11] [INFO ] Input system was already deterministic with 1038 transitions.
[2021-05-14 17:08:11] [INFO ] Computing Do-Not-Accords matrix : 1038 transitions.
[2021-05-14 17:08:11] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2491455341741921493.txt, -o, /tmp/graph2491455341741921493.bin, -w, /tmp/graph2491455341741921493.weights], workingDir=null]
[2021-05-14 17:08:11] [INFO ] Built C files in 345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8546705686186229371
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8546705686186229371]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2491455341741921493.bin, -l, -1, -v, -w, /tmp/graph2491455341741921493.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 17:08:11] [INFO ] Decomposing Gal with order
[2021-05-14 17:08:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:08:11] [INFO ] Ran tautology test, simplified 0 / 2 in 492 ms.
[2021-05-14 17:08:11] [INFO ] Removed a total of 1041 redundant transitions.
[2021-05-14 17:08:11] [INFO ] Flatten gal took : 179 ms
[2021-05-14 17:08:11] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=0 took 28 ms
[2021-05-14 17:08:11] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2021-05-14 17:08:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 9 ms.
[2021-05-14 17:08:11] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=1 took 67 ms
[2021-05-14 17:08:11] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-10(UNSAT) depth K=1 took 14 ms
[2021-05-14 17:08:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7141643138735008289.gal : 19 ms
[2021-05-14 17:08:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16006532186543720180.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7141643138735008289.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16006532186543720180.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7141643138735008289.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16006532186543720180.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16006532186543720180.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 918 out of 1038 initially.
// Phase 1: matrix 918 rows 624 cols
[2021-05-14 17:08:11] [INFO ] Computed 17 place invariants in 4 ms
inv : WantSection_2 + AskForSection_5 + TestTurn_5 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + BeginLoop_30 + BeginLoop_36 + BeginLoop_42 + BeginLoop_48 + BeginLoop_54 + EndTurn_5 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + CS_1 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestIdentity_40 + TestIdentity_41 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestAlone_30 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_35 + TestAlone_36 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_50 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_56 + TestAlone_57 + TestAlone_58 + TestAlone_59 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 = 1
inv : WantSection_4 + WantSection_5 = 1
inv : WantSection_4 + AskForSection_10 + TestTurn_10 + TestTurn_11 + TestTurn_12 + TestTurn_13 + TestTurn_14 + BeginLoop_60 + BeginLoop_66 + BeginLoop_72 + BeginLoop_78 + BeginLoop_84 + EndTurn_10 + EndTurn_11 + EndTurn_12 + EndTurn_13 + EndTurn_14 + CS_2 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_79 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestAlone_60 + TestAlone_61 + TestAlone_63 + TestAlone_64 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_69 + TestAlone_70 + TestAlone_71 + TestAlone_72 + TestAlone_73 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_78 + TestAlone_79 + TestAlone_81 + TestAlone_82 + TestAlone_83 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 = 1
inv : WantSection_0 + AskForSection_0 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + BeginLoop_0 + BeginLoop_6 + BeginLoop_12 + BeginLoop_18 + BeginLoop_24 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + CS_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_19 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_7 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_13 + TestAlone_14 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_19 + TestAlone_20 + TestAlone_21 + TestAlone_22 + TestAlone_23 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_28 + TestAlone_29 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 = 1
inv : WantSection_8 + AskForSection_20 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + TestTurn_24 + BeginLoop_120 + BeginLoop_126 + BeginLoop_132 + BeginLoop_138 + BeginLoop_144 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + EndTurn_24 + CS_4 + TestIdentity_121 + TestIdentity_122 + TestIdentity_123 + TestIdentity_124 + TestIdentity_125 + TestIdentity_127 + TestIdentity_128 + TestIdentity_129 + TestIdentity_130 + TestIdentity_131 + TestIdentity_133 + TestIdentity_134 + TestIdentity_135 + TestIdentity_136 + TestIdentity_137 + TestIdentity_139 + TestIdentity_140 + TestIdentity_141 + TestIdentity_142 + TestIdentity_143 + TestIdentity_145 + TestIdentity_146 + TestIdentity_147 + TestIdentity_148 + TestIdentity_149 + TestAlone_120 + TestAlone_121 + TestAlone_122 + TestAlone_123 + TestAlone_125 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_129 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_143 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_149 + IsEndLoop_120 + IsEndLoop_121 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_129 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_136 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_143 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 = 1
inv : Turn_6 + Turn_7 + Turn_8 + Turn_9 + Turn_10 + Turn_11 = 1
inv : WantSection_6 + WantSection_7 = 1
inv : WantSection_2 + WantSection_3 = 1
inv : Turn_12 + Turn_13 + Turn_14 + Turn_15 + Turn_16 + Turn_17 = 1
inv : WantSection_6 + AskForSection_15 + TestTurn_15 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + BeginLoop_90 + BeginLoop_96 + BeginLoop_102 + BeginLoop_108 + BeginLoop_114 + EndTurn_15 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + CS_3 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestIdentity_100 + TestIdentity_101 + TestIdentity_103 + TestIdentity_104 + TestIdentity_105 + TestIdentity_106 + TestIdentity_107 + TestIdentity_109 + TestIdentity_110 + TestIdentity_111 + TestIdentity_112 + TestIdentity_113 + TestIdentity_115 + TestIdentity_116 + TestIdentity_117 + TestIdentity_118 + TestIdentity_119 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_100 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_106 + TestAlone_107 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_112 + TestAlone_113 + TestAlone_114 + TestAlone_115 + TestAlone_116 + TestAlone_118 + TestAlone_119 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_100 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_107 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_114 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 = 1
inv : Turn_24 + Turn_25 + Turn_26 + Turn_27 + Turn_28 + Turn_29 = 1
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 + Turn_5 = 1
inv : WantSection_8 + WantSection_9 = 1
inv : WantSection_0 + WantSection_1 = 1
inv : WantSection_10 + AskForSection_25 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_150 + BeginLoop_156 + BeginLoop_162 + BeginLoop_168 + BeginLoop_174 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_5 + TestIdentity_151 + TestIdentity_152 + TestIdentity_153 + TestIdentity_154 + TestIdentity_155 + TestIdentity_157 + TestIdentity_158 + TestIdentity_159 + TestIdentity_160 + TestIdentity_161 + TestIdentity_163 + TestIdentity_164 + TestIdentity_165 + TestIdentity_166 + TestIdentity_167 + TestIdentity_169 + TestIdentity_170 + TestIdentity_171 + TestIdentity_172 + TestIdentity_173 + TestIdentity_175 + TestIdentity_176 + TestIdentity_177 + TestIdentity_178 + TestIdentity_179 + TestAlone_150 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_156 + TestAlone_157 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_162 + TestAlone_163 + TestAlone_164 + TestAlone_165 + TestAlone_166 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_172 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + IsEndLoop_150 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_157 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_164 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_172 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_179 = 1
inv : Turn_18 + Turn_19 + Turn_20 + Turn_21 + Turn_22 + Turn_23 = 1
inv : WantSection_10 + WantSection_11 = 1
Total of 17 invariants.
[2021-05-14 17:08:11] [INFO ] Computed 17 place invariants in 8 ms
[2021-05-14 17:08:12] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=2 took 549 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 135
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :135 after 290
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :290 after 1112
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1112 after 1537
[2021-05-14 17:08:12] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-10(UNSAT) depth K=2 took 260 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1537 after 10423
[2021-05-14 17:08:12] [INFO ] Proved 624 variables to be positive in 1034 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10423 after 14122
[2021-05-14 17:08:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-05
[2021-05-14 17:08:12] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-05(SAT) depth K=0 took 97 ms
[2021-05-14 17:08:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-10
[2021-05-14 17:08:13] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-10(SAT) depth K=0 took 60 ms
[2021-05-14 17:08:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-05
[2021-05-14 17:08:13] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-05(SAT) depth K=1 took 823 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14122 after 35516
[2021-05-14 17:08:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-10
[2021-05-14 17:08:14] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-10(SAT) depth K=1 took 281 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35516 after 150866
Compilation finished in 8258 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8546705686186229371]
Link finished in 82 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonCOL5ReachabilityCardinality05==true], workingDir=/tmp/ltsmin8546705686186229371]
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :150866 after 241152
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :241152 after 556243
[2021-05-14 17:09:19] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=3 took 67107 ms
[2021-05-14 17:09:31] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-10(UNSAT) depth K=3 took 11868 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :556243 after 1.57929e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.57929e+06 after 3.75424e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.75424e+06 after 1.12712e+07
[2021-05-14 17:17:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-05
[2021-05-14 17:17:13] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-05(SAT) depth K=2 took 539850 ms
[2021-05-14 17:17:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-10
[2021-05-14 17:17:25] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-10(SAT) depth K=2 took 11645 ms
[2021-05-14 17:19:31] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=4 took 600193 ms
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :1.12712e+07 after 2.66e+07
[2021-05-14 17:24:54] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-10(UNSAT) depth K=4 took 322453 ms
Detected timeout of ITS tools.
[2021-05-14 17:31:54] [INFO ] Applying decomposition
[2021-05-14 17:31:54] [INFO ] Flatten gal took : 99 ms
[2021-05-14 17:31:54] [INFO ] Decomposing Gal with order
[2021-05-14 17:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 17:31:54] [INFO ] Removed a total of 1242 redundant transitions.
[2021-05-14 17:31:54] [INFO ] Flatten gal took : 159 ms
[2021-05-14 17:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-14 17:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15461868263858833379.gal : 27 ms
[2021-05-14 17:31:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13632949076216882754.prop : 2057 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15461868263858833379.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13632949076216882754.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15461868263858833379.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13632949076216882754.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13632949076216882754.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 159
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :159 after 337
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :337 after 995
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :995 after 1519
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1519 after 10134
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10134 after 33625
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33625 after 46997
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :46997 after 318563
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :318563 after 1.0352e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.0352e+06 after 1.59252e+06
[2021-05-14 17:38:12] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityCardinality-05(UNSAT) depth K=5 took 798790 ms
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonCOL5ReachabilityCardinality05==true], workingDir=/tmp/ltsmin8546705686186229371]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonCOL5ReachabilityCardinality10==true], workingDir=/tmp/ltsmin8546705686186229371]
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.59252e+06 after 2.54637e+06
[2021-05-14 17:49:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-05
[2021-05-14 17:49:56] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-05(SAT) depth K=3 took 1951297 ms
[2021-05-14 17:50:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityCardinality-10
[2021-05-14 17:50:11] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityCardinality-10(SAT) depth K=3 took 14719 ms
Detected timeout of ITS tools.
[2021-05-14 17:55:35] [INFO ] Flatten gal took : 83 ms
[2021-05-14 17:55:35] [INFO ] Input system was already deterministic with 1038 transitions.
[2021-05-14 17:55:35] [INFO ] Transformed 624 places.
[2021-05-14 17:55:35] [INFO ] Transformed 1038 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 17:55:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14532123549570544574.gal : 3 ms
[2021-05-14 17:55:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11300954743916474652.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14532123549570544574.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11300954743916474652.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14532123549570544574.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11300954743916474652.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality11300954743916474652.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 68
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :68 after 80
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :80 after 82
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :82 after 110
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :110 after 576
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :576 after 952
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :952 after 3696
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3696 after 14074
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :14074 after 20380
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20380 after 53180
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :53180 after 122318
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :122318 after 335901

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-5, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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