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.r216-tall-162098205100458.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 ShieldIIPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 512K May 5 16:52 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 ShieldIIPt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621106200257

Running Version 0
[2021-05-15 19:16:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-15 19:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 19:16:42] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2021-05-15 19:16:42] [INFO ] Transformed 2103 places.
[2021-05-15 19:16:42] [INFO ] Transformed 1953 transitions.
[2021-05-15 19:16:42] [INFO ] Found NUPN structural information;
[2021-05-15 19:16:42] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 682 out of 2103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 157 places :
Symmetric choice reduction at 0 with 157 rule applications. Total rules 157 place count 1946 transition count 1796
Iterating global reduction 0 with 157 rules applied. Total rules applied 314 place count 1946 transition count 1796
Applied a total of 314 rules in 311 ms. Remains 1946 /2103 variables (removed 157) and now considering 1796/1953 (removed 157) transitions.
// Phase 1: matrix 1796 rows 1946 cols
[2021-05-15 19:16:43] [INFO ] Computed 271 place invariants in 32 ms
[2021-05-15 19:16:43] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 1796 rows 1946 cols
[2021-05-15 19:16:43] [INFO ] Computed 271 place invariants in 14 ms
[2021-05-15 19:16:45] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
// Phase 1: matrix 1796 rows 1946 cols
[2021-05-15 19:16:45] [INFO ] Computed 271 place invariants in 8 ms
[2021-05-15 19:16:46] [INFO ] Dead Transitions using invariants and state equation in 1049 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1946/2103 places, 1796/1953 transitions.
[2021-05-15 19:16:46] [INFO ] Flatten gal took : 262 ms
[2021-05-15 19:16:47] [INFO ] Flatten gal took : 188 ms
[2021-05-15 19:16:47] [INFO ] Input system was already deterministic with 1796 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1432 ms. (steps per millisecond=69 ) properties (out of 92) seen :81
Running SMT prover for 11 properties.
// Phase 1: matrix 1796 rows 1946 cols
[2021-05-15 19:16:49] [INFO ] Computed 271 place invariants in 6 ms
[2021-05-15 19:16:49] [INFO ] [Real]Absence check using 271 positive place invariants in 91 ms returned sat
[2021-05-15 19:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:16:50] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2021-05-15 19:16:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:16:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 86 ms returned sat
[2021-05-15 19:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:16:51] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2021-05-15 19:16:51] [INFO ] Deduced a trap composed of 30 places in 423 ms of which 5 ms to minimize.
[2021-05-15 19:16:52] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 2 ms to minimize.
[2021-05-15 19:16:52] [INFO ] Deduced a trap composed of 24 places in 430 ms of which 1 ms to minimize.
[2021-05-15 19:16:53] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 1 ms to minimize.
[2021-05-15 19:16:53] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 1 ms to minimize.
[2021-05-15 19:16:54] [INFO ] Deduced a trap composed of 24 places in 530 ms of which 1 ms to minimize.
[2021-05-15 19:16:54] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 1 ms to minimize.
[2021-05-15 19:16:55] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 2 ms to minimize.
[2021-05-15 19:16:55] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2021-05-15 19:16:56] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 1 ms to minimize.
[2021-05-15 19:16:56] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2021-05-15 19:16:56] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 1 ms to minimize.
[2021-05-15 19:16:57] [INFO ] Deduced a trap composed of 28 places in 427 ms of which 1 ms to minimize.
[2021-05-15 19:16:57] [INFO ] Deduced a trap composed of 34 places in 378 ms of which 1 ms to minimize.
[2021-05-15 19:16:58] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 1 ms to minimize.
[2021-05-15 19:16:58] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:16:59] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:16:59] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 0 ms to minimize.
[2021-05-15 19:16:59] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 1 ms to minimize.
[2021-05-15 19:17:00] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 1 ms to minimize.
[2021-05-15 19:17:00] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 1 ms to minimize.
[2021-05-15 19:17:01] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 2 ms to minimize.
[2021-05-15 19:17:01] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:17:01] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:17:02] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:17:02] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 0 ms to minimize.
[2021-05-15 19:17:02] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:17:03] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 1 ms to minimize.
[2021-05-15 19:17:03] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:17:03] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 1 ms to minimize.
[2021-05-15 19:17:04] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 1 ms to minimize.
[2021-05-15 19:17:04] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:17:04] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 0 ms to minimize.
[2021-05-15 19:17:04] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 1 ms to minimize.
[2021-05-15 19:17:05] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:17:05] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 1 ms to minimize.
[2021-05-15 19:17:05] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:17:06] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 0 ms to minimize.
[2021-05-15 19:17:06] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 0 ms to minimize.
[2021-05-15 19:17:06] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 2 ms to minimize.
[2021-05-15 19:17:07] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:17:07] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:17:07] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 9 ms to minimize.
[2021-05-15 19:17:07] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 0 ms to minimize.
[2021-05-15 19:17:08] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 1 ms to minimize.
[2021-05-15 19:17:08] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:17:08] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:17:09] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:17:09] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:17:09] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 0 ms to minimize.
[2021-05-15 19:17:09] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 1 ms to minimize.
[2021-05-15 19:17:10] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:17:10] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 18805 ms
[2021-05-15 19:17:10] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 93 ms.
[2021-05-15 19:17:11] [INFO ] Deduced a trap composed of 16 places in 900 ms of which 3 ms to minimize.
[2021-05-15 19:17:11] [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-15 19:17:11] [INFO ] [Real]Absence check using 271 positive place invariants in 90 ms returned sat
[2021-05-15 19:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:17:12] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2021-05-15 19:17:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:17:12] [INFO ] [Nat]Absence check using 271 positive place invariants in 86 ms returned sat
[2021-05-15 19:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:17:13] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2021-05-15 19:17:13] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2021-05-15 19:17:14] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:17:14] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 10 ms to minimize.
[2021-05-15 19:17:15] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 1 ms to minimize.
[2021-05-15 19:17:15] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 1 ms to minimize.
[2021-05-15 19:17:16] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 1 ms to minimize.
[2021-05-15 19:17:16] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:17:16] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 1 ms to minimize.
[2021-05-15 19:17:17] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2021-05-15 19:17:17] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:17:18] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:17:18] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 1 ms to minimize.
[2021-05-15 19:17:19] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 2 ms to minimize.
[2021-05-15 19:17:19] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:17:19] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 10 ms to minimize.
[2021-05-15 19:17:20] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 2 ms to minimize.
[2021-05-15 19:17:20] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:17:20] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 0 ms to minimize.
[2021-05-15 19:17:21] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:17:21] [INFO ] Deduced a trap composed of 41 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:17:21] [INFO ] Deduced a trap composed of 40 places in 300 ms of which 2 ms to minimize.
[2021-05-15 19:17:22] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:17:22] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
[2021-05-15 19:17:23] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:17:23] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2021-05-15 19:17:23] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 0 ms to minimize.
[2021-05-15 19:17:24] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:17:24] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:17:24] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:17:24] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 0 ms to minimize.
[2021-05-15 19:17:25] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2021-05-15 19:17:25] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:17:25] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:17:26] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:17:26] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:17:26] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2021-05-15 19:17:27] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 0 ms to minimize.
[2021-05-15 19:17:27] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:17:27] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 1 ms to minimize.
[2021-05-15 19:17:27] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:17:28] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:17:28] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2021-05-15 19:17:28] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:17:28] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:17:29] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2021-05-15 19:17:29] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:17:29] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:17:29] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 0 ms to minimize.
[2021-05-15 19:17:29] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2021-05-15 19:17:30] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 0 ms to minimize.
[2021-05-15 19:17:30] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 0 ms to minimize.
[2021-05-15 19:17:30] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2021-05-15 19:17:30] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17047 ms
[2021-05-15 19:17:30] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 97 ms.
[2021-05-15 19:17:33] [INFO ] Deduced a trap composed of 16 places in 936 ms of which 2 ms to minimize.
[2021-05-15 19:17:33] [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-15 19:17:33] [INFO ] [Real]Absence check using 271 positive place invariants in 79 ms returned sat
[2021-05-15 19:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:17:34] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2021-05-15 19:17:34] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2021-05-15 19:17:35] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 1 ms to minimize.
[2021-05-15 19:17:35] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2021-05-15 19:17:36] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 1 ms to minimize.
[2021-05-15 19:17:36] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2021-05-15 19:17:36] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2021-05-15 19:17:37] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 1 ms to minimize.
[2021-05-15 19:17:37] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 1 ms to minimize.
[2021-05-15 19:17:38] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:17:38] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2021-05-15 19:17:38] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2021-05-15 19:17:39] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 0 ms to minimize.
[2021-05-15 19:17:39] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 1 ms to minimize.
[2021-05-15 19:17:39] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 0 ms to minimize.
[2021-05-15 19:17:40] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 0 ms to minimize.
[2021-05-15 19:17:40] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:17:40] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2021-05-15 19:17:41] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2021-05-15 19:17:41] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 1 ms to minimize.
[2021-05-15 19:17:41] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:17:41] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:17:42] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:17:42] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 1 ms to minimize.
[2021-05-15 19:17:42] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2021-05-15 19:17:43] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:17:43] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 1 ms to minimize.
[2021-05-15 19:17:43] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:17:43] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:17:44] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 0 ms to minimize.
[2021-05-15 19:17:44] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 0 ms to minimize.
[2021-05-15 19:17:44] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2021-05-15 19:17:44] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:17:45] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2021-05-15 19:17:45] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 1 ms to minimize.
[2021-05-15 19:17:45] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2021-05-15 19:17:45] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 0 ms to minimize.
[2021-05-15 19:17:46] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:17:46] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2021-05-15 19:17:46] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2021-05-15 19:17:46] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2021-05-15 19:17:47] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2021-05-15 19:17:47] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-15 19:17:47] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2021-05-15 19:17:47] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2021-05-15 19:17:47] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 0 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 0 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2021-05-15 19:17:48] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2021-05-15 19:17:49] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2021-05-15 19:17:49] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2021-05-15 19:17:49] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 14837 ms
[2021-05-15 19:17:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:17:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 83 ms returned sat
[2021-05-15 19:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:17:50] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2021-05-15 19:17:50] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2021-05-15 19:17:51] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 1 ms to minimize.
[2021-05-15 19:17:51] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 0 ms to minimize.
[2021-05-15 19:17:52] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 1 ms to minimize.
[2021-05-15 19:17:52] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 1 ms to minimize.
[2021-05-15 19:17:52] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 1 ms to minimize.
[2021-05-15 19:17:53] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2021-05-15 19:17:53] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2021-05-15 19:17:53] [INFO ] Deduced a trap composed of 27 places in 339 ms of which 0 ms to minimize.
[2021-05-15 19:17:54] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2021-05-15 19:17:54] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:17:55] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 1 ms to minimize.
[2021-05-15 19:17:55] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 1 ms to minimize.
[2021-05-15 19:17:55] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:17:56] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2021-05-15 19:17:56] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:17:56] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 1 ms to minimize.
[2021-05-15 19:17:56] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2021-05-15 19:17:57] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 0 ms to minimize.
[2021-05-15 19:17:57] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 0 ms to minimize.
[2021-05-15 19:17:57] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:17:58] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:17:58] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:17:58] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:17:59] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 0 ms to minimize.
[2021-05-15 19:17:59] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2021-05-15 19:17:59] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:17:59] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:18:00] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 1 ms to minimize.
[2021-05-15 19:18:00] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 0 ms to minimize.
[2021-05-15 19:18:00] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2021-05-15 19:18:00] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 0 ms to minimize.
[2021-05-15 19:18:01] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:18:01] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 0 ms to minimize.
[2021-05-15 19:18:01] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:18:01] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2021-05-15 19:18:02] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2021-05-15 19:18:02] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 0 ms to minimize.
[2021-05-15 19:18:02] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2021-05-15 19:18:02] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2021-05-15 19:18:02] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 0 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2021-05-15 19:18:03] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2021-05-15 19:18:04] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:18:05] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 14597 ms
[2021-05-15 19:18:05] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 117 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-15 19:18:10] [INFO ] Deduced a trap composed of 16 places in 935 ms of which 4 ms to minimize.
[2021-05-15 19:18:10] [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-15 19:18:10] [INFO ] [Real]Absence check using 271 positive place invariants in 85 ms returned sat
[2021-05-15 19:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:18:11] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2021-05-15 19:18:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:18:11] [INFO ] [Nat]Absence check using 271 positive place invariants in 89 ms returned sat
[2021-05-15 19:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:18:12] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2021-05-15 19:18:13] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 1 ms to minimize.
[2021-05-15 19:18:13] [INFO ] Deduced a trap composed of 25 places in 340 ms of which 1 ms to minimize.
[2021-05-15 19:18:13] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2021-05-15 19:18:14] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 0 ms to minimize.
[2021-05-15 19:18:14] [INFO ] Deduced a trap composed of 22 places in 330 ms of which 1 ms to minimize.
[2021-05-15 19:18:15] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 1 ms to minimize.
[2021-05-15 19:18:15] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 1 ms to minimize.
[2021-05-15 19:18:15] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:18:16] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:18:16] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 0 ms to minimize.
[2021-05-15 19:18:16] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 1 ms to minimize.
[2021-05-15 19:18:17] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 1 ms to minimize.
[2021-05-15 19:18:17] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 1 ms to minimize.
[2021-05-15 19:18:18] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 1 ms to minimize.
[2021-05-15 19:18:18] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 1 ms to minimize.
[2021-05-15 19:18:18] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 0 ms to minimize.
[2021-05-15 19:18:19] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 1 ms to minimize.
[2021-05-15 19:18:19] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 1 ms to minimize.
[2021-05-15 19:18:19] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 2 ms to minimize.
[2021-05-15 19:18:20] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 1 ms to minimize.
[2021-05-15 19:18:20] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:18:20] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 0 ms to minimize.
[2021-05-15 19:18:21] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:18:21] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:18:21] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:18:22] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:18:22] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 1 ms to minimize.
[2021-05-15 19:18:22] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 1 ms to minimize.
[2021-05-15 19:18:23] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 0 ms to minimize.
[2021-05-15 19:18:23] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 0 ms to minimize.
[2021-05-15 19:18:23] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:18:23] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 1 ms to minimize.
[2021-05-15 19:18:24] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 1 ms to minimize.
[2021-05-15 19:18:24] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2021-05-15 19:18:24] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 9 ms to minimize.
[2021-05-15 19:18:25] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:18:25] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:18:25] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:18:25] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2021-05-15 19:18:26] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:18:26] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2021-05-15 19:18:26] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2021-05-15 19:18:26] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2021-05-15 19:18:27] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:18:27] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:18:27] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 0 ms to minimize.
[2021-05-15 19:18:27] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 0 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2021-05-15 19:18:28] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 16245 ms
[2021-05-15 19:18:29] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 110 ms.
[2021-05-15 19:18:31] [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
[2021-05-15 19:18:31] [INFO ] [Real]Absence check using 271 positive place invariants in 82 ms returned sat
[2021-05-15 19:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:18:32] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2021-05-15 19:18:33] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 1 ms to minimize.
[2021-05-15 19:18:33] [INFO ] Deduced a trap composed of 25 places in 417 ms of which 1 ms to minimize.
[2021-05-15 19:18:34] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 1 ms to minimize.
[2021-05-15 19:18:34] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 1 ms to minimize.
[2021-05-15 19:18:34] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2021-05-15 19:18:35] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 1 ms to minimize.
[2021-05-15 19:18:35] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 2 ms to minimize.
[2021-05-15 19:18:36] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 1 ms to minimize.
[2021-05-15 19:18:36] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2021-05-15 19:18:37] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2021-05-15 19:18:37] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 1 ms to minimize.
[2021-05-15 19:18:38] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2021-05-15 19:18:38] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 1 ms to minimize.
[2021-05-15 19:18:38] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:18:39] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2021-05-15 19:18:39] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 1 ms to minimize.
[2021-05-15 19:18:40] [INFO ] Deduced a trap composed of 24 places in 364 ms of which 1 ms to minimize.
[2021-05-15 19:18:40] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2021-05-15 19:18:41] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 0 ms to minimize.
[2021-05-15 19:18:41] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 1 ms to minimize.
[2021-05-15 19:18:41] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 0 ms to minimize.
[2021-05-15 19:18:42] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 1 ms to minimize.
[2021-05-15 19:18:42] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:18:43] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:18:43] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:18:43] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 1 ms to minimize.
[2021-05-15 19:18:44] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 0 ms to minimize.
[2021-05-15 19:18:44] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 1 ms to minimize.
[2021-05-15 19:18:44] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:18:45] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:18:45] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2021-05-15 19:18:45] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 1 ms to minimize.
[2021-05-15 19:18:46] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:18:46] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:18:46] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:18:47] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:18:47] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2021-05-15 19:18:47] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2021-05-15 19:18:47] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:18:48] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 1 ms to minimize.
[2021-05-15 19:18:48] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:18:48] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 0 ms to minimize.
[2021-05-15 19:18:49] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:18:49] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2021-05-15 19:18:49] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 0 ms to minimize.
[2021-05-15 19:18:49] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 1 ms to minimize.
[2021-05-15 19:18:50] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:18:50] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2021-05-15 19:18:50] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 1 ms to minimize.
[2021-05-15 19:18:50] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 17927 ms
[2021-05-15 19:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:18:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 87 ms returned sat
[2021-05-15 19:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:18:51] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2021-05-15 19:18:52] [INFO ] Deduced a trap composed of 19 places in 421 ms of which 1 ms to minimize.
[2021-05-15 19:18:52] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 1 ms to minimize.
[2021-05-15 19:18:52] [INFO ] Deduced a trap composed of 22 places in 418 ms of which 1 ms to minimize.
[2021-05-15 19:18:53] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2021-05-15 19:18:53] [INFO ] Deduced a trap composed of 22 places in 404 ms of which 1 ms to minimize.
[2021-05-15 19:18:54] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 1 ms to minimize.
[2021-05-15 19:18:54] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 1 ms to minimize.
[2021-05-15 19:18:55] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 1 ms to minimize.
[2021-05-15 19:18:55] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2021-05-15 19:18:56] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:18:56] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 1 ms to minimize.
[2021-05-15 19:18:56] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 1 ms to minimize.
[2021-05-15 19:18:57] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
[2021-05-15 19:18:57] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 1 ms to minimize.
[2021-05-15 19:18:58] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2021-05-15 19:18:58] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 1 ms to minimize.
[2021-05-15 19:18:59] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 1 ms to minimize.
[2021-05-15 19:18:59] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 1 ms to minimize.
[2021-05-15 19:18:59] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 1 ms to minimize.
[2021-05-15 19:19:00] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 1 ms to minimize.
[2021-05-15 19:19:00] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:19:01] [INFO ] Deduced a trap composed of 39 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:19:01] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 1 ms to minimize.
[2021-05-15 19:19:01] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 1 ms to minimize.
[2021-05-15 19:19:02] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
[2021-05-15 19:19:02] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 0 ms to minimize.
[2021-05-15 19:19:02] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 0 ms to minimize.
[2021-05-15 19:19:03] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:19:03] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2021-05-15 19:19:03] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:19:04] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:19:04] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 1 ms to minimize.
[2021-05-15 19:19:04] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 0 ms to minimize.
[2021-05-15 19:19:04] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:19:05] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:19:05] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 1 ms to minimize.
[2021-05-15 19:19:05] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:19:06] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 0 ms to minimize.
[2021-05-15 19:19:06] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 1 ms to minimize.
[2021-05-15 19:19:06] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 1 ms to minimize.
[2021-05-15 19:19:06] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2021-05-15 19:19:07] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 0 ms to minimize.
[2021-05-15 19:19:07] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 0 ms to minimize.
[2021-05-15 19:19:07] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 1 ms to minimize.
[2021-05-15 19:19:07] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:19:08] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2021-05-15 19:19:08] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2021-05-15 19:19:08] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 0 ms to minimize.
[2021-05-15 19:19:08] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 17079 ms
[2021-05-15 19:19:08] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 100 ms.
[2021-05-15 19:19:11] [INFO ] Deduced a trap composed of 16 places in 875 ms of which 2 ms to minimize.
[2021-05-15 19:19:11] [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 4
[2021-05-15 19:19:11] [INFO ] [Real]Absence check using 271 positive place invariants in 103 ms returned sat
[2021-05-15 19:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:12] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2021-05-15 19:19:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:19:12] [INFO ] [Nat]Absence check using 271 positive place invariants in 108 ms returned sat
[2021-05-15 19:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:13] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2021-05-15 19:19:13] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 1 ms to minimize.
[2021-05-15 19:19:14] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 1 ms to minimize.
[2021-05-15 19:19:14] [INFO ] Deduced a trap composed of 26 places in 381 ms of which 1 ms to minimize.
[2021-05-15 19:19:15] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 1 ms to minimize.
[2021-05-15 19:19:15] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 1 ms to minimize.
[2021-05-15 19:19:16] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 1 ms to minimize.
[2021-05-15 19:19:16] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 1 ms to minimize.
[2021-05-15 19:19:16] [INFO ] Deduced a trap composed of 29 places in 354 ms of which 1 ms to minimize.
[2021-05-15 19:19:17] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 1 ms to minimize.
[2021-05-15 19:19:17] [INFO ] Deduced a trap composed of 34 places in 361 ms of which 1 ms to minimize.
[2021-05-15 19:19:18] [INFO ] Deduced a trap composed of 25 places in 345 ms of which 1 ms to minimize.
[2021-05-15 19:19:18] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 1 ms to minimize.
[2021-05-15 19:19:18] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:19:19] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:19:19] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2021-05-15 19:19:20] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 1 ms to minimize.
[2021-05-15 19:19:20] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 0 ms to minimize.
[2021-05-15 19:19:20] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 1 ms to minimize.
[2021-05-15 19:19:21] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 1 ms to minimize.
[2021-05-15 19:19:21] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:19:21] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 1 ms to minimize.
[2021-05-15 19:19:22] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2021-05-15 19:19:22] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 3 ms to minimize.
[2021-05-15 19:19:22] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:19:23] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2021-05-15 19:19:23] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 0 ms to minimize.
[2021-05-15 19:19:23] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:19:23] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:19:24] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 1 ms to minimize.
[2021-05-15 19:19:24] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 1 ms to minimize.
[2021-05-15 19:19:24] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:19:25] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 0 ms to minimize.
[2021-05-15 19:19:25] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:19:25] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:19:25] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 0 ms to minimize.
[2021-05-15 19:19:26] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:19:26] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:19:26] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:19:26] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 0 ms to minimize.
[2021-05-15 19:19:27] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2021-05-15 19:19:27] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 13717 ms
[2021-05-15 19:19:27] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 93 ms.
[2021-05-15 19:19:33] [INFO ] Deduced a trap composed of 16 places in 846 ms of which 11 ms to minimize.
[2021-05-15 19:19:33] [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 5
[2021-05-15 19:19:33] [INFO ] [Real]Absence check using 271 positive place invariants in 84 ms returned sat
[2021-05-15 19:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:34] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2021-05-15 19:19:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:19:34] [INFO ] [Nat]Absence check using 271 positive place invariants in 88 ms returned sat
[2021-05-15 19:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:35] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2021-05-15 19:19:36] [INFO ] Deduced a trap composed of 22 places in 401 ms of which 1 ms to minimize.
[2021-05-15 19:19:36] [INFO ] Deduced a trap composed of 27 places in 454 ms of which 1 ms to minimize.
[2021-05-15 19:19:37] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 1 ms to minimize.
[2021-05-15 19:19:37] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 1 ms to minimize.
[2021-05-15 19:19:38] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 1 ms to minimize.
[2021-05-15 19:19:38] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 1 ms to minimize.
[2021-05-15 19:19:39] [INFO ] Deduced a trap composed of 27 places in 402 ms of which 1 ms to minimize.
[2021-05-15 19:19:39] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 1 ms to minimize.
[2021-05-15 19:19:39] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 1 ms to minimize.
[2021-05-15 19:19:40] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 1 ms to minimize.
[2021-05-15 19:19:40] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 1 ms to minimize.
[2021-05-15 19:19:41] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 1 ms to minimize.
[2021-05-15 19:19:41] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2021-05-15 19:19:42] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 1 ms to minimize.
[2021-05-15 19:19:42] [INFO ] Deduced a trap composed of 18 places in 363 ms of which 1 ms to minimize.
[2021-05-15 19:19:42] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2021-05-15 19:19:43] [INFO ] Deduced a trap composed of 21 places in 353 ms of which 1 ms to minimize.
[2021-05-15 19:19:43] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2021-05-15 19:19:44] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 1 ms to minimize.
[2021-05-15 19:19:44] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 1 ms to minimize.
[2021-05-15 19:19:44] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:19:45] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:19:45] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:19:46] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 1 ms to minimize.
[2021-05-15 19:19:46] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 2 ms to minimize.
[2021-05-15 19:19:46] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:19:47] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:19:47] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:19:47] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:19:47] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:19:48] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 1 ms to minimize.
[2021-05-15 19:19:48] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:19:48] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:19:49] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:19:49] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 1 ms to minimize.
[2021-05-15 19:19:49] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:19:50] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 1 ms to minimize.
[2021-05-15 19:19:50] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2021-05-15 19:19:50] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 1 ms to minimize.
[2021-05-15 19:19:50] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:19:51] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:19:51] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:19:51] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:19:52] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 1 ms to minimize.
[2021-05-15 19:19:52] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 0 ms to minimize.
[2021-05-15 19:19:52] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 0 ms to minimize.
[2021-05-15 19:19:52] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 1 ms to minimize.
[2021-05-15 19:19:53] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:19:53] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 0 ms to minimize.
[2021-05-15 19:19:53] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:19:53] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2021-05-15 19:19:54] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 0 ms to minimize.
[2021-05-15 19:19:54] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2021-05-15 19:19:54] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2021-05-15 19:19:54] [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 6
[2021-05-15 19:19:54] [INFO ] [Real]Absence check using 271 positive place invariants in 90 ms returned sat
[2021-05-15 19:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:55] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2021-05-15 19:19:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:19:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 88 ms returned sat
[2021-05-15 19:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:19:57] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2021-05-15 19:19:57] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 1 ms to minimize.
[2021-05-15 19:19:58] [INFO ] Deduced a trap composed of 30 places in 369 ms of which 1 ms to minimize.
[2021-05-15 19:19:58] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 0 ms to minimize.
[2021-05-15 19:19:59] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 0 ms to minimize.
[2021-05-15 19:19:59] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 1 ms to minimize.
[2021-05-15 19:19:59] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2021-05-15 19:20:00] [INFO ] Deduced a trap composed of 25 places in 352 ms of which 1 ms to minimize.
[2021-05-15 19:20:00] [INFO ] Deduced a trap composed of 20 places in 337 ms of which 1 ms to minimize.
[2021-05-15 19:20:01] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 1 ms to minimize.
[2021-05-15 19:20:01] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 1 ms to minimize.
[2021-05-15 19:20:01] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 1 ms to minimize.
[2021-05-15 19:20:02] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:20:02] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:20:03] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:20:03] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 1 ms to minimize.
[2021-05-15 19:20:03] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 0 ms to minimize.
[2021-05-15 19:20:04] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 1 ms to minimize.
[2021-05-15 19:20:04] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:20:04] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 1 ms to minimize.
[2021-05-15 19:20:05] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 1 ms to minimize.
[2021-05-15 19:20:05] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:20:05] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:20:06] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:20:06] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 1 ms to minimize.
[2021-05-15 19:20:06] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:20:06] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:20:07] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:20:07] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 1 ms to minimize.
[2021-05-15 19:20:07] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 1 ms to minimize.
[2021-05-15 19:20:08] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 0 ms to minimize.
[2021-05-15 19:20:08] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2021-05-15 19:20:08] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 1 ms to minimize.
[2021-05-15 19:20:09] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:20:09] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2021-05-15 19:20:09] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:20:09] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2021-05-15 19:20:10] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 0 ms to minimize.
[2021-05-15 19:20:10] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:20:10] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2021-05-15 19:20:10] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2021-05-15 19:20:10] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 0 ms to minimize.
[2021-05-15 19:20:11] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 0 ms to minimize.
[2021-05-15 19:20:11] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2021-05-15 19:20:11] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2021-05-15 19:20:11] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2021-05-15 19:20:12] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 0 ms to minimize.
[2021-05-15 19:20:12] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2021-05-15 19:20:12] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 1 ms to minimize.
[2021-05-15 19:20:12] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 15149 ms
[2021-05-15 19:20:12] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 104 ms.
[2021-05-15 19:20:16] [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 7
[2021-05-15 19:20:16] [INFO ] [Real]Absence check using 271 positive place invariants in 91 ms returned sat
[2021-05-15 19:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:20:17] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2021-05-15 19:20:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:20:18] [INFO ] [Nat]Absence check using 271 positive place invariants in 121 ms returned sat
[2021-05-15 19:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:20:19] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2021-05-15 19:20:19] [INFO ] Deduced a trap composed of 22 places in 676 ms of which 13 ms to minimize.
[2021-05-15 19:20:20] [INFO ] Deduced a trap composed of 19 places in 657 ms of which 2 ms to minimize.
[2021-05-15 19:20:21] [INFO ] Deduced a trap composed of 20 places in 639 ms of which 2 ms to minimize.
[2021-05-15 19:20:22] [INFO ] Deduced a trap composed of 17 places in 706 ms of which 2 ms to minimize.
[2021-05-15 19:20:22] [INFO ] Deduced a trap composed of 22 places in 691 ms of which 2 ms to minimize.
[2021-05-15 19:20:23] [INFO ] Deduced a trap composed of 23 places in 668 ms of which 12 ms to minimize.
[2021-05-15 19:20:24] [INFO ] Deduced a trap composed of 20 places in 669 ms of which 1 ms to minimize.
[2021-05-15 19:20:24] [INFO ] Deduced a trap composed of 27 places in 648 ms of which 1 ms to minimize.
[2021-05-15 19:20:25] [INFO ] Deduced a trap composed of 20 places in 617 ms of which 2 ms to minimize.
[2021-05-15 19:20:26] [INFO ] Deduced a trap composed of 18 places in 606 ms of which 2 ms to minimize.
[2021-05-15 19:20:26] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 1 ms to minimize.
[2021-05-15 19:20:27] [INFO ] Deduced a trap composed of 27 places in 574 ms of which 1 ms to minimize.
[2021-05-15 19:20:28] [INFO ] Deduced a trap composed of 27 places in 669 ms of which 2 ms to minimize.
[2021-05-15 19:20:28] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2021-05-15 19:20:29] [INFO ] Deduced a trap composed of 22 places in 613 ms of which 1 ms to minimize.
[2021-05-15 19:20:30] [INFO ] Deduced a trap composed of 20 places in 605 ms of which 1 ms to minimize.
[2021-05-15 19:20:30] [INFO ] Deduced a trap composed of 20 places in 570 ms of which 1 ms to minimize.
[2021-05-15 19:20:31] [INFO ] Deduced a trap composed of 17 places in 570 ms of which 1 ms to minimize.
[2021-05-15 19:20:32] [INFO ] Deduced a trap composed of 26 places in 549 ms of which 1 ms to minimize.
[2021-05-15 19:20:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 13011 ms
[2021-05-15 19:20:32] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 91 ms.
[2021-05-15 19:20:38] [INFO ] Deduced a trap composed of 16 places in 847 ms of which 1 ms to minimize.
[2021-05-15 19:20:38] [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 8
[2021-05-15 19:20:38] [INFO ] [Real]Absence check using 271 positive place invariants in 85 ms returned sat
[2021-05-15 19:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:20:39] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2021-05-15 19:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:20:39] [INFO ] [Nat]Absence check using 271 positive place invariants in 82 ms returned sat
[2021-05-15 19:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:20:40] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2021-05-15 19:20:41] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 1 ms to minimize.
[2021-05-15 19:20:41] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 1 ms to minimize.
[2021-05-15 19:20:42] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2021-05-15 19:20:42] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 1 ms to minimize.
[2021-05-15 19:20:42] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
[2021-05-15 19:20:43] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 1 ms to minimize.
[2021-05-15 19:20:43] [INFO ] Deduced a trap composed of 22 places in 343 ms of which 1 ms to minimize.
[2021-05-15 19:20:44] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 1 ms to minimize.
[2021-05-15 19:20:44] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 1 ms to minimize.
[2021-05-15 19:20:44] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2021-05-15 19:20:45] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 1 ms to minimize.
[2021-05-15 19:20:45] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:20:46] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 1 ms to minimize.
[2021-05-15 19:20:46] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 0 ms to minimize.
[2021-05-15 19:20:46] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:20:47] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2021-05-15 19:20:47] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 1 ms to minimize.
[2021-05-15 19:20:47] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 3 ms to minimize.
[2021-05-15 19:20:48] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 1 ms to minimize.
[2021-05-15 19:20:48] [INFO ] Deduced a trap composed of 28 places in 334 ms of which 1 ms to minimize.
[2021-05-15 19:20:49] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:20:49] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 1 ms to minimize.
[2021-05-15 19:20:49] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 0 ms to minimize.
[2021-05-15 19:20:50] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 0 ms to minimize.
[2021-05-15 19:20:50] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:20:50] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:20:51] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:20:51] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:20:51] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 0 ms to minimize.
[2021-05-15 19:20:52] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:20:52] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 1 ms to minimize.
[2021-05-15 19:20:52] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 1 ms to minimize.
[2021-05-15 19:20:53] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 1 ms to minimize.
[2021-05-15 19:20:53] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:20:53] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:20:53] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2021-05-15 19:20:54] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 0 ms to minimize.
[2021-05-15 19:20:54] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2021-05-15 19:20:54] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2021-05-15 19:20:55] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 0 ms to minimize.
[2021-05-15 19:20:55] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2021-05-15 19:20:55] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 0 ms to minimize.
[2021-05-15 19:20:55] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:20:56] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2021-05-15 19:20:56] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:20:56] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 0 ms to minimize.
[2021-05-15 19:20:56] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:20:57] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2021-05-15 19:20:57] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 0 ms to minimize.
[2021-05-15 19:20:57] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:20:57] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2021-05-15 19:20:57] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 16987 ms
[2021-05-15 19:20:57] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 96 ms.
[2021-05-15 19:21:00] [INFO ] Deduced a trap composed of 16 places in 815 ms of which 2 ms to minimize.
[2021-05-15 19:21:00] [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 9
[2021-05-15 19:21:00] [INFO ] [Real]Absence check using 271 positive place invariants in 77 ms returned sat
[2021-05-15 19:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:21:01] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2021-05-15 19:21:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:21:01] [INFO ] [Nat]Absence check using 271 positive place invariants in 77 ms returned sat
[2021-05-15 19:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:21:02] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-15 19:21:02] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 0 ms to minimize.
[2021-05-15 19:21:03] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 1 ms to minimize.
[2021-05-15 19:21:03] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2021-05-15 19:21:03] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:21:04] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2021-05-15 19:21:04] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 1 ms to minimize.
[2021-05-15 19:21:05] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 1 ms to minimize.
[2021-05-15 19:21:05] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:21:05] [INFO ] Deduced a trap composed of 28 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:21:06] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 0 ms to minimize.
[2021-05-15 19:21:06] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 0 ms to minimize.
[2021-05-15 19:21:06] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 0 ms to minimize.
[2021-05-15 19:21:07] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 1 ms to minimize.
[2021-05-15 19:21:07] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:21:07] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:21:08] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2021-05-15 19:21:08] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 1 ms to minimize.
[2021-05-15 19:21:08] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2021-05-15 19:21:09] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2021-05-15 19:21:09] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 0 ms to minimize.
[2021-05-15 19:21:09] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 1 ms to minimize.
[2021-05-15 19:21:09] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:21:10] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:21:10] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2021-05-15 19:21:10] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:21:10] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 0 ms to minimize.
[2021-05-15 19:21:11] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 1 ms to minimize.
[2021-05-15 19:21:11] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:21:11] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 0 ms to minimize.
[2021-05-15 19:21:11] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 0 ms to minimize.
[2021-05-15 19:21:12] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:21:12] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:21:12] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:21:12] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 0 ms to minimize.
[2021-05-15 19:21:13] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2021-05-15 19:21:13] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2021-05-15 19:21:13] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:21:13] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 1 ms to minimize.
[2021-05-15 19:21:13] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2021-05-15 19:21:14] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2021-05-15 19:21:15] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2021-05-15 19:21:15] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 0 ms to minimize.
[2021-05-15 19:21:15] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2021-05-15 19:21:15] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 13013 ms
[2021-05-15 19:21:15] [INFO ] Computed and/alt/rep : 1795/2695/1795 causal constraints (skipped 0 transitions) in 88 ms.
[2021-05-15 19:21:22] [INFO ] Deduced a trap composed of 16 places in 869 ms of which 2 ms to minimize.
[2021-05-15 19:21: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 10
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 403 transitions
Trivial Post-agglo rules discarded 403 transitions
Performed 403 trivial Post agglomeration. Transition count delta: 403
Iterating post reduction 0 with 403 rules applied. Total rules applied 403 place count 1945 transition count 1392
Reduce places removed 403 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 406 rules applied. Total rules applied 809 place count 1542 transition count 1389
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 817 place count 1540 transition count 1383
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 823 place count 1534 transition count 1383
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 161 Pre rules applied. Total rules applied 823 place count 1534 transition count 1222
Deduced a syphon composed of 161 places in 2 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 4 with 322 rules applied. Total rules applied 1145 place count 1373 transition count 1222
Discarding 114 places :
Symmetric choice reduction at 4 with 114 rule applications. Total rules 1259 place count 1259 transition count 1108
Iterating global reduction 4 with 114 rules applied. Total rules applied 1373 place count 1259 transition count 1108
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 1373 place count 1259 transition count 1036
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 1517 place count 1187 transition count 1036
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 2 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 4 with 1014 rules applied. Total rules applied 2531 place count 680 transition count 529
Renaming transitions due to excessive name length > 1024 char.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2693 place count 599 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2694 place count 598 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2696 place count 596 transition count 576
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2696 place count 596 transition count 575
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2698 place count 595 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2699 place count 594 transition count 574
Applied a total of 2699 rules in 535 ms. Remains 594 /1946 variables (removed 1352) and now considering 574/1796 (removed 1222) transitions.
[2021-05-15 19:21:23] [INFO ] Flatten gal took : 37 ms
[2021-05-15 19:21:23] [INFO ] Flatten gal took : 39 ms
[2021-05-15 19:21:23] [INFO ] Input system was already deterministic with 574 transitions.
[2021-05-15 19:21:23] [INFO ] Flatten gal took : 31 ms
[2021-05-15 19:21:23] [INFO ] Flatten gal took : 29 ms
[2021-05-15 19:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17224886223138744384.gal : 13 ms
[2021-05-15 19:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16564874210525945449.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17224886223138744384.gal, -t, CGAL, -ctl, /tmp/CTLFireability16564874210525945449.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17224886223138744384.gal -t CGAL -ctl /tmp/CTLFireability16564874210525945449.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13283e+87,1.94822,56440,2,1771,5,212315,6,0,2950,320084,0


Converting to forward existential form...Done !
original formula: (!(AG(!(AF(((((p1122==1)||(p150==1))||(p930==1))||(p615==1)))))) * (AF((((p2025==1)||(p1326==1))||(p1008==1))) + AF(((((((AF((((p288==1)||(p684==1))||(p805==1))) + (p1741==1)) + ((p1704==1)&&(p1706==1))) + (p887==1)) + ((p1434==1)&&(p1532==1))) + (p915==1)) + (p1213==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(!(!(EG(!(((((p1122==1)||(p150==1))||(p930==1))||(p615==1))))))))))] = FALSE * [FwdG((Init * !(!(EG(!((((p2025==1)||(p1326==1))||(p1008==1))))))),!(((((((!(EG(!((((p288==1)||(p684==1))||(p805==1))))) + (p1741==1)) + ((p1704==1)&&(p1706==1))) + (p887==1)) + ((p1434==1)&&(p1532==1))) + (p915==1)) + (p1213==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t32, t33, t34, t35, t37, t38, t39, t40, t104, t117, t121, t127, t131, t136, t140, t144, t149, t152, t157, t161, t167, t172, t177, t178, t187, t191, t194, t198, t203, t205, t256, t260, t268, t276, t278, t288, t296, t300, t308, t312, t318, t324, t332, t336, t343, t350, t360, t362, t372, t376, t378, t392, t394, t401, t402, t403, t404, t408, t412, t420, t428, t432, t440, t442, t449, t450, t451, t452, t460, t462, t481, t482, t483, t484, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/480/94/574
Detected timeout of ITS tools.
[2021-05-15 19:21:53] [INFO ] Flatten gal took : 30 ms
[2021-05-15 19:21:53] [INFO ] Applying decomposition
[2021-05-15 19:21:53] [INFO ] Flatten gal took : 30 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/graph17615718038979170601.txt, -o, /tmp/graph17615718038979170601.bin, -w, /tmp/graph17615718038979170601.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/graph17615718038979170601.bin, -l, -1, -v, -w, /tmp/graph17615718038979170601.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:21:53] [INFO ] Decomposing Gal with order
[2021-05-15 19:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:21:53] [INFO ] Removed a total of 491 redundant transitions.
[2021-05-15 19:21:53] [INFO ] Flatten gal took : 84 ms
[2021-05-15 19:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 21 ms.
[2021-05-15 19:21:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18168970788516341053.gal : 8 ms
[2021-05-15 19:21:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1872854004224445199.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18168970788516341053.gal, -t, CGAL, -ctl, /tmp/CTLFireability1872854004224445199.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18168970788516341053.gal -t CGAL -ctl /tmp/CTLFireability1872854004224445199.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13283e+87,1.81862,57332,465,66,100149,809,953,279846,140,5355,0


Converting to forward existential form...Done !
original formula: (!(AG(!(AF(((((i15.i0.u117.p1122==1)||(i1.u14.p150==1))||(i13.u96.p930==1))||(i7.u65.p615==1)))))) * (AF((((i28.i0.u216.p2025==1)||(i18.i1.u140.p1326==1))||(i14.i1.u104.p1008==1))) + AF(((((((AF((((i3.u28.p288==1)||(i9.u71.p684==1))||(i11.i0.u81.p805==1))) + (i24.u186.p1741==1)) + ((i24.u182.p1704==1)&&(i24.u183.p1706==1))) + (i12.i0.u93.p887==1)) + ((i20.u153.p1434==1)&&(i21.i1.u163.p1532==1))) + (i12.i1.u94.p915==1)) + (i17.u126.p1213==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(!(!(EG(!(((((i15.i0.u117.p1122==1)||(i1.u14.p150==1))||(i13.u96.p930==1))||(i7.u65.p615==1))))))))))] = FALSE * [FwdG((Init * !(!(EG(!((((i28.i0.u216.p2025==1)||(i18.i1.u140.p1326==1))||(i14.i1.u104.p1008==1))))))),!(((((((!(EG(!((((i3.u28.p288==1)||(i9.u71.p684==1))||(i11.i0.u81.p805==1))))) + (i24.u186.p1741==1)) + ((i24.u182.p1704==1)&&(i24.u183.p1706==1))) + (i12.i0.u93.p887==1)) + ((i20.u153.p1434==1)&&(i21.i1.u163.p1532==1))) + (i12.i1.u94.p915==1)) + (i17.u126.p1213==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.t257, i0.t0, i0.i0.t255, i0.i0.u1.t117, i1.t1, i1.u9.t121, i1.u12.t268, i1.u14.t40, i2.t278, i2.t2, i2.i0.t275, i2.i0.u15.t127, i3.t3, i3.u23.t131, i3.u26.t288, i3.u28.t39, i4.t299, i4.t4, i4.i0.t293, i4.i0.u29.t136, i5.t306, i5.t5, i5.i1.t310, i5.i1.u37.t140, i6.t321, i6.t6, i6.i0.t318, i6.i0.u45.t144, i7.u61.t152, i7.u62.t8, i7.u64.t343, i7.u65.t38, i8.t329, i8.t7, i8.i1.t333, i8.i1.u53.t149, i9.t9, i9.u66.t157, i9.u70.t350, i9.u71.t37, i10.t362, i10.t10, i10.i0.t357, i10.i0.u72.t161, i11.t374, i11.t11, i11.i0.t371, i11.i0.u80.t167, i12.t12, i12.i0.u88.t172, i12.i0.u93.t35, i12.i1.u94.t378, i13.t396, i13.t392, i13.t178, i13.t13, i13.u96.t177, i14.t406, i14.t14, i14.i1.t404, i14.i1.u104.t34, i15.t15, i15.i0.u117.t412, i15.i1.u112.t187, i15.i1.u115.t420, i16.t426, i16.t16, i16.i0.t429, i16.i0.u118.t191, i17.t444, i17.t440, i17.t33, i17.t32, i17.t17, i17.u127.t194, i18.i0.u135.t198, i18.i0.u136.t18, i18.i0.u137.t449, i18.i0.u137.t450, i18.i0.u137.t451, i18.i0.u137.t452, i18.i1.u139.t104, i19.t459, i19.t19, i19.i1.t462, i19.i1.u141.t203, i20.t205, i21.t484, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/301/88/389
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 1945 transition count 1402
Reduce places removed 393 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 396 rules applied. Total rules applied 789 place count 1552 transition count 1399
Reduce places removed 2 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 17 rules applied. Total rules applied 806 place count 1550 transition count 1384
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 821 place count 1535 transition count 1384
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 158 Pre rules applied. Total rules applied 821 place count 1535 transition count 1226
Deduced a syphon composed of 158 places in 2 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 316 rules applied. Total rules applied 1137 place count 1377 transition count 1226
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 1245 place count 1269 transition count 1118
Iterating global reduction 4 with 108 rules applied. Total rules applied 1353 place count 1269 transition count 1118
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1353 place count 1269 transition count 1053
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1483 place count 1204 transition count 1053
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 1 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 4 with 996 rules applied. Total rules applied 2479 place count 706 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2641 place count 625 transition count 601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2642 place count 624 transition count 600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2644 place count 622 transition count 600
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2644 place count 622 transition count 599
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2646 place count 621 transition count 599
Applied a total of 2646 rules in 373 ms. Remains 621 /1946 variables (removed 1325) and now considering 599/1796 (removed 1197) transitions.
[2021-05-15 19:22:24] [INFO ] Flatten gal took : 25 ms
[2021-05-15 19:22:24] [INFO ] Flatten gal took : 27 ms
[2021-05-15 19:22:24] [INFO ] Input system was already deterministic with 599 transitions.
[2021-05-15 19:22:24] [INFO ] Flatten gal took : 26 ms
[2021-05-15 19:22:24] [INFO ] Flatten gal took : 26 ms
[2021-05-15 19:22:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6618733359667351215.gal : 3 ms
[2021-05-15 19:22:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11202328289584181867.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6618733359667351215.gal, -t, CGAL, -ctl, /tmp/CTLFireability11202328289584181867.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6618733359667351215.gal -t CGAL -ctl /tmp/CTLFireability11202328289584181867.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27789e+88,4.49643,119168,2,4179,5,462767,6,0,3085,748638,0


Converting to forward existential form...Done !
original formula: !(A(((((((((((p1964==0)&&(p654==0))&&(p1002==0))&&(p920==0))&&(p858==0))&&(p234==0))&&(p477==0))&&(p476==0))&&(p1512==0)) * E((((p1348==0)&&(p690==0))&&(p206==0)) U (((((((((((p99==1)||(p19==1))||(p176==1))||(p304==1))||(p385==1))||(p1205==1))||(p1810==1))||((p537==1)&&(p635==1)))||(p1375==1))||((p192==1)&&(p290==1)))||(p1403==1)))) U AF(((((((p1603==1)||(p764==1))&&(p1965==0))&&(p2075==0))&&(p378==0))&&(p1167==0)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((((((p1603==1)||(p764==1))&&(p1965==0))&&(p2075==0))&&(p378==0))&&(p1167==0))))))) * !(((((((((((p1964==0)&&(p654==0))&&(p1002==0))&&(p920==0))&&(p858==0))&&(p234==0))&&(p477==0))&&(p476==0))&&(p1512==0)) * E((((p1348==0)&&(p690==0))&&(p206==0)) U (((((((((((p99==1)||(p19==1))||(p176==1))||(p304==1))||(p385==1))||(p1205==1))||(p1810==1))||((p537==1)&&(p635==1)))||(p1375==1))||((p192==1)&&(p290==1)))||(p1403==1)))))),!(((((((p1603==1)||(p764==1))&&(p1965==0))&&(p2075==0))&&(p378==0))&&(p1167==0))))] != FALSE + [FwdG(Init,!(!(EG(!(((((((p1603==1)||(p764==1))&&(p1965==0))&&(p2075==0))&&(p378==0))&&(p1167==0)))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t31, t32, t33, t36, t37, t39, t41, t44, t45, t46, t51, t102, t104, t105, t110, t123, t129, t132, t135, t138, t143, t148, t153, t154, t158, t160, t164, t167, t171, t174, t181, t185, t187, t191, t195, t198, t199, t206, t210, t214, t218, t222, t224, t227, t232, t236, t240, t244, t249, t253, t257, t261, t270, t280, t281, t283, t293, t297, t308, t309, t321, t325, t332, t336, t340, t341, t345, t353, t362, t363, t364, t365, t369, t377, t381, t386, t387, t388, t389, t393, t400, t401, t402, t403, t404, t405, t412, t413, t417, t425, t429, t437, t441, t446, t447, t448, t449, t453, t461, t466, t467, t468, t469, t473, t481, t485, t488, t489, t492, t498, t499, t500, t501, t505, t511, t519, t529, t533, t541, t545, t553, t559, t565, t573, t577, t582, t583, t584, t585, t592, t593, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/440/159/599
Detected timeout of ITS tools.
[2021-05-15 19:22:54] [INFO ] Flatten gal took : 27 ms
[2021-05-15 19:22:54] [INFO ] Applying decomposition
[2021-05-15 19:22:54] [INFO ] Flatten gal took : 26 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/graph14099076181618219441.txt, -o, /tmp/graph14099076181618219441.bin, -w, /tmp/graph14099076181618219441.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/graph14099076181618219441.bin, -l, -1, -v, -w, /tmp/graph14099076181618219441.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:22:54] [INFO ] Decomposing Gal with order
[2021-05-15 19:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:22:54] [INFO ] Removed a total of 501 redundant transitions.
[2021-05-15 19:22:54] [INFO ] Flatten gal took : 49 ms
[2021-05-15 19:22:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 18 ms.
[2021-05-15 19:22:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7792095675076071872.gal : 6 ms
[2021-05-15 19:22:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5953516166763789393.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7792095675076071872.gal, -t, CGAL, -ctl, /tmp/CTLFireability5953516166763789393.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7792095675076071872.gal -t CGAL -ctl /tmp/CTLFireability5953516166763789393.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27789e+88,11.775,286136,1282,74,493567,1035,1113,1.92454e+06,131,5916,0


Converting to forward existential form...Done !
original formula: !(A(((((((((((i25.i0.u218.p1964==0)&&(i8.i1.u72.p654==0))&&(i13.i0.u113.p1002==0))&&(i11.u104.p920==0))&&(i10.u97.p858==0))&&(i2.i1.u24.p234==0))&&(i5.i1.u54.p477==0))&&(i5.i1.u55.p476==0))&&(i19.u175.p1512==0)) * E((((i17.u154.p1348==0)&&(i8.i0.u79.p690==0))&&(i2.i0.u22.p206==0)) U (((((((((((i0.u7.p99==1)||(i9.u82.p19==1))||(i2.i0.u16.p176==1))||(i3.i0.u31.p304==1))||(i4.u40.p385==1))||(i15.u137.p1205==1))||(i23.u202.p1810==1))||((i6.u60.p537==1)&&(i7.i1.u70.p635==1)))||(i17.u159.p1375==1))||((i2.i1.u21.p192==1)&&(i3.i0.u30.p290==1)))||(i17.u161.p1403==1)))) U AF(((((((i21.u180.p1603==1)||(i9.u88.p764==1))&&(i26.u219.p1965==0))&&(i27.i0.u231.p2075==0))&&(i4.u40.p378==0))&&(i15.u135.p1167==0)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((((((i21.u180.p1603==1)||(i9.u88.p764==1))&&(i26.u219.p1965==0))&&(i27.i0.u231.p2075==0))&&(i4.u40.p378==0))&&(i15.u135.p1167==0))))))) * !(((((((((((i25.i0.u218.p1964==0)&&(i8.i1.u72.p654==0))&&(i13.i0.u113.p1002==0))&&(i11.u104.p920==0))&&(i10.u97.p858==0))&&(i2.i1.u24.p234==0))&&(i5.i1.u54.p477==0))&&(i5.i1.u55.p476==0))&&(i19.u175.p1512==0)) * E((((i17.u154.p1348==0)&&(i8.i0.u79.p690==0))&&(i2.i0.u22.p206==0)) U (((((((((((i0.u7.p99==1)||(i9.u82.p19==1))||(i2.i0.u16.p176==1))||(i3.i0.u31.p304==1))||(i4.u40.p385==1))||(i15.u137.p1205==1))||(i23.u202.p1810==1))||((i6.u60.p537==1)&&(i7.i1.u70.p635==1)))||(i17.u159.p1375==1))||((i2.i1.u21.p192==1)&&(i3.i0.u30.p290==1)))||(i17.u161.p1403==1)))))),!(((((((i21.u180.p1603==1)||(i9.u88.p764==1))&&(i26.u219.p1965==0))&&(i27.i0.u231.p2075==0))&&(i4.u40.p378==0))&&(i15.u135.p1167==0))))] != FALSE + [FwdG(Init,!(!(EG(!(((((((i21.u180.p1603==1)||(i9.u88.p764==1))&&(i26.u219.p1965==0))&&(i27.i0.u231.p2075==0))&&(i4.u40.p378==0))&&(i15.u135.p1167==0)))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t181, t187, i0.t283, i0.t0, i0.u1.t129, i0.u7.t280, i0.u7.t281, i1.t293, i1.t1, i1.i0.t295, i1.i0.u8.t132, i2.t135, i2.t2, i2.i0.u22.t102, i2.i1.u17.t138, i2.i1.u21.t51, i2.i1.u23.t123, i3.t322, i3.t4, i3.i0.t3, i3.i0.t308, i3.i0.u25.t143, i3.i0.u31.t46, i3.i2.t320, i3.i2.u32.t148, i4.t337, i4.t331, i4.t154, i4.t45, i4.t44, i4.t5, i4.u41.t153, i5.t341, i5.i0.t6, i5.i0.u49.t158, i5.i0.u53.t345, i5.i1.u54.t104, i6.t352, i6.t160, i6.t7, i6.u56.t164, i6.u60.t41, i7.t363, i7.t8, i7.i1.t369, i7.i1.u64.t167, i8.t171, i8.i0.t173, i8.i0.u79.t105, i8.i1.t9, i8.i1.t377, i8.i1.t381, i9.t391, i9.t389, i9.t10, i9.u88.t39, i10.t402, i10.t11, i10.u91.t185, i10.u97.t400, i10.u97.t401, i11.t414, i11.t12, i11.u98.t191, i11.u104.t412, i11.u104.t413, i12.t427, i12.t13, i12.i1.t422, i12.i1.u105.t195, i13.t447, i13.t15, i13.i0.t14, i13.i0.t198, i13.i0.t435, i13.i0.t441, i13.i0.u114.t199, i13.i2.t452, i13.i2.u122.t206, i14.t473, i14.t17, i14.i0.t467, i14.i0.u138.t214, i15.t461, i15.t16, i15.u130.t210, i15.u135.t37, i15.u137.t36, i16.t479, i16.t18, i16.i1.t483, i16.i1.u146.t218, i17.t492, i17.t222, i17.u155.t227, i17.u156.t19, i17.u159.t224, i17.u161.t488, i17.u161.t489, i18.t498, i18.t20, i18.i1.t502, i18.i1.u162.t232, i19.t21, i19.u170.t236, i19.u174.t511, i19.u175.t33, i20.t531, i20.t23, i20.i0.t527, i20.i0.u181.t244, i21.u176.t240, i21.u177.t22, i21.u178.t519, i21.u180.t32, i22.t539, i22.t24, i22.i0.t543, i22.i0.u189.t249, i23.t25, i23.u197.t253, i23.u200.t553, i23.u202.t110, i24.t564, i24.t26, i24.i0.t559, i24.i0.u203.t257, i25.t574, i25.t27, i25.i0.t573, i25.i0.u211.t261, i25.i0.u218.t31, i26.t584, i26.t270, i27.i1.t593, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/278/135/413
Detected timeout of ITS tools.
[2021-05-15 19:23:24] [INFO ] Flatten gal took : 52 ms
[2021-05-15 19:23:24] [INFO ] Flatten gal took : 62 ms
[2021-05-15 19:23:24] [INFO ] Applying decomposition
[2021-05-15 19:23:25] [INFO ] Flatten gal took : 56 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/graph14185201250056627316.txt, -o, /tmp/graph14185201250056627316.bin, -w, /tmp/graph14185201250056627316.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/graph14185201250056627316.bin, -l, -1, -v, -w, /tmp/graph14185201250056627316.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:23:25] [INFO ] Decomposing Gal with order
[2021-05-15 19:23:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:23:25] [INFO ] Removed a total of 195 redundant transitions.
[2021-05-15 19:23:25] [INFO ] Flatten gal took : 106 ms
[2021-05-15 19:23:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 19:23:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6860045158990600528.gal : 15 ms
[2021-05-15 19:23:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12372060332199158397.ctl : 5 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6860045158990600528.gal, -t, CGAL, -ctl, /tmp/CTLFireability12372060332199158397.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6860045158990600528.gal -t CGAL -ctl /tmp/CTLFireability12372060332199158397.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 19:45:41] [INFO ] Applying decomposition
[2021-05-15 19:45:50] [INFO ] Flatten gal took : 9614 ms
[2021-05-15 19:45:50] [INFO ] Decomposing Gal with order
[2021-05-15 19:45:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:45:52] [INFO ] Removed a total of 37 redundant transitions.
[2021-05-15 19:45:52] [INFO ] Flatten gal took : 308 ms
[2021-05-15 19:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 19:45:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13172117895051702944.gal : 32 ms
[2021-05-15 19:45:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4866841196116900516.ctl : 10 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13172117895051702944.gal, -t, CGAL, -ctl, /tmp/CTLFireability4866841196116900516.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13172117895051702944.gal -t CGAL -ctl /tmp/CTLFireability4866841196116900516.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 20:08:16] [INFO ] Flatten gal took : 186 ms
[2021-05-15 20:08:18] [INFO ] Input system was already deterministic with 1796 transitions.
[2021-05-15 20:08:19] [INFO ] Transformed 1946 places.
[2021-05-15 20:08:19] [INFO ] Transformed 1796 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-15 20:08:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11185407543907953830.gal : 66 ms
[2021-05-15 20:08:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1101840013727123533.ctl : 8 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11185407543907953830.gal, -t, CGAL, -ctl, /tmp/CTLFireability1101840013727123533.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11185407543907953830.gal -t CGAL -ctl /tmp/CTLFireability1101840013727123533.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLFireability"
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 ShieldIIPt-PT-030B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205100458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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