Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 48K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 105K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 351K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Mar 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Mar 27 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 25 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 25 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621025711737

Running Version 0
[2021-05-14 20:55:13] [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-14 20:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:55:13] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2021-05-14 20:55:13] [INFO ] Transformed 1330 places.
[2021-05-14 20:55:13] [INFO ] Transformed 2030 transitions.
[2021-05-14 20:55:13] [INFO ] Found NUPN structural information;
[2021-05-14 20:55:13] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 219 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2021-05-14 20:55:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:55:14] [INFO ] Computed 27 place invariants in 33 ms
[2021-05-14 20:55:14] [INFO ] Implicit Places using invariants in 425 ms returned []
[2021-05-14 20:55:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:55:14] [INFO ] Computed 27 place invariants in 10 ms
[2021-05-14 20:55:15] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 20:55:15] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2021-05-14 20:55:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:55:15] [INFO ] Computed 27 place invariants in 9 ms
[2021-05-14 20:55:16] [INFO ] Dead Transitions using invariants and state equation in 1123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
[2021-05-14 20:55:17] [INFO ] Flatten gal took : 393 ms
[2021-05-14 20:55:21] [INFO ] Flatten gal took : 390 ms
[2021-05-14 20:55:24] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2642 ms. (steps per millisecond=37 ) properties (out of 97) seen :82
Running SMT prover for 15 properties.
[2021-05-14 20:55:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:55:27] [INFO ] Computed 27 place invariants in 16 ms
[2021-05-14 20:55:27] [INFO ] [Real]Absence check using 20 positive place invariants in 78 ms returned sat
[2021-05-14 20:55:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 24 ms returned sat
[2021-05-14 20:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:55:31] [INFO ] [Real]Absence check using state equation in 3390 ms returned sat
[2021-05-14 20:55:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:55:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 77 ms returned sat
[2021-05-14 20:55:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-14 20:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:55:34] [INFO ] [Nat]Absence check using state equation in 2724 ms returned sat
[2021-05-14 20:55:34] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 20:55:34] [INFO ] [Nat]Added 366 Read/Feed constraints in 133 ms returned sat
[2021-05-14 20:55:35] [INFO ] Deduced a trap composed of 29 places in 609 ms of which 4 ms to minimize.
[2021-05-14 20:55:35] [INFO ] Deduced a trap composed of 12 places in 582 ms of which 13 ms to minimize.
[2021-05-14 20:55:36] [INFO ] Deduced a trap composed of 41 places in 606 ms of which 2 ms to minimize.
[2021-05-14 20:55:37] [INFO ] Deduced a trap composed of 33 places in 600 ms of which 2 ms to minimize.
[2021-05-14 20:55:37] [INFO ] Deduced a trap composed of 19 places in 592 ms of which 1 ms to minimize.
[2021-05-14 20:55:38] [INFO ] Deduced a trap composed of 12 places in 514 ms of which 1 ms to minimize.
[2021-05-14 20:55:39] [INFO ] Deduced a trap composed of 20 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:55:39] [INFO ] Deduced a trap composed of 16 places in 500 ms of which 1 ms to minimize.
[2021-05-14 20:55:40] [INFO ] Deduced a trap composed of 37 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:55:40] [INFO ] Deduced a trap composed of 98 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:55:41] [INFO ] Deduced a trap composed of 42 places in 494 ms of which 1 ms to minimize.
[2021-05-14 20:55:41] [INFO ] Deduced a trap composed of 59 places in 499 ms of which 2 ms to minimize.
[2021-05-14 20:55:42] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 1 ms to minimize.
[2021-05-14 20:55:43] [INFO ] Deduced a trap composed of 24 places in 482 ms of which 1 ms to minimize.
[2021-05-14 20:55:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 8732 ms
[2021-05-14 20:55:43] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 20:55:43] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:55:44] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2021-05-14 20:55:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:55:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 20:55:44] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-14 20:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:55:45] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2021-05-14 20:55:45] [INFO ] [Nat]Added 366 Read/Feed constraints in 103 ms returned sat
[2021-05-14 20:55:46] [INFO ] Deduced a trap composed of 255 places in 424 ms of which 0 ms to minimize.
[2021-05-14 20:55:46] [INFO ] Deduced a trap composed of 84 places in 424 ms of which 1 ms to minimize.
[2021-05-14 20:55:47] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:55:47] [INFO ] Deduced a trap composed of 58 places in 426 ms of which 1 ms to minimize.
[2021-05-14 20:55:48] [INFO ] Deduced a trap composed of 87 places in 366 ms of which 0 ms to minimize.
[2021-05-14 20:55:48] [INFO ] Deduced a trap composed of 178 places in 369 ms of which 1 ms to minimize.
[2021-05-14 20:55:49] [INFO ] Deduced a trap composed of 178 places in 390 ms of which 1 ms to minimize.
[2021-05-14 20:55:49] [INFO ] Deduced a trap composed of 142 places in 366 ms of which 1 ms to minimize.
[2021-05-14 20:55:49] [INFO ] Deduced a trap composed of 194 places in 370 ms of which 1 ms to minimize.
[2021-05-14 20:55:50] [INFO ] Deduced a trap composed of 142 places in 366 ms of which 1 ms to minimize.
[2021-05-14 20:55:50] [INFO ] Deduced a trap composed of 123 places in 372 ms of which 1 ms to minimize.
[2021-05-14 20:55:51] [INFO ] Deduced a trap composed of 117 places in 366 ms of which 0 ms to minimize.
[2021-05-14 20:55:51] [INFO ] Deduced a trap composed of 143 places in 368 ms of which 1 ms to minimize.
[2021-05-14 20:55:52] [INFO ] Deduced a trap composed of 118 places in 365 ms of which 1 ms to minimize.
[2021-05-14 20:55:52] [INFO ] Deduced a trap composed of 88 places in 344 ms of which 1 ms to minimize.
[2021-05-14 20:55:52] [INFO ] Deduced a trap composed of 87 places in 358 ms of which 1 ms to minimize.
[2021-05-14 20:55:53] [INFO ] Deduced a trap composed of 87 places in 346 ms of which 1 ms to minimize.
[2021-05-14 20:55:53] [INFO ] Deduced a trap composed of 88 places in 346 ms of which 1 ms to minimize.
[2021-05-14 20:55:53] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8127 ms
[2021-05-14 20:55:53] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 112 ms.
[2021-05-14 20:56:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 20:56:04] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned sat
[2021-05-14 20:56:04] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:05] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-14 20:56:05] [INFO ] [Real]Added 366 Read/Feed constraints in 75 ms returned sat
[2021-05-14 20:56:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:56:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:56:05] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:56:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:06] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2021-05-14 20:56:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 115 ms returned sat
[2021-05-14 20:56:06] [INFO ] Deduced a trap composed of 329 places in 408 ms of which 1 ms to minimize.
[2021-05-14 20:56:07] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 1 ms to minimize.
[2021-05-14 20:56:07] [INFO ] Deduced a trap composed of 118 places in 405 ms of which 1 ms to minimize.
[2021-05-14 20:56:08] [INFO ] Deduced a trap composed of 146 places in 399 ms of which 1 ms to minimize.
[2021-05-14 20:56:08] [INFO ] Deduced a trap composed of 146 places in 401 ms of which 1 ms to minimize.
[2021-05-14 20:56:09] [INFO ] Deduced a trap composed of 299 places in 398 ms of which 0 ms to minimize.
[2021-05-14 20:56:09] [INFO ] Deduced a trap composed of 118 places in 410 ms of which 1 ms to minimize.
[2021-05-14 20:56:10] [INFO ] Deduced a trap composed of 118 places in 405 ms of which 1 ms to minimize.
[2021-05-14 20:56:10] [INFO ] Deduced a trap composed of 185 places in 547 ms of which 1 ms to minimize.
[2021-05-14 20:56:11] [INFO ] Deduced a trap composed of 185 places in 549 ms of which 2 ms to minimize.
[2021-05-14 20:56:12] [INFO ] Deduced a trap composed of 185 places in 546 ms of which 1 ms to minimize.
[2021-05-14 20:56:12] [INFO ] Deduced a trap composed of 16 places in 546 ms of which 1 ms to minimize.
[2021-05-14 20:56:13] [INFO ] Deduced a trap composed of 12 places in 586 ms of which 1 ms to minimize.
[2021-05-14 20:56:13] [INFO ] Deduced a trap composed of 16 places in 550 ms of which 1 ms to minimize.
[2021-05-14 20:56:14] [INFO ] Deduced a trap composed of 53 places in 549 ms of which 1 ms to minimize.
[2021-05-14 20:56:15] [INFO ] Deduced a trap composed of 65 places in 557 ms of which 1 ms to minimize.
[2021-05-14 20:56:15] [INFO ] Deduced a trap composed of 56 places in 546 ms of which 1 ms to minimize.
[2021-05-14 20:56:16] [INFO ] Deduced a trap composed of 87 places in 549 ms of which 1 ms to minimize.
[2021-05-14 20:56:16] [INFO ] Deduced a trap composed of 83 places in 549 ms of which 2 ms to minimize.
[2021-05-14 20:56:17] [INFO ] Deduced a trap composed of 37 places in 543 ms of which 1 ms to minimize.
[2021-05-14 20:56:18] [INFO ] Deduced a trap composed of 12 places in 538 ms of which 1 ms to minimize.
[2021-05-14 20:56:18] [INFO ] Deduced a trap composed of 12 places in 541 ms of which 1 ms to minimize.
[2021-05-14 20:56:19] [INFO ] Deduced a trap composed of 53 places in 544 ms of which 1 ms to minimize.
[2021-05-14 20:56:20] [INFO ] Deduced a trap composed of 19 places in 552 ms of which 1 ms to minimize.
[2021-05-14 20:56:20] [INFO ] Deduced a trap composed of 12 places in 546 ms of which 2 ms to minimize.
[2021-05-14 20:56:21] [INFO ] Deduced a trap composed of 40 places in 516 ms of which 1 ms to minimize.
[2021-05-14 20:56:21] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 1 ms to minimize.
[2021-05-14 20:56:22] [INFO ] Deduced a trap composed of 84 places in 451 ms of which 1 ms to minimize.
[2021-05-14 20:56:22] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:56:23] [INFO ] Deduced a trap composed of 102 places in 451 ms of which 1 ms to minimize.
[2021-05-14 20:56:23] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:56:24] [INFO ] Deduced a trap composed of 129 places in 388 ms of which 1 ms to minimize.
[2021-05-14 20:56:24] [INFO ] Deduced a trap composed of 129 places in 383 ms of which 1 ms to minimize.
[2021-05-14 20:56:25] [INFO ] Deduced a trap composed of 77 places in 383 ms of which 1 ms to minimize.
[2021-05-14 20:56:25] [INFO ] Deduced a trap composed of 102 places in 323 ms of which 1 ms to minimize.
[2021-05-14 20:56:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 20:56:25] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 20:56:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:26] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2021-05-14 20:56:26] [INFO ] [Real]Added 366 Read/Feed constraints in 85 ms returned sat
[2021-05-14 20:56:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:56:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:56:26] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:27] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2021-05-14 20:56:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 101 ms returned sat
[2021-05-14 20:56:28] [INFO ] Deduced a trap composed of 132 places in 520 ms of which 8 ms to minimize.
[2021-05-14 20:56:28] [INFO ] Deduced a trap composed of 42 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:56:29] [INFO ] Deduced a trap composed of 205 places in 487 ms of which 1 ms to minimize.
[2021-05-14 20:56:29] [INFO ] Deduced a trap composed of 65 places in 483 ms of which 1 ms to minimize.
[2021-05-14 20:56:30] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 1 ms to minimize.
[2021-05-14 20:56:30] [INFO ] Deduced a trap composed of 74 places in 457 ms of which 1 ms to minimize.
[2021-05-14 20:56:31] [INFO ] Deduced a trap composed of 12 places in 464 ms of which 1 ms to minimize.
[2021-05-14 20:56:31] [INFO ] Deduced a trap composed of 295 places in 473 ms of which 1 ms to minimize.
[2021-05-14 20:56:32] [INFO ] Deduced a trap composed of 12 places in 473 ms of which 0 ms to minimize.
[2021-05-14 20:56:33] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 0 ms to minimize.
[2021-05-14 20:56:33] [INFO ] Deduced a trap composed of 54 places in 453 ms of which 1 ms to minimize.
[2021-05-14 20:56:34] [INFO ] Deduced a trap composed of 44 places in 455 ms of which 1 ms to minimize.
[2021-05-14 20:56:34] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 2 ms to minimize.
[2021-05-14 20:56:35] [INFO ] Deduced a trap composed of 44 places in 454 ms of which 1 ms to minimize.
[2021-05-14 20:56:35] [INFO ] Deduced a trap composed of 54 places in 456 ms of which 1 ms to minimize.
[2021-05-14 20:56:36] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 1 ms to minimize.
[2021-05-14 20:56:36] [INFO ] Deduced a trap composed of 120 places in 458 ms of which 1 ms to minimize.
[2021-05-14 20:56:37] [INFO ] Deduced a trap composed of 106 places in 460 ms of which 1 ms to minimize.
[2021-05-14 20:56:37] [INFO ] Deduced a trap composed of 106 places in 458 ms of which 1 ms to minimize.
[2021-05-14 20:56:38] [INFO ] Deduced a trap composed of 144 places in 481 ms of which 1 ms to minimize.
[2021-05-14 20:56:38] [INFO ] Deduced a trap composed of 102 places in 456 ms of which 1 ms to minimize.
[2021-05-14 20:56:39] [INFO ] Deduced a trap composed of 12 places in 451 ms of which 1 ms to minimize.
[2021-05-14 20:56:39] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 1 ms to minimize.
[2021-05-14 20:56:40] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 0 ms to minimize.
[2021-05-14 20:56:40] [INFO ] Deduced a trap composed of 59 places in 394 ms of which 1 ms to minimize.
[2021-05-14 20:56:41] [INFO ] Deduced a trap composed of 59 places in 393 ms of which 1 ms to minimize.
[2021-05-14 20:56:41] [INFO ] Deduced a trap composed of 44 places in 398 ms of which 1 ms to minimize.
[2021-05-14 20:56:42] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:56:42] [INFO ] Deduced a trap composed of 59 places in 392 ms of which 1 ms to minimize.
[2021-05-14 20:56:43] [INFO ] Deduced a trap composed of 148 places in 419 ms of which 1 ms to minimize.
[2021-05-14 20:56:43] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 1 ms to minimize.
[2021-05-14 20:56:44] [INFO ] Deduced a trap composed of 148 places in 421 ms of which 1 ms to minimize.
[2021-05-14 20:56:44] [INFO ] Deduced a trap composed of 147 places in 415 ms of which 1 ms to minimize.
[2021-05-14 20:56:45] [INFO ] Deduced a trap composed of 80 places in 425 ms of which 1 ms to minimize.
[2021-05-14 20:56:45] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 0 ms to minimize.
[2021-05-14 20:56:46] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 1 ms to minimize.
[2021-05-14 20:56:46] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 1 ms to minimize.
[2021-05-14 20:56:46] [INFO ] Deduced a trap composed of 90 places in 357 ms of which 0 ms to minimize.
[2021-05-14 20:56:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 20:56:47] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:56:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:47] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-14 20:56:47] [INFO ] [Real]Added 366 Read/Feed constraints in 82 ms returned sat
[2021-05-14 20:56:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:56:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 20:56:47] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:56:48] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-14 20:56:48] [INFO ] [Nat]Added 366 Read/Feed constraints in 110 ms returned sat
[2021-05-14 20:56:49] [INFO ] Deduced a trap composed of 12 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:56:49] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 1 ms to minimize.
[2021-05-14 20:56:50] [INFO ] Deduced a trap composed of 12 places in 481 ms of which 1 ms to minimize.
[2021-05-14 20:56:50] [INFO ] Deduced a trap composed of 27 places in 481 ms of which 1 ms to minimize.
[2021-05-14 20:56:51] [INFO ] Deduced a trap composed of 12 places in 480 ms of which 1 ms to minimize.
[2021-05-14 20:56:51] [INFO ] Deduced a trap composed of 12 places in 484 ms of which 1 ms to minimize.
[2021-05-14 20:56:52] [INFO ] Deduced a trap composed of 72 places in 448 ms of which 1 ms to minimize.
[2021-05-14 20:56:52] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:56:53] [INFO ] Deduced a trap composed of 102 places in 454 ms of which 1 ms to minimize.
[2021-05-14 20:56:53] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 1 ms to minimize.
[2021-05-14 20:56:54] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 1 ms to minimize.
[2021-05-14 20:56:54] [INFO ] Deduced a trap composed of 72 places in 454 ms of which 1 ms to minimize.
[2021-05-14 20:56:55] [INFO ] Deduced a trap composed of 72 places in 471 ms of which 1 ms to minimize.
[2021-05-14 20:56:55] [INFO ] Deduced a trap composed of 149 places in 424 ms of which 1 ms to minimize.
[2021-05-14 20:56:56] [INFO ] Deduced a trap composed of 168 places in 422 ms of which 1 ms to minimize.
[2021-05-14 20:56:56] [INFO ] Deduced a trap composed of 154 places in 423 ms of which 1 ms to minimize.
[2021-05-14 20:56:57] [INFO ] Deduced a trap composed of 163 places in 420 ms of which 1 ms to minimize.
[2021-05-14 20:56:57] [INFO ] Deduced a trap composed of 52 places in 435 ms of which 1 ms to minimize.
[2021-05-14 20:56:58] [INFO ] Deduced a trap composed of 168 places in 420 ms of which 1 ms to minimize.
[2021-05-14 20:56:58] [INFO ] Deduced a trap composed of 149 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:56:59] [INFO ] Deduced a trap composed of 173 places in 420 ms of which 1 ms to minimize.
[2021-05-14 20:56:59] [INFO ] Deduced a trap composed of 154 places in 422 ms of which 1 ms to minimize.
[2021-05-14 20:57:00] [INFO ] Deduced a trap composed of 136 places in 420 ms of which 1 ms to minimize.
[2021-05-14 20:57:00] [INFO ] Deduced a trap composed of 68 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:57:01] [INFO ] Deduced a trap composed of 50 places in 499 ms of which 1 ms to minimize.
[2021-05-14 20:57:02] [INFO ] Deduced a trap composed of 68 places in 511 ms of which 1 ms to minimize.
[2021-05-14 20:57:02] [INFO ] Deduced a trap composed of 50 places in 499 ms of which 1 ms to minimize.
[2021-05-14 20:57:03] [INFO ] Deduced a trap composed of 57 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:57:03] [INFO ] Deduced a trap composed of 90 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:57:04] [INFO ] Deduced a trap composed of 46 places in 472 ms of which 1 ms to minimize.
[2021-05-14 20:57:04] [INFO ] Deduced a trap composed of 60 places in 473 ms of which 1 ms to minimize.
[2021-05-14 20:57:05] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 5 ms to minimize.
[2021-05-14 20:57:06] [INFO ] Deduced a trap composed of 54 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:57:06] [INFO ] Deduced a trap composed of 90 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:57:07] [INFO ] Deduced a trap composed of 106 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:57:07] [INFO ] Deduced a trap composed of 326 places in 487 ms of which 1 ms to minimize.
[2021-05-14 20:57:08] [INFO ] Deduced a trap composed of 2 places in 607 ms of which 1 ms to minimize.
[2021-05-14 20:57:08] [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-14 20:57:08] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:57:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:09] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-14 20:57:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:57:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:57:09] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:10] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-14 20:57:10] [INFO ] [Nat]Added 366 Read/Feed constraints in 89 ms returned sat
[2021-05-14 20:57:10] [INFO ] Deduced a trap composed of 34 places in 448 ms of which 3 ms to minimize.
[2021-05-14 20:57:11] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 1 ms to minimize.
[2021-05-14 20:57:11] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 1 ms to minimize.
[2021-05-14 20:57:12] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 1 ms to minimize.
[2021-05-14 20:57:12] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 1 ms to minimize.
[2021-05-14 20:57:13] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 0 ms to minimize.
[2021-05-14 20:57:13] [INFO ] Deduced a trap composed of 12 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:57:14] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 1 ms to minimize.
[2021-05-14 20:57:14] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 1 ms to minimize.
[2021-05-14 20:57:15] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 1 ms to minimize.
[2021-05-14 20:57:15] [INFO ] Deduced a trap composed of 44 places in 435 ms of which 1 ms to minimize.
[2021-05-14 20:57:16] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 1 ms to minimize.
[2021-05-14 20:57:16] [INFO ] Deduced a trap composed of 82 places in 442 ms of which 1 ms to minimize.
[2021-05-14 20:57:17] [INFO ] Deduced a trap composed of 76 places in 433 ms of which 1 ms to minimize.
[2021-05-14 20:57:17] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 0 ms to minimize.
[2021-05-14 20:57:18] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 1 ms to minimize.
[2021-05-14 20:57:18] [INFO ] Deduced a trap composed of 49 places in 436 ms of which 1 ms to minimize.
[2021-05-14 20:57:19] [INFO ] Deduced a trap composed of 46 places in 430 ms of which 1 ms to minimize.
[2021-05-14 20:57:19] [INFO ] Deduced a trap composed of 46 places in 433 ms of which 1 ms to minimize.
[2021-05-14 20:57:20] [INFO ] Deduced a trap composed of 87 places in 438 ms of which 1 ms to minimize.
[2021-05-14 20:57:20] [INFO ] Deduced a trap composed of 50 places in 417 ms of which 1 ms to minimize.
[2021-05-14 20:57:21] [INFO ] Deduced a trap composed of 64 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:57:21] [INFO ] Deduced a trap composed of 86 places in 412 ms of which 1 ms to minimize.
[2021-05-14 20:57:22] [INFO ] Deduced a trap composed of 44 places in 383 ms of which 1 ms to minimize.
[2021-05-14 20:57:22] [INFO ] Deduced a trap composed of 83 places in 399 ms of which 0 ms to minimize.
[2021-05-14 20:57:23] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 1 ms to minimize.
[2021-05-14 20:57:23] [INFO ] Deduced a trap composed of 44 places in 396 ms of which 1 ms to minimize.
[2021-05-14 20:57:24] [INFO ] Deduced a trap composed of 42 places in 495 ms of which 1 ms to minimize.
[2021-05-14 20:57:25] [INFO ] Deduced a trap composed of 94 places in 494 ms of which 1 ms to minimize.
[2021-05-14 20:57:25] [INFO ] Deduced a trap composed of 94 places in 492 ms of which 1 ms to minimize.
[2021-05-14 20:57:26] [INFO ] Deduced a trap composed of 94 places in 494 ms of which 1 ms to minimize.
[2021-05-14 20:57:26] [INFO ] Deduced a trap composed of 120 places in 492 ms of which 1 ms to minimize.
[2021-05-14 20:57:27] [INFO ] Deduced a trap composed of 91 places in 505 ms of which 1 ms to minimize.
[2021-05-14 20:57:27] [INFO ] Deduced a trap composed of 123 places in 491 ms of which 1 ms to minimize.
[2021-05-14 20:57:28] [INFO ] Deduced a trap composed of 20 places in 490 ms of which 1 ms to minimize.
[2021-05-14 20:57:29] [INFO ] Deduced a trap composed of 84 places in 453 ms of which 0 ms to minimize.
[2021-05-14 20:57:29] [INFO ] Deduced a trap composed of 145 places in 455 ms of which 1 ms to minimize.
[2021-05-14 20:57:29] [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-14 20:57:29] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:57:29] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:30] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-14 20:57:30] [INFO ] [Real]Added 366 Read/Feed constraints in 98 ms returned sat
[2021-05-14 20:57:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:57:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:57:30] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:31] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-14 20:57:31] [INFO ] [Nat]Added 366 Read/Feed constraints in 111 ms returned sat
[2021-05-14 20:57:31] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 0 ms to minimize.
[2021-05-14 20:57:32] [INFO ] Deduced a trap composed of 34 places in 403 ms of which 0 ms to minimize.
[2021-05-14 20:57:32] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 0 ms to minimize.
[2021-05-14 20:57:33] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 1 ms to minimize.
[2021-05-14 20:57:33] [INFO ] Deduced a trap composed of 85 places in 370 ms of which 0 ms to minimize.
[2021-05-14 20:57:34] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 1 ms to minimize.
[2021-05-14 20:57:34] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2021-05-14 20:57:34] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2021-05-14 20:57:35] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2021-05-14 20:57:35] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2021-05-14 20:57:36] [INFO ] Deduced a trap composed of 12 places in 402 ms of which 1 ms to minimize.
[2021-05-14 20:57:36] [INFO ] Deduced a trap composed of 12 places in 403 ms of which 1 ms to minimize.
[2021-05-14 20:57:37] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 1 ms to minimize.
[2021-05-14 20:57:37] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 1 ms to minimize.
[2021-05-14 20:57:38] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 1 ms to minimize.
[2021-05-14 20:57:38] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2021-05-14 20:57:39] [INFO ] Deduced a trap composed of 50 places in 402 ms of which 1 ms to minimize.
[2021-05-14 20:57:39] [INFO ] Deduced a trap composed of 271 places in 394 ms of which 1 ms to minimize.
[2021-05-14 20:57:40] [INFO ] Deduced a trap composed of 21 places in 396 ms of which 1 ms to minimize.
[2021-05-14 20:57:40] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 0 ms to minimize.
[2021-05-14 20:57:40] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 1 ms to minimize.
[2021-05-14 20:57:41] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 1 ms to minimize.
[2021-05-14 20:57:41] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 1 ms to minimize.
[2021-05-14 20:57:42] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 1 ms to minimize.
[2021-05-14 20:57:42] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 0 ms to minimize.
[2021-05-14 20:57:42] [INFO ] Deduced a trap composed of 72 places in 334 ms of which 1 ms to minimize.
[2021-05-14 20:57:43] [INFO ] Deduced a trap composed of 86 places in 388 ms of which 1 ms to minimize.
[2021-05-14 20:57:43] [INFO ] Deduced a trap composed of 97 places in 376 ms of which 1 ms to minimize.
[2021-05-14 20:57:44] [INFO ] Deduced a trap composed of 119 places in 470 ms of which 1 ms to minimize.
[2021-05-14 20:57:44] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 1 ms to minimize.
[2021-05-14 20:57:45] [INFO ] Deduced a trap composed of 112 places in 375 ms of which 0 ms to minimize.
[2021-05-14 20:57:45] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 1 ms to minimize.
[2021-05-14 20:57:46] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2021-05-14 20:57:46] [INFO ] Deduced a trap composed of 101 places in 372 ms of which 0 ms to minimize.
[2021-05-14 20:57:47] [INFO ] Deduced a trap composed of 109 places in 375 ms of which 1 ms to minimize.
[2021-05-14 20:57:47] [INFO ] Deduced a trap composed of 101 places in 369 ms of which 0 ms to minimize.
[2021-05-14 20:57:48] [INFO ] Deduced a trap composed of 101 places in 375 ms of which 0 ms to minimize.
[2021-05-14 20:57:48] [INFO ] Deduced a trap composed of 59 places in 367 ms of which 1 ms to minimize.
[2021-05-14 20:57:48] [INFO ] Deduced a trap composed of 223 places in 236 ms of which 1 ms to minimize.
[2021-05-14 20:57:49] [INFO ] Deduced a trap composed of 147 places in 246 ms of which 1 ms to minimize.
[2021-05-14 20:57:49] [INFO ] Deduced a trap composed of 199 places in 378 ms of which 1 ms to minimize.
[2021-05-14 20:57:49] [INFO ] Deduced a trap composed of 99 places in 362 ms of which 1 ms to minimize.
[2021-05-14 20:57:50] [INFO ] Deduced a trap composed of 99 places in 361 ms of which 0 ms to minimize.
[2021-05-14 20:57:50] [INFO ] Deduced a trap composed of 59 places in 368 ms of which 1 ms to minimize.
[2021-05-14 20:57:50] [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-14 20:57:51] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:57:51] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:51] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2021-05-14 20:57:51] [INFO ] [Real]Added 366 Read/Feed constraints in 79 ms returned sat
[2021-05-14 20:57:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:57:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:57:51] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:57:52] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2021-05-14 20:57:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 105 ms returned sat
[2021-05-14 20:57:53] [INFO ] Deduced a trap composed of 42 places in 474 ms of which 1 ms to minimize.
[2021-05-14 20:57:53] [INFO ] Deduced a trap composed of 89 places in 468 ms of which 1 ms to minimize.
[2021-05-14 20:57:54] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 1 ms to minimize.
[2021-05-14 20:57:54] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2021-05-14 20:57:55] [INFO ] Deduced a trap composed of 53 places in 470 ms of which 1 ms to minimize.
[2021-05-14 20:57:55] [INFO ] Deduced a trap composed of 12 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:57:56] [INFO ] Deduced a trap composed of 41 places in 473 ms of which 1 ms to minimize.
[2021-05-14 20:57:56] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 1 ms to minimize.
[2021-05-14 20:57:57] [INFO ] Deduced a trap composed of 41 places in 469 ms of which 1 ms to minimize.
[2021-05-14 20:57:57] [INFO ] Deduced a trap composed of 54 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:57:58] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 1 ms to minimize.
[2021-05-14 20:57:59] [INFO ] Deduced a trap composed of 84 places in 480 ms of which 1 ms to minimize.
[2021-05-14 20:57:59] [INFO ] Deduced a trap composed of 83 places in 469 ms of which 1 ms to minimize.
[2021-05-14 20:58:00] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 1 ms to minimize.
[2021-05-14 20:58:00] [INFO ] Deduced a trap composed of 42 places in 468 ms of which 0 ms to minimize.
[2021-05-14 20:58:01] [INFO ] Deduced a trap composed of 28 places in 448 ms of which 1 ms to minimize.
[2021-05-14 20:58:01] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 1 ms to minimize.
[2021-05-14 20:58:02] [INFO ] Deduced a trap composed of 83 places in 401 ms of which 1 ms to minimize.
[2021-05-14 20:58:02] [INFO ] Deduced a trap composed of 106 places in 403 ms of which 1 ms to minimize.
[2021-05-14 20:58:03] [INFO ] Deduced a trap composed of 102 places in 404 ms of which 1 ms to minimize.
[2021-05-14 20:58:03] [INFO ] Deduced a trap composed of 83 places in 398 ms of which 1 ms to minimize.
[2021-05-14 20:58:04] [INFO ] Deduced a trap composed of 72 places in 398 ms of which 1 ms to minimize.
[2021-05-14 20:58:04] [INFO ] Deduced a trap composed of 162 places in 398 ms of which 1 ms to minimize.
[2021-05-14 20:58:04] [INFO ] Deduced a trap composed of 105 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:58:05] [INFO ] Deduced a trap composed of 106 places in 413 ms of which 1 ms to minimize.
[2021-05-14 20:58:05] [INFO ] Deduced a trap composed of 106 places in 415 ms of which 1 ms to minimize.
[2021-05-14 20:58:06] [INFO ] Deduced a trap composed of 114 places in 415 ms of which 1 ms to minimize.
[2021-05-14 20:58:06] [INFO ] Deduced a trap composed of 114 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:58:07] [INFO ] Deduced a trap composed of 212 places in 411 ms of which 1 ms to minimize.
[2021-05-14 20:58:07] [INFO ] Deduced a trap composed of 106 places in 410 ms of which 1 ms to minimize.
[2021-05-14 20:58:08] [INFO ] Deduced a trap composed of 142 places in 410 ms of which 1 ms to minimize.
[2021-05-14 20:58:08] [INFO ] Deduced a trap composed of 180 places in 411 ms of which 1 ms to minimize.
[2021-05-14 20:58:09] [INFO ] Deduced a trap composed of 180 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:58:09] [INFO ] Deduced a trap composed of 84 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:58:10] [INFO ] Deduced a trap composed of 150 places in 412 ms of which 0 ms to minimize.
[2021-05-14 20:58:10] [INFO ] Deduced a trap composed of 144 places in 411 ms of which 1 ms to minimize.
[2021-05-14 20:58:11] [INFO ] Deduced a trap composed of 180 places in 414 ms of which 1 ms to minimize.
[2021-05-14 20:58:11] [INFO ] Deduced a trap composed of 179 places in 413 ms of which 1 ms to minimize.
[2021-05-14 20:58:12] [INFO ] Deduced a trap composed of 89 places in 290 ms of which 1 ms to minimize.
[2021-05-14 20:58:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-14 20:58:12] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:58:12] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:12] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2021-05-14 20:58:13] [INFO ] [Real]Added 366 Read/Feed constraints in 96 ms returned sat
[2021-05-14 20:58:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:58:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:58:13] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:13] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2021-05-14 20:58:14] [INFO ] [Nat]Added 366 Read/Feed constraints in 118 ms returned sat
[2021-05-14 20:58:14] [INFO ] Deduced a trap composed of 236 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:58:15] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:58:15] [INFO ] Deduced a trap composed of 12 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:58:16] [INFO ] Deduced a trap composed of 12 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:58:17] [INFO ] Deduced a trap composed of 12 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:58:17] [INFO ] Deduced a trap composed of 42 places in 519 ms of which 1 ms to minimize.
[2021-05-14 20:58:18] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 1 ms to minimize.
[2021-05-14 20:58:18] [INFO ] Deduced a trap composed of 27 places in 538 ms of which 1 ms to minimize.
[2021-05-14 20:58:19] [INFO ] Deduced a trap composed of 12 places in 523 ms of which 1 ms to minimize.
[2021-05-14 20:58:19] [INFO ] Deduced a trap composed of 28 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:58:20] [INFO ] Deduced a trap composed of 404 places in 506 ms of which 1 ms to minimize.
[2021-05-14 20:58:21] [INFO ] Deduced a trap composed of 373 places in 510 ms of which 1 ms to minimize.
[2021-05-14 20:58:21] [INFO ] Deduced a trap composed of 371 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:58:22] [INFO ] Deduced a trap composed of 406 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:58:22] [INFO ] Deduced a trap composed of 433 places in 508 ms of which 1 ms to minimize.
[2021-05-14 20:58:23] [INFO ] Deduced a trap composed of 154 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:58:23] [INFO ] Deduced a trap composed of 42 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:58:24] [INFO ] Deduced a trap composed of 42 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:58:25] [INFO ] Deduced a trap composed of 42 places in 534 ms of which 1 ms to minimize.
[2021-05-14 20:58:25] [INFO ] Deduced a trap composed of 42 places in 522 ms of which 1 ms to minimize.
[2021-05-14 20:58:26] [INFO ] Deduced a trap composed of 12 places in 490 ms of which 1 ms to minimize.
[2021-05-14 20:58:26] [INFO ] Deduced a trap composed of 12 places in 491 ms of which 1 ms to minimize.
[2021-05-14 20:58:27] [INFO ] Deduced a trap composed of 110 places in 449 ms of which 1 ms to minimize.
[2021-05-14 20:58:27] [INFO ] Deduced a trap composed of 152 places in 448 ms of which 1 ms to minimize.
[2021-05-14 20:58:28] [INFO ] Deduced a trap composed of 152 places in 447 ms of which 1 ms to minimize.
[2021-05-14 20:58:28] [INFO ] Deduced a trap composed of 119 places in 448 ms of which 1 ms to minimize.
[2021-05-14 20:58:29] [INFO ] Deduced a trap composed of 125 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:58:30] [INFO ] Deduced a trap composed of 80 places in 527 ms of which 1 ms to minimize.
[2021-05-14 20:58:30] [INFO ] Deduced a trap composed of 52 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:58:31] [INFO ] Deduced a trap composed of 79 places in 520 ms of which 1 ms to minimize.
[2021-05-14 20:58:31] [INFO ] Deduced a trap composed of 95 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:58:32] [INFO ] Deduced a trap composed of 49 places in 507 ms of which 1 ms to minimize.
[2021-05-14 20:58:33] [INFO ] Deduced a trap composed of 83 places in 510 ms of which 1 ms to minimize.
[2021-05-14 20:58:33] [INFO ] Deduced a trap composed of 2 places in 604 ms of which 1 ms to minimize.
[2021-05-14 20:58: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 8
[2021-05-14 20:58:33] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:58:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:34] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2021-05-14 20:58:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:58:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 20:58:35] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:36] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2021-05-14 20:58:36] [INFO ] [Nat]Added 366 Read/Feed constraints in 99 ms returned sat
[2021-05-14 20:58:36] [INFO ] Deduced a trap composed of 350 places in 523 ms of which 1 ms to minimize.
[2021-05-14 20:58:37] [INFO ] Deduced a trap composed of 278 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:58:37] [INFO ] Deduced a trap composed of 23 places in 545 ms of which 1 ms to minimize.
[2021-05-14 20:58:38] [INFO ] Deduced a trap composed of 319 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:58:39] [INFO ] Deduced a trap composed of 251 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:58:39] [INFO ] Deduced a trap composed of 77 places in 515 ms of which 1 ms to minimize.
[2021-05-14 20:58:40] [INFO ] Deduced a trap composed of 160 places in 472 ms of which 1 ms to minimize.
[2021-05-14 20:58:40] [INFO ] Deduced a trap composed of 107 places in 478 ms of which 1 ms to minimize.
[2021-05-14 20:58:41] [INFO ] Deduced a trap composed of 107 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:58:41] [INFO ] Deduced a trap composed of 107 places in 485 ms of which 1 ms to minimize.
[2021-05-14 20:58:42] [INFO ] Deduced a trap composed of 247 places in 477 ms of which 1 ms to minimize.
[2021-05-14 20:58:42] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 1 ms to minimize.
[2021-05-14 20:58:43] [INFO ] Deduced a trap composed of 345 places in 505 ms of which 1 ms to minimize.
[2021-05-14 20:58:44] [INFO ] Deduced a trap composed of 326 places in 506 ms of which 1 ms to minimize.
[2021-05-14 20:58:44] [INFO ] Deduced a trap composed of 333 places in 500 ms of which 1 ms to minimize.
[2021-05-14 20:58:45] [INFO ] Deduced a trap composed of 131 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:58:45] [INFO ] Deduced a trap composed of 86 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:58:46] [INFO ] Deduced a trap composed of 35 places in 482 ms of which 1 ms to minimize.
[2021-05-14 20:58:46] [INFO ] Deduced a trap composed of 113 places in 489 ms of which 1 ms to minimize.
[2021-05-14 20:58:47] [INFO ] Deduced a trap composed of 109 places in 486 ms of which 1 ms to minimize.
[2021-05-14 20:58:48] [INFO ] Deduced a trap composed of 109 places in 487 ms of which 1 ms to minimize.
[2021-05-14 20:58:48] [INFO ] Deduced a trap composed of 109 places in 484 ms of which 1 ms to minimize.
[2021-05-14 20:58:49] [INFO ] Deduced a trap composed of 79 places in 492 ms of which 1 ms to minimize.
[2021-05-14 20:58:49] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 1 ms to minimize.
[2021-05-14 20:58:50] [INFO ] Deduced a trap composed of 16 places in 530 ms of which 1 ms to minimize.
[2021-05-14 20:58:50] [INFO ] Deduced a trap composed of 92 places in 533 ms of which 1 ms to minimize.
[2021-05-14 20:58:51] [INFO ] Deduced a trap composed of 16 places in 493 ms of which 1 ms to minimize.
[2021-05-14 20:58:52] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 1 ms to minimize.
[2021-05-14 20:58:52] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 1 ms to minimize.
[2021-05-14 20:58:53] [INFO ] Deduced a trap composed of 72 places in 504 ms of which 1 ms to minimize.
[2021-05-14 20:58:53] [INFO ] Deduced a trap composed of 93 places in 530 ms of which 1 ms to minimize.
[2021-05-14 20:58:54] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:58:55] [INFO ] Deduced a trap composed of 128 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:58:55] [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-14 20:58:55] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:58:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:56] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2021-05-14 20:58:56] [INFO ] [Real]Added 366 Read/Feed constraints in 80 ms returned sat
[2021-05-14 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:58:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 20:58:56] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:58:57] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2021-05-14 20:58:57] [INFO ] [Nat]Added 366 Read/Feed constraints in 99 ms returned sat
[2021-05-14 20:58:57] [INFO ] Deduced a trap composed of 133 places in 518 ms of which 1 ms to minimize.
[2021-05-14 20:58:58] [INFO ] Deduced a trap composed of 16 places in 514 ms of which 1 ms to minimize.
[2021-05-14 20:58:59] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:58:59] [INFO ] Deduced a trap composed of 65 places in 476 ms of which 1 ms to minimize.
[2021-05-14 20:59:00] [INFO ] Deduced a trap composed of 155 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:59:00] [INFO ] Deduced a trap composed of 155 places in 492 ms of which 1 ms to minimize.
[2021-05-14 20:59:01] [INFO ] Deduced a trap composed of 95 places in 476 ms of which 1 ms to minimize.
[2021-05-14 20:59:01] [INFO ] Deduced a trap composed of 12 places in 499 ms of which 1 ms to minimize.
[2021-05-14 20:59:02] [INFO ] Deduced a trap composed of 155 places in 478 ms of which 1 ms to minimize.
[2021-05-14 20:59:02] [INFO ] Deduced a trap composed of 118 places in 481 ms of which 1 ms to minimize.
[2021-05-14 20:59:03] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 1 ms to minimize.
[2021-05-14 20:59:04] [INFO ] Deduced a trap composed of 12 places in 497 ms of which 1 ms to minimize.
[2021-05-14 20:59:04] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 1 ms to minimize.
[2021-05-14 20:59:05] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:59:05] [INFO ] Deduced a trap composed of 80 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:59:06] [INFO ] Deduced a trap composed of 15 places in 523 ms of which 1 ms to minimize.
[2021-05-14 20:59:07] [INFO ] Deduced a trap composed of 32 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:59:07] [INFO ] Deduced a trap composed of 183 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:59:08] [INFO ] Deduced a trap composed of 64 places in 418 ms of which 1 ms to minimize.
[2021-05-14 20:59:08] [INFO ] Deduced a trap composed of 79 places in 414 ms of which 1 ms to minimize.
[2021-05-14 20:59:08] [INFO ] Deduced a trap composed of 64 places in 419 ms of which 0 ms to minimize.
[2021-05-14 20:59:09] [INFO ] Deduced a trap composed of 113 places in 416 ms of which 1 ms to minimize.
[2021-05-14 20:59:10] [INFO ] Deduced a trap composed of 112 places in 418 ms of which 1 ms to minimize.
[2021-05-14 20:59:10] [INFO ] Deduced a trap composed of 49 places in 473 ms of which 1 ms to minimize.
[2021-05-14 20:59:11] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 1 ms to minimize.
[2021-05-14 20:59:11] [INFO ] Deduced a trap composed of 153 places in 392 ms of which 1 ms to minimize.
[2021-05-14 20:59:12] [INFO ] Deduced a trap composed of 87 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:59:12] [INFO ] Deduced a trap composed of 117 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:59:13] [INFO ] Deduced a trap composed of 90 places in 395 ms of which 0 ms to minimize.
[2021-05-14 20:59:13] [INFO ] Deduced a trap composed of 117 places in 397 ms of which 0 ms to minimize.
[2021-05-14 20:59:14] [INFO ] Deduced a trap composed of 79 places in 436 ms of which 1 ms to minimize.
[2021-05-14 20:59:15] [INFO ] Deduced a trap composed of 62 places in 450 ms of which 1 ms to minimize.
[2021-05-14 20:59:15] [INFO ] Deduced a trap composed of 178 places in 393 ms of which 1 ms to minimize.
[2021-05-14 20:59:16] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 1 ms to minimize.
[2021-05-14 20:59:16] [INFO ] Deduced a trap composed of 42 places in 460 ms of which 1 ms to minimize.
[2021-05-14 20:59: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 10
[2021-05-14 20:59:16] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:59:16] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:17] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2021-05-14 20:59:17] [INFO ] [Real]Added 366 Read/Feed constraints in 81 ms returned sat
[2021-05-14 20:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:59:17] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:18] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-14 20:59:18] [INFO ] [Nat]Added 366 Read/Feed constraints in 95 ms returned sat
[2021-05-14 20:59:19] [INFO ] Deduced a trap composed of 117 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:59:19] [INFO ] Deduced a trap composed of 53 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:59:20] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:59:20] [INFO ] Deduced a trap composed of 12 places in 502 ms of which 0 ms to minimize.
[2021-05-14 20:59:21] [INFO ] Deduced a trap composed of 77 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:59:21] [INFO ] Deduced a trap composed of 42 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:59:22] [INFO ] Deduced a trap composed of 66 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:59:23] [INFO ] Deduced a trap composed of 22 places in 500 ms of which 1 ms to minimize.
[2021-05-14 20:59:23] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:59:24] [INFO ] Deduced a trap composed of 12 places in 500 ms of which 1 ms to minimize.
[2021-05-14 20:59:24] [INFO ] Deduced a trap composed of 19 places in 507 ms of which 1 ms to minimize.
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 42 places in 506 ms of which 1 ms to minimize.
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 42 places in 503 ms of which 1 ms to minimize.
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 12 places in 469 ms of which 0 ms to minimize.
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 41 places in 475 ms of which 1 ms to minimize.
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 41 places in 479 ms of which 1 ms to minimize.
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 120 places in 395 ms of which 0 ms to minimize.
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 20 places in 470 ms of which 1 ms to minimize.
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 91 places in 404 ms of which 1 ms to minimize.
[2021-05-14 20:59:29] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10539 ms
[2021-05-14 20:59:29] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 99 ms.
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 2 places in 594 ms of which 1 ms to minimize.
[2021-05-14 20:59: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 11
[2021-05-14 20:59:38] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 20:59:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-14 20:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:39] [INFO ] [Real]Absence check using state equation in 1483 ms returned sat
[2021-05-14 20:59:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 20:59:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 20:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:41] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2021-05-14 20:59:41] [INFO ] [Nat]Added 366 Read/Feed constraints in 104 ms returned sat
[2021-05-14 20:59:41] [INFO ] Deduced a trap composed of 12 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 16 places in 533 ms of which 1 ms to minimize.
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 42 places in 519 ms of which 1 ms to minimize.
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 33 places in 523 ms of which 1 ms to minimize.
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 49 places in 512 ms of which 1 ms to minimize.
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 53 places in 512 ms of which 0 ms to minimize.
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 39 places in 514 ms of which 1 ms to minimize.
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 33 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 33 places in 523 ms of which 1 ms to minimize.
[2021-05-14 20:59:47] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 1 ms to minimize.
[2021-05-14 20:59:47] [INFO ] Deduced a trap composed of 289 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:59:48] [INFO ] Deduced a trap composed of 172 places in 515 ms of which 1 ms to minimize.
[2021-05-14 20:59:48] [INFO ] Deduced a trap composed of 272 places in 509 ms of which 1 ms to minimize.
[2021-05-14 20:59:49] [INFO ] Deduced a trap composed of 12 places in 540 ms of which 1 ms to minimize.
[2021-05-14 20:59:50] [INFO ] Deduced a trap composed of 70 places in 534 ms of which 1 ms to minimize.
[2021-05-14 20:59:50] [INFO ] Deduced a trap composed of 173 places in 513 ms of which 1 ms to minimize.
[2021-05-14 20:59:51] [INFO ] Deduced a trap composed of 272 places in 534 ms of which 1 ms to minimize.
[2021-05-14 20:59:51] [INFO ] Deduced a trap composed of 80 places in 518 ms of which 1 ms to minimize.
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 192 places in 518 ms of which 1 ms to minimize.
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 173 places in 517 ms of which 1 ms to minimize.
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 202 places in 518 ms of which 1 ms to minimize.
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 168 places in 521 ms of which 1 ms to minimize.
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 16 places in 526 ms of which 1 ms to minimize.
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 193 places in 516 ms of which 1 ms to minimize.
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 130 places in 515 ms of which 0 ms to minimize.
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 70 places in 534 ms of which 1 ms to minimize.
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 16 places in 537 ms of which 1 ms to minimize.
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 181 places in 547 ms of which 1 ms to minimize.
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 170 places in 559 ms of which 1 ms to minimize.
[2021-05-14 20:59:59] [INFO ] Deduced a trap composed of 171 places in 529 ms of which 1 ms to minimize.
[2021-05-14 20:59:59] [INFO ] Deduced a trap composed of 165 places in 593 ms of which 1 ms to minimize.
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 176 places in 603 ms of which 1 ms to minimize.
[2021-05-14 21:00: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 12
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:01] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2021-05-14 21:00:01] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2021-05-14 21:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-14 21:00:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:02] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2021-05-14 21:00:02] [INFO ] [Nat]Added 366 Read/Feed constraints in 101 ms returned sat
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 211 places in 502 ms of which 1 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 74 places in 488 ms of which 1 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 42 places in 494 ms of which 1 ms to minimize.
[2021-05-14 21:00:05] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 1 ms to minimize.
[2021-05-14 21:00:05] [INFO ] Deduced a trap composed of 102 places in 409 ms of which 1 ms to minimize.
[2021-05-14 21:00:06] [INFO ] Deduced a trap composed of 102 places in 413 ms of which 1 ms to minimize.
[2021-05-14 21:00:06] [INFO ] Deduced a trap composed of 132 places in 414 ms of which 1 ms to minimize.
[2021-05-14 21:00:06] [INFO ] Deduced a trap composed of 102 places in 418 ms of which 1 ms to minimize.
[2021-05-14 21:00:07] [INFO ] Deduced a trap composed of 71 places in 408 ms of which 1 ms to minimize.
[2021-05-14 21:00:07] [INFO ] Deduced a trap composed of 89 places in 411 ms of which 1 ms to minimize.
[2021-05-14 21:00:08] [INFO ] Deduced a trap composed of 89 places in 413 ms of which 0 ms to minimize.
[2021-05-14 21:00:08] [INFO ] Deduced a trap composed of 98 places in 411 ms of which 1 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 102 places in 408 ms of which 1 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Deduced a trap composed of 102 places in 417 ms of which 1 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Deduced a trap composed of 78 places in 412 ms of which 1 ms to minimize.
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 359 places in 439 ms of which 1 ms to minimize.
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 238 places in 439 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 359 places in 441 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 247 places in 446 ms of which 0 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 236 places in 438 ms of which 1 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 306 places in 437 ms of which 1 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 194 places in 439 ms of which 1 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 118 places in 440 ms of which 0 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Deduced a trap composed of 12 places in 469 ms of which 1 ms to minimize.
[2021-05-14 21:00:17] [INFO ] Deduced a trap composed of 27 places in 478 ms of which 1 ms to minimize.
[2021-05-14 21:00:17] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 1 ms to minimize.
[2021-05-14 21:00:18] [INFO ] Deduced a trap composed of 16 places in 486 ms of which 1 ms to minimize.
[2021-05-14 21:00:18] [INFO ] Deduced a trap composed of 101 places in 471 ms of which 0 ms to minimize.
[2021-05-14 21:00:19] [INFO ] Deduced a trap composed of 101 places in 469 ms of which 1 ms to minimize.
[2021-05-14 21:00:19] [INFO ] Deduced a trap composed of 101 places in 471 ms of which 1 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 1 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 163 places in 381 ms of which 0 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 83 places in 365 ms of which 1 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 133 places in 369 ms of which 1 ms to minimize.
[2021-05-14 21:00:22] [INFO ] Deduced a trap composed of 133 places in 369 ms of which 1 ms to minimize.
[2021-05-14 21:00: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 13
[2021-05-14 21:00:22] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:00:22] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:22] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2021-05-14 21:00:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:24] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2021-05-14 21:00:24] [INFO ] [Nat]Added 366 Read/Feed constraints in 98 ms returned sat
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 37 places in 491 ms of which 1 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 73 places in 496 ms of which 1 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 1 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Deduced a trap composed of 103 places in 495 ms of which 1 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Deduced a trap composed of 58 places in 486 ms of which 1 ms to minimize.
[2021-05-14 21:00:27] [INFO ] Deduced a trap composed of 35 places in 485 ms of which 1 ms to minimize.
[2021-05-14 21:00:27] [INFO ] Deduced a trap composed of 58 places in 483 ms of which 1 ms to minimize.
[2021-05-14 21:00:28] [INFO ] Deduced a trap composed of 41 places in 484 ms of which 1 ms to minimize.
[2021-05-14 21:00:29] [INFO ] Deduced a trap composed of 27 places in 484 ms of which 1 ms to minimize.
[2021-05-14 21:00:29] [INFO ] Deduced a trap composed of 12 places in 480 ms of which 0 ms to minimize.
[2021-05-14 21:00:30] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 1 ms to minimize.
[2021-05-14 21:00:30] [INFO ] Deduced a trap composed of 12 places in 486 ms of which 1 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 58 places in 481 ms of which 1 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 12 places in 481 ms of which 1 ms to minimize.
[2021-05-14 21:00:32] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 0 ms to minimize.
[2021-05-14 21:00:32] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 1 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 117 places in 437 ms of which 1 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 35 places in 497 ms of which 1 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 88 places in 433 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 88 places in 437 ms of which 0 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 164 places in 435 ms of which 1 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 87 places in 435 ms of which 1 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 87 places in 447 ms of which 1 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 87 places in 436 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 88 places in 434 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 57 places in 436 ms of which 1 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 0 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 184 places in 445 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 118 places in 436 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 139 places in 445 ms of which 0 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 73 places in 451 ms of which 0 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 42 places in 442 ms of which 1 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 118 places in 344 ms of which 1 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 117 places in 352 ms of which 1 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 190 places in 358 ms of which 1 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 117 places in 347 ms of which 1 ms to minimize.
[2021-05-14 21:00:43] [INFO ] Deduced a trap composed of 87 places in 418 ms of which 1 ms to minimize.
[2021-05-14 21:00:43] [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 14
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1324 transition count 2024
Applied a total of 12 rules in 133 ms. Remains 1324 /1330 variables (removed 6) and now considering 2024/2030 (removed 6) transitions.
[2021-05-14 21:00:44] [INFO ] Flatten gal took : 65 ms
[2021-05-14 21:00:44] [INFO ] Flatten gal took : 69 ms
[2021-05-14 21:00:44] [INFO ] Input system was already deterministic with 2024 transitions.
[2021-05-14 21:00:44] [INFO ] Flatten gal took : 71 ms
[2021-05-14 21:00:44] [INFO ] Flatten gal took : 68 ms
[2021-05-14 21:00:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17811578418150136255.gal : 24 ms
[2021-05-14 21:00:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14276346530698538029.ctl : 11 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/CTLFireability17811578418150136255.gal, -t, CGAL, -ctl, /tmp/CTLFireability14276346530698538029.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/CTLFireability17811578418150136255.gal -t CGAL -ctl /tmp/CTLFireability14276346530698538029.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:01:14] [INFO ] Flatten gal took : 60 ms
[2021-05-14 21:01:14] [INFO ] Applying decomposition
[2021-05-14 21:01:14] [INFO ] Flatten gal took : 61 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/graph1940896461748491464.txt, -o, /tmp/graph1940896461748491464.bin, -w, /tmp/graph1940896461748491464.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/graph1940896461748491464.bin, -l, -1, -v, -w, /tmp/graph1940896461748491464.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:01:15] [INFO ] Decomposing Gal with order
[2021-05-14 21:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:01:15] [INFO ] Removed a total of 1786 redundant transitions.
[2021-05-14 21:01:15] [INFO ] Flatten gal took : 186 ms
[2021-05-14 21:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-14 21:01:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5926171852056357582.gal : 23 ms
[2021-05-14 21:01:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5990376373548983602.ctl : 12 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/CTLFireability5926171852056357582.gal, -t, CGAL, -ctl, /tmp/CTLFireability5990376373548983602.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/CTLFireability5926171852056357582.gal -t CGAL -ctl /tmp/CTLFireability5990376373548983602.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 51 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2021-05-14 21:01:46] [INFO ] Flatten gal took : 59 ms
[2021-05-14 21:01:46] [INFO ] Flatten gal took : 71 ms
[2021-05-14 21:01:47] [INFO ] Input system was already deterministic with 2030 transitions.
[2021-05-14 21:01:47] [INFO ] Flatten gal took : 62 ms
[2021-05-14 21:01:47] [INFO ] Flatten gal took : 61 ms
[2021-05-14 21:01:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15632644313497282319.gal : 7 ms
[2021-05-14 21:01:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12542462475243714341.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/CTLFireability15632644313497282319.gal, -t, CGAL, -ctl, /tmp/CTLFireability12542462475243714341.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/CTLFireability15632644313497282319.gal -t CGAL -ctl /tmp/CTLFireability12542462475243714341.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:02:17] [INFO ] Flatten gal took : 59 ms
[2021-05-14 21:02:17] [INFO ] Applying decomposition
[2021-05-14 21:02:17] [INFO ] Flatten gal took : 63 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/graph15793941750391850187.txt, -o, /tmp/graph15793941750391850187.bin, -w, /tmp/graph15793941750391850187.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/graph15793941750391850187.bin, -l, -1, -v, -w, /tmp/graph15793941750391850187.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:02:17] [INFO ] Decomposing Gal with order
[2021-05-14 21:02:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:02:17] [INFO ] Removed a total of 1788 redundant transitions.
[2021-05-14 21:02:17] [INFO ] Flatten gal took : 119 ms
[2021-05-14 21:02:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-14 21:02:18] [INFO ] Time to serialize gal into /tmp/CTLFireability466049103804149809.gal : 10 ms
[2021-05-14 21:02:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15405060583556350487.ctl : 9 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/CTLFireability466049103804149809.gal, -t, CGAL, -ctl, /tmp/CTLFireability15405060583556350487.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/CTLFireability466049103804149809.gal -t CGAL -ctl /tmp/CTLFireability15405060583556350487.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 571 transitions
Trivial Post-agglo rules discarded 571 transitions
Performed 571 trivial Post agglomeration. Transition count delta: 571
Iterating post reduction 0 with 571 rules applied. Total rules applied 571 place count 1330 transition count 1459
Reduce places removed 571 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 577 rules applied. Total rules applied 1148 place count 759 transition count 1453
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1154 place count 753 transition count 1453
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 1154 place count 753 transition count 1171
Deduced a syphon composed of 282 places in 1 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 564 rules applied. Total rules applied 1718 place count 471 transition count 1171
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1798 place count 431 transition count 1131
Applied a total of 1798 rules in 244 ms. Remains 431 /1330 variables (removed 899) and now considering 1131/2030 (removed 899) transitions.
[2021-05-14 21:02:49] [INFO ] Flatten gal took : 35 ms
[2021-05-14 21:02:49] [INFO ] Flatten gal took : 30 ms
[2021-05-14 21:02:49] [INFO ] Input system was already deterministic with 1131 transitions.
[2021-05-14 21:02:49] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:02:49] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6370182571420157347.gal : 3 ms
[2021-05-14 21:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15393192413662784928.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/CTLFireability6370182571420157347.gal, -t, CGAL, -ctl, /tmp/CTLFireability15393192413662784928.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/CTLFireability6370182571420157347.gal -t CGAL -ctl /tmp/CTLFireability15393192413662784928.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:03:19] [INFO ] Flatten gal took : 26 ms
[2021-05-14 21:03:19] [INFO ] Applying decomposition
[2021-05-14 21:03:19] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14846075879510198614.txt, -o, /tmp/graph14846075879510198614.bin, -w, /tmp/graph14846075879510198614.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/graph14846075879510198614.bin, -l, -1, -v, -w, /tmp/graph14846075879510198614.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:03:19] [INFO ] Decomposing Gal with order
[2021-05-14 21:03:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:03:19] [INFO ] Removed a total of 1557 redundant transitions.
[2021-05-14 21:03:19] [INFO ] Flatten gal took : 60 ms
[2021-05-14 21:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 457 labels/synchronizations in 36 ms.
[2021-05-14 21:03:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2629511400643447558.gal : 7 ms
[2021-05-14 21:03:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12695608739213063215.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/CTLFireability2629511400643447558.gal, -t, CGAL, -ctl, /tmp/CTLFireability12695608739213063215.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/CTLFireability2629511400643447558.gal -t CGAL -ctl /tmp/CTLFireability12695608739213063215.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 1330 transition count 1469
Reduce places removed 561 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 572 rules applied. Total rules applied 1133 place count 769 transition count 1458
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1144 place count 758 transition count 1458
Performed 278 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 278 Pre rules applied. Total rules applied 1144 place count 758 transition count 1180
Deduced a syphon composed of 278 places in 1 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 3 with 556 rules applied. Total rules applied 1700 place count 480 transition count 1180
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1784 place count 438 transition count 1138
Applied a total of 1784 rules in 86 ms. Remains 438 /1330 variables (removed 892) and now considering 1138/2030 (removed 892) transitions.
[2021-05-14 21:03:50] [INFO ] Flatten gal took : 24 ms
[2021-05-14 21:03:50] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:03:50] [INFO ] Input system was already deterministic with 1138 transitions.
[2021-05-14 21:03:50] [INFO ] Flatten gal took : 27 ms
[2021-05-14 21:03:50] [INFO ] Flatten gal took : 27 ms
[2021-05-14 21:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13632997037386533724.gal : 2 ms
[2021-05-14 21:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13812901026427466553.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/CTLFireability13632997037386533724.gal, -t, CGAL, -ctl, /tmp/CTLFireability13812901026427466553.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/CTLFireability13632997037386533724.gal -t CGAL -ctl /tmp/CTLFireability13812901026427466553.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:04:20] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:04:20] [INFO ] Applying decomposition
[2021-05-14 21:04:20] [INFO ] Flatten gal took : 28 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/graph5391401414940281915.txt, -o, /tmp/graph5391401414940281915.bin, -w, /tmp/graph5391401414940281915.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/graph5391401414940281915.bin, -l, -1, -v, -w, /tmp/graph5391401414940281915.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:04:20] [INFO ] Decomposing Gal with order
[2021-05-14 21:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:04:20] [INFO ] Removed a total of 1568 redundant transitions.
[2021-05-14 21:04:20] [INFO ] Flatten gal took : 60 ms
[2021-05-14 21:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 28 ms.
[2021-05-14 21:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17215686783512571369.gal : 6 ms
[2021-05-14 21:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7953774288335724986.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/CTLFireability17215686783512571369.gal, -t, CGAL, -ctl, /tmp/CTLFireability7953774288335724986.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/CTLFireability17215686783512571369.gal -t CGAL -ctl /tmp/CTLFireability7953774288335724986.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 537 transitions
Trivial Post-agglo rules discarded 537 transitions
Performed 537 trivial Post agglomeration. Transition count delta: 537
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 1330 transition count 1493
Reduce places removed 537 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 551 rules applied. Total rules applied 1088 place count 793 transition count 1479
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1102 place count 779 transition count 1479
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 266 Pre rules applied. Total rules applied 1102 place count 779 transition count 1213
Deduced a syphon composed of 266 places in 1 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 532 rules applied. Total rules applied 1634 place count 513 transition count 1213
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1714 place count 473 transition count 1173
Applied a total of 1714 rules in 139 ms. Remains 473 /1330 variables (removed 857) and now considering 1173/2030 (removed 857) transitions.
[2021-05-14 21:04:51] [INFO ] Flatten gal took : 25 ms
[2021-05-14 21:04:51] [INFO ] Flatten gal took : 29 ms
[2021-05-14 21:04:51] [INFO ] Input system was already deterministic with 1173 transitions.
[2021-05-14 21:04:51] [INFO ] Flatten gal took : 33 ms
[2021-05-14 21:04:51] [INFO ] Flatten gal took : 39 ms
[2021-05-14 21:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11375173331191346237.gal : 3 ms
[2021-05-14 21:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16634882366861161032.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/CTLFireability11375173331191346237.gal, -t, CGAL, -ctl, /tmp/CTLFireability16634882366861161032.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/CTLFireability11375173331191346237.gal -t CGAL -ctl /tmp/CTLFireability16634882366861161032.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:05:21] [INFO ] Flatten gal took : 27 ms
[2021-05-14 21:05:21] [INFO ] Applying decomposition
[2021-05-14 21:05:21] [INFO ] Flatten gal took : 39 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/graph8826302419069356257.txt, -o, /tmp/graph8826302419069356257.bin, -w, /tmp/graph8826302419069356257.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/graph8826302419069356257.bin, -l, -1, -v, -w, /tmp/graph8826302419069356257.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:05:21] [INFO ] Decomposing Gal with order
[2021-05-14 21:05:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:05:21] [INFO ] Removed a total of 1564 redundant transitions.
[2021-05-14 21:05:21] [INFO ] Flatten gal took : 59 ms
[2021-05-14 21:05:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 14 ms.
[2021-05-14 21:05:21] [INFO ] Time to serialize gal into /tmp/CTLFireability16109844387242006355.gal : 5 ms
[2021-05-14 21:05:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10823854173108463889.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/CTLFireability16109844387242006355.gal, -t, CGAL, -ctl, /tmp/CTLFireability10823854173108463889.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/CTLFireability16109844387242006355.gal -t CGAL -ctl /tmp/CTLFireability10823854173108463889.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 572 place count 1330 transition count 1458
Reduce places removed 572 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 575 rules applied. Total rules applied 1147 place count 758 transition count 1455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1150 place count 755 transition count 1455
Performed 291 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 291 Pre rules applied. Total rules applied 1150 place count 755 transition count 1164
Deduced a syphon composed of 291 places in 1 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 3 with 582 rules applied. Total rules applied 1732 place count 464 transition count 1164
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1816 place count 422 transition count 1122
Applied a total of 1816 rules in 67 ms. Remains 422 /1330 variables (removed 908) and now considering 1122/2030 (removed 908) transitions.
[2021-05-14 21:05:52] [INFO ] Flatten gal took : 33 ms
[2021-05-14 21:05:52] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:05:52] [INFO ] Input system was already deterministic with 1122 transitions.
[2021-05-14 21:05:52] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:05:52] [INFO ] Flatten gal took : 29 ms
[2021-05-14 21:05:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13264659970424016239.gal : 2 ms
[2021-05-14 21:05:52] [INFO ] Time to serialize properties into /tmp/CTLFireability878552684321277992.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/CTLFireability13264659970424016239.gal, -t, CGAL, -ctl, /tmp/CTLFireability878552684321277992.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/CTLFireability13264659970424016239.gal -t CGAL -ctl /tmp/CTLFireability878552684321277992.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:06:22] [INFO ] Flatten gal took : 27 ms
[2021-05-14 21:06:22] [INFO ] Applying decomposition
[2021-05-14 21:06:22] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3383090454560462255.txt, -o, /tmp/graph3383090454560462255.bin, -w, /tmp/graph3383090454560462255.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/graph3383090454560462255.bin, -l, -1, -v, -w, /tmp/graph3383090454560462255.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:06:22] [INFO ] Decomposing Gal with order
[2021-05-14 21:06:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:06:22] [INFO ] Removed a total of 1571 redundant transitions.
[2021-05-14 21:06:22] [INFO ] Flatten gal took : 69 ms
[2021-05-14 21:06:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 14 ms.
[2021-05-14 21:06:22] [INFO ] Time to serialize gal into /tmp/CTLFireability361340095461727001.gal : 5 ms
[2021-05-14 21:06:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16928635663564227745.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/CTLFireability361340095461727001.gal, -t, CGAL, -ctl, /tmp/CTLFireability16928635663564227745.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/CTLFireability361340095461727001.gal -t CGAL -ctl /tmp/CTLFireability16928635663564227745.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:06:53] [INFO ] Flatten gal took : 295 ms
[2021-05-14 21:06:56] [INFO ] Flatten gal took : 273 ms
[2021-05-14 21:06:59] [INFO ] Applying decomposition
[2021-05-14 21:06:59] [INFO ] Flatten gal took : 270 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/graph11747059210301100225.txt, -o, /tmp/graph11747059210301100225.bin, -w, /tmp/graph11747059210301100225.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/graph11747059210301100225.bin, -l, -1, -v, -w, /tmp/graph11747059210301100225.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:07:00] [INFO ] Decomposing Gal with order
[2021-05-14 21:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:07:03] [INFO ] Removed a total of 1788 redundant transitions.
[2021-05-14 21:07:03] [INFO ] Flatten gal took : 482 ms
[2021-05-14 21:07:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-14 21:07:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10247994724081220271.gal : 8 ms
[2021-05-14 21:07:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2034016642821776016.ctl : 732 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/CTLFireability10247994724081220271.gal, -t, CGAL, -ctl, /tmp/CTLFireability2034016642821776016.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/CTLFireability10247994724081220271.gal -t CGAL -ctl /tmp/CTLFireability2034016642821776016.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-05-14 21:31:31] [INFO ] Applying decomposition
[2021-05-14 21:31:32] [INFO ] Flatten gal took : 878 ms
[2021-05-14 21:31:32] [INFO ] Decomposing Gal with order
[2021-05-14 21:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:31:35] [INFO ] Removed a total of 1330 redundant transitions.
[2021-05-14 21:31:36] [INFO ] Flatten gal took : 809 ms
[2021-05-14 21:31:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 22 ms.
[2021-05-14 21:31:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3262683330489015936.gal : 7 ms
[2021-05-14 21:31:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12693494456099890354.ctl : 764 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/CTLFireability3262683330489015936.gal, -t, CGAL, -ctl, /tmp/CTLFireability12693494456099890354.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/CTLFireability3262683330489015936.gal -t CGAL -ctl /tmp/CTLFireability12693494456099890354.ctl
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="Peterson-PT-6"
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 Peterson-PT-6, 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 r140-tall-162089128200634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 ;