Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027100319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBNT-PT-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 21K Apr 30 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 30 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 66K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 293K Apr 30 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652839548001

Running Version 0
[2022-05-18 02:05:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2022-05-18 02:05:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:05:50] [INFO ] Load time of PNML (sax parser for PT used): 661 ms
[2022-05-18 02:05:50] [INFO ] Transformed 474 places.
[2022-05-18 02:05:50] [INFO ] Transformed 11760 transitions.
[2022-05-18 02:05:50] [INFO ] Parsed PT model containing 474 places and 11760 transitions in 887 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1641 out of 1650 initially.
// Phase 1: matrix 1641 rows 474 cols
[2022-05-18 02:05:50] [INFO ] Computed 72 place invariants in 91 ms
Incomplete random walk after 10000 steps, including 560 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :13
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :3
[2022-05-18 02:05:51] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-18 02:05:51] [INFO ] Computed 72 place invariants in 65 ms
[2022-05-18 02:05:51] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2022-05-18 02:05:51] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 02:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:05:52] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2022-05-18 02:05:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:05:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 23 ms returned sat
[2022-05-18 02:05:52] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned unsat
[2022-05-18 02:05:52] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:05:52] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned unsat
[2022-05-18 02:05:52] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:05:52] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2022-05-18 02:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:05:53] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2022-05-18 02:05:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:05:53] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2022-05-18 02:05:53] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:05:54] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2022-05-18 02:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:05:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 109 ms returned sat
[2022-05-18 02:05:55] [INFO ] Deduced a trap composed of 257 places in 451 ms of which 3 ms to minimize.
[2022-05-18 02:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 601 ms
[2022-05-18 02:05:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 198 ms.
[2022-05-18 02:05:56] [INFO ] Added : 7 causal constraints over 2 iterations in 487 ms. Result :sat
Minimization took 252 ms.
[2022-05-18 02:05:56] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2022-05-18 02:05:56] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-18 02:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2022-05-18 02:05:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:05:57] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned unsat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 24 ms returned unsat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned unsat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 5 ms returned unsat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-18 02:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:05:58] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2022-05-18 02:05:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:05:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:05:58] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-18 02:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:03] [INFO ] [Nat]Absence check using state equation in 4923 ms returned unknown
[2022-05-18 02:06:03] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:06:03] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-18 02:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:04] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2022-05-18 02:06:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:06:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:06:04] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:05] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2022-05-18 02:06:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1401 ms returned sat
[2022-05-18 02:06:06] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 120 ms.
[2022-05-18 02:06:07] [INFO ] Added : 19 causal constraints over 4 iterations in 1321 ms. Result :sat
Minimization took 502 ms.
[2022-05-18 02:06:08] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:06:08] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:09] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2022-05-18 02:06:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:06:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:06:09] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-18 02:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:10] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2022-05-18 02:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 655 ms returned sat
[2022-05-18 02:06:11] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 105 ms.
[2022-05-18 02:06:11] [INFO ] Added : 6 causal constraints over 2 iterations in 346 ms. Result :sat
Minimization took 277 ms.
[2022-05-18 02:06:11] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2022-05-18 02:06:11] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned unsat
[2022-05-18 02:06:11] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:06:11] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned unsat
[2022-05-18 02:06:12] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:06:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2022-05-18 02:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:12] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-05-18 02:06:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:06:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2022-05-18 02:06:12] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:13] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2022-05-18 02:06:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 139 ms returned sat
[2022-05-18 02:06:14] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 145 ms.
[2022-05-18 02:06:15] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2022-05-18 02:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2022-05-18 02:06:15] [INFO ] Added : 41 causal constraints over 9 iterations in 1838 ms. Result :sat
Minimization took 470 ms.
[2022-05-18 02:06:16] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:06:16] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:17] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2022-05-18 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:06:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:06:17] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:22] [INFO ] [Nat]Absence check using state equation in 4934 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 39, 1, 1, 1, 1, 1, 158, 1, 52, 1, 1, 1, 10] Max seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 3]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 14200 steps, including 942 resets, run finished after 199 ms. (steps per millisecond=71 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1000 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 5) seen :2 could not realise parikh vector
Incomplete Parikh walk after 15700 steps, including 939 resets, run finished after 272 ms. (steps per millisecond=57 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 94 resets, run finished after 12 ms. (steps per millisecond=116 ) properties (out of 5) seen :3 could not realise parikh vector
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 60 place count 439 transition count 1600
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 414 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 413 transition count 1599
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 413 transition count 1599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 411 transition count 1597
Applied a total of 116 rules in 298 ms. Remains 411 /474 variables (removed 63) and now considering 1597/1650 (removed 53) transitions.
[2022-05-18 02:06:22] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
// Phase 1: matrix 1588 rows 411 cols
[2022-05-18 02:06:22] [INFO ] Computed 62 place invariants in 29 ms
[2022-05-18 02:06:23] [INFO ] Dead Transitions using invariants and state equation in 676 ms returned [369, 370, 371, 374, 375, 376, 377, 379, 380, 381, 382, 385, 387, 389, 392, 393, 396, 398, 399, 400, 402, 404, 405, 406, 408, 409, 410, 411, 412, 413, 414, 415, 417, 418, 419, 420, 421, 424, 425, 428, 429, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 445, 446, 447, 448, 450, 451, 452, 453, 454, 455, 456, 457, 458, 460, 463, 464, 468, 471, 472, 474, 475, 476, 479, 480, 481, 482, 484, 487, 488, 489, 492, 493, 494, 495, 496, 498, 499, 501, 502, 503, 506, 507, 508, 510, 511, 512, 513, 514, 515, 517, 519, 520, 521, 522, 523, 524, 527, 529, 531, 533, 534, 536, 537, 538, 539, 540, 541, 542, 544, 547, 551, 552, 554, 557, 558, 560, 561, 563, 564, 565, 567, 568, 569, 570, 571, 572, 574, 575, 576, 577, 579, 580, 581, 582, 583, 587, 588, 589, 590, 591, 592, 594, 596, 598, 599, 600, 601, 605, 606, 608, 609, 610, 613, 615, 616, 618, 619, 620, 621, 623, 624, 625, 626, 627, 628, 630, 632, 633, 634, 635, 638, 639, 640, 641, 642, 643, 644, 646, 649, 650, 652, 653, 654, 655, 657, 663, 665, 666, 667, 668, 670, 671, 672, 674, 675, 679, 681, 682, 684, 685, 686, 687, 688, 690, 692, 693, 695, 696, 698, 699, 701, 702, 704, 705, 707, 708, 710, 711, 712, 713, 714, 715, 718, 721, 722, 723, 725, 726, 727, 728, 731, 732, 734, 736, 737, 738, 739, 740, 742, 745, 747, 748, 749, 750, 752, 753, 755, 756, 759, 760, 761, 762, 764, 765, 766, 767, 768, 769, 770, 771, 772, 774, 775, 776, 777, 778, 779, 781, 782, 783, 784, 785, 786, 787, 788, 790, 791, 792, 793, 795, 797, 798, 800, 801, 802, 803, 804, 805, 807, 809, 810, 811, 814, 815, 816, 817, 819, 820, 822, 823, 824, 825, 826, 829, 832, 833, 834, 839, 840, 841, 843, 844, 845, 847, 848, 850, 852, 853, 854, 855, 856, 857, 859, 861, 862, 863, 864, 865, 866, 867, 868, 870, 871, 872, 873, 875, 876, 877, 879, 881, 882, 883, 884, 885, 886, 887, 888, 891, 892, 894, 896, 897, 898, 899, 900, 901, 906, 907, 909, 911, 913, 914, 916, 917, 918, 922, 923, 924, 926, 927, 928, 929, 930, 932, 935, 937, 938, 940, 941, 943, 944, 946, 947, 948, 949, 950, 951, 952, 953, 955, 957, 959, 966, 967, 969, 974, 975, 977, 978, 979, 980, 981, 982, 984, 986, 987, 990, 991, 992, 993, 994, 997, 998, 999, 1001, 1002, 1003, 1004, 1006, 1008, 1009, 1010, 1011, 1012, 1013, 1015, 1017, 1018, 1019, 1021, 1022, 1024, 1025, 1028, 1029, 1031, 1034, 1036, 1037, 1038, 1039, 1041, 1042, 1043, 1044, 1046, 1047, 1048, 1049, 1051, 1053, 1055, 1057, 1059, 1060, 1063, 1064, 1066, 1068, 1069, 1070, 1071, 1073, 1074, 1075, 1080, 1081, 1082, 1083, 1085, 1086, 1087, 1090, 1091, 1092, 1093, 1096, 1099, 1103, 1104, 1107, 1109, 1110, 1112, 1113, 1117, 1119, 1121, 1123, 1125, 1127, 1131, 1134, 1135, 1136, 1141, 1143, 1146, 1150, 1151, 1155, 1156, 1157, 1159, 1160, 1164, 1165, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1176, 1178, 1181, 1182, 1186, 1187, 1191, 1192, 1195, 1196, 1198, 1200, 1202, 1206, 1207, 1211, 1212, 1213, 1214, 1215, 1216, 1219, 1220, 1221, 1225, 1227, 1228, 1232, 1235, 1237, 1243, 1244, 1251, 1252, 1255, 1261, 1262, 1263, 1264, 1265, 1268, 1270, 1272, 1273, 1277, 1278, 1279, 1282, 1285, 1286, 1287, 1288, 1290, 1294, 1295, 1297, 1298, 1299, 1302, 1303, 1304, 1307, 1308, 1310, 1311, 1312, 1313, 1320, 1325, 1326, 1327, 1328, 1329, 1331, 1333, 1336, 1337, 1338, 1341, 1342, 1344, 1347, 1354, 1356, 1357, 1360, 1361, 1364, 1365, 1367]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[1367, 1365, 1364, 1361, 1360, 1357, 1356, 1354, 1347, 1344, 1342, 1341, 1338, 1337, 1336, 1333, 1331, 1329, 1328, 1327, 1326, 1325, 1320, 1313, 1312, 1311, 1310, 1308, 1307, 1304, 1303, 1302, 1299, 1298, 1297, 1295, 1294, 1290, 1288, 1287, 1286, 1285, 1282, 1279, 1278, 1277, 1273, 1272, 1270, 1268, 1265, 1264, 1263, 1262, 1261, 1255, 1252, 1251, 1244, 1243, 1237, 1235, 1232, 1228, 1227, 1225, 1221, 1220, 1219, 1216, 1215, 1214, 1213, 1212, 1211, 1207, 1206, 1202, 1200, 1198, 1196, 1195, 1192, 1191, 1187, 1186, 1182, 1181, 1178, 1176, 1174, 1173, 1172, 1171, 1170, 1169, 1168, 1165, 1164, 1160, 1159, 1157, 1156, 1155, 1151, 1150, 1146, 1143, 1141, 1136, 1135, 1134, 1131, 1127, 1125, 1123, 1121, 1119, 1117, 1113, 1112, 1110, 1109, 1107, 1104, 1103, 1099, 1096, 1093, 1092, 1091, 1090, 1087, 1086, 1085, 1083, 1082, 1081, 1080, 1075, 1074, 1073, 1071, 1070, 1069, 1068, 1066, 1064, 1063, 1060, 1059, 1057, 1055, 1053, 1051, 1049, 1048, 1047, 1046, 1044, 1043, 1042, 1041, 1039, 1038, 1037, 1036, 1034, 1031, 1029, 1028, 1025, 1024, 1022, 1021, 1019, 1018, 1017, 1015, 1013, 1012, 1011, 1010, 1009, 1008, 1006, 1004, 1003, 1002, 1001, 999, 998, 997, 994, 993, 992, 991, 990, 987, 986, 984, 982, 981, 980, 979, 978, 977, 975, 974, 969, 967, 966, 959, 957, 955, 953, 952, 951, 950, 949, 948, 947, 946, 944, 943, 941, 940, 938, 937, 935, 932, 930, 929, 928, 927, 926, 924, 923, 922, 918, 917, 916, 914, 913, 911, 909, 907, 906, 901, 900, 899, 898, 897, 896, 894, 892, 891, 888, 887, 886, 885, 884, 883, 882, 881, 879, 877, 876, 875, 873, 872, 871, 870, 868, 867, 866, 865, 864, 863, 862, 861, 859, 857, 856, 855, 854, 853, 852, 850, 848, 847, 845, 844, 843, 841, 840, 839, 834, 833, 832, 829, 826, 825, 824, 823, 822, 820, 819, 817, 816, 815, 814, 811, 810, 809, 807, 805, 804, 803, 802, 801, 800, 798, 797, 795, 793, 792, 791, 790, 788, 787, 786, 785, 784, 783, 782, 781, 779, 778, 777, 776, 775, 774, 772, 771, 770, 769, 768, 767, 766, 765, 764, 762, 761, 760, 759, 756, 755, 753, 752, 750, 749, 748, 747, 745, 742, 740, 739, 738, 737, 736, 734, 732, 731, 728, 727, 726, 725, 723, 722, 721, 718, 715, 714, 713, 712, 711, 710, 708, 707, 705, 704, 702, 701, 699, 698, 696, 695, 693, 692, 690, 688, 687, 686, 685, 684, 682, 681, 679, 675, 674, 672, 671, 670, 668, 667, 666, 665, 663, 657, 655, 654, 653, 652, 650, 649, 646, 644, 643, 642, 641, 640, 639, 638, 635, 634, 633, 632, 630, 628, 627, 626, 625, 624, 623, 621, 620, 619, 618, 616, 615, 613, 610, 609, 608, 606, 605, 601, 600, 599, 598, 596, 594, 592, 591, 590, 589, 588, 587, 583, 582, 581, 580, 579, 577, 576, 575, 574, 572, 571, 570, 569, 568, 567, 565, 564, 563, 561, 560, 558, 557, 554, 552, 551, 547, 544, 542, 541, 540, 539, 538, 537, 536, 534, 533, 531, 529, 527, 524, 523, 522, 521, 520, 519, 517, 515, 514, 513, 512, 511, 510, 508, 507, 506, 503, 502, 501, 499, 498, 496, 495, 494, 493, 492, 489, 488, 487, 484, 482, 481, 480, 479, 476, 475, 474, 472, 471, 468, 464, 463, 460, 458, 457, 456, 455, 454, 453, 452, 451, 450, 448, 447, 446, 445, 443, 442, 441, 440, 439, 438, 437, 436, 435, 434, 429, 428, 425, 424, 421, 420, 419, 418, 417, 415, 414, 413, 412, 411, 410, 409, 408, 406, 405, 404, 402, 400, 399, 398, 396, 393, 392, 389, 387, 385, 382, 381, 380, 379, 377, 376, 375, 374, 371, 370, 369]
Starting structural reductions, iteration 1 : 411/474 places, 982/1650 transitions.
Applied a total of 0 rules in 48 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 411/474 places, 982/1650 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 02:06:23] [INFO ] Computed 62 place invariants in 15 ms
FORMULA PolyORBNT-PT-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 72366 resets, run finished after 8202 ms. (steps per millisecond=121 ) properties (out of 3) seen :8
FORMULA PolyORBNT-PT-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9722 resets, run finished after 1558 ms. (steps per millisecond=641 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8964 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 2) seen :7
[2022-05-18 02:06:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 02:06:34] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-18 02:06:35] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-18 02:06:35] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned sat
[2022-05-18 02:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:35] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-05-18 02:06:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:06:35] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:06:35] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 02:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:06:35] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-05-18 02:06:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:06:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 280 ms returned sat
[2022-05-18 02:06:36] [INFO ] Deduced a trap composed of 172 places in 231 ms of which 1 ms to minimize.
[2022-05-18 02:06:36] [INFO ] Deduced a trap composed of 184 places in 231 ms of which 1 ms to minimize.
[2022-05-18 02:06:36] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 1 ms to minimize.
[2022-05-18 02:06:37] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 1 ms to minimize.
[2022-05-18 02:06:37] [INFO ] Deduced a trap composed of 163 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:06:37] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 0 ms to minimize.
[2022-05-18 02:06:37] [INFO ] Deduced a trap composed of 174 places in 201 ms of which 0 ms to minimize.
[2022-05-18 02:06:38] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 1 ms to minimize.
[2022-05-18 02:06:38] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 0 ms to minimize.
[2022-05-18 02:06:38] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 0 ms to minimize.
[2022-05-18 02:06:38] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:06:39] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:06:39] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 1 ms to minimize.
[2022-05-18 02:06:40] [INFO ] Deduced a trap composed of 169 places in 204 ms of which 0 ms to minimize.
[2022-05-18 02:06:40] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 1 ms to minimize.
[2022-05-18 02:06:40] [INFO ] Deduced a trap composed of 163 places in 251 ms of which 0 ms to minimize.
[2022-05-18 02:06:41] [INFO ] Deduced a trap composed of 159 places in 243 ms of which 1 ms to minimize.
[2022-05-18 02:06:41] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 0 ms to minimize.
[2022-05-18 02:06:41] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:06:41] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 15 ms to minimize.
[2022-05-18 02:06:42] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 0 ms to minimize.
[2022-05-18 02:06:42] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:06:42] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:06:43] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 1 ms to minimize.
[2022-05-18 02:06:43] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 0 ms to minimize.
[2022-05-18 02:06:43] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 0 ms to minimize.
[2022-05-18 02:06:43] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 11 ms to minimize.
[2022-05-18 02:06:44] [INFO ] Deduced a trap composed of 159 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:06:44] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-18 02:06:44] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:06:45] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 1 ms to minimize.
[2022-05-18 02:06:45] [INFO ] Deduced a trap composed of 157 places in 206 ms of which 1 ms to minimize.
[2022-05-18 02:06:45] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 5 ms to minimize.
[2022-05-18 02:06:46] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:06:46] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 1 ms to minimize.
[2022-05-18 02:06:46] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 2 ms to minimize.
[2022-05-18 02:06:47] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 0 ms to minimize.
[2022-05-18 02:06:47] [INFO ] Deduced a trap composed of 170 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:06:48] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:06:48] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 0 ms to minimize.
[2022-05-18 02:06:49] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 0 ms to minimize.
[2022-05-18 02:06:50] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 0 ms to minimize.
[2022-05-18 02:06:50] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:06:50] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:06:51] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 1 ms to minimize.
[2022-05-18 02:06:51] [INFO ] Deduced a trap composed of 169 places in 245 ms of which 0 ms to minimize.
[2022-05-18 02:06:52] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 1 ms to minimize.
[2022-05-18 02:06:53] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 1 ms to minimize.
[2022-05-18 02:07:20] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 0 ms to minimize.
[2022-05-18 02:07:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:07:20] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-18 02:07:20] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-18 02:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:07:21] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-18 02:07:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:07:21] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:07:21] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-18 02:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:07:28] [INFO ] [Nat]Absence check using state equation in 6775 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 4]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 411 transition count 981
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 38 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:07:28] [INFO ] Computed 62 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 72454 resets, run finished after 8673 ms. (steps per millisecond=115 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 9784 resets, run finished after 1610 ms. (steps per millisecond=621 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8986 resets, run finished after 1574 ms. (steps per millisecond=635 ) properties (out of 2) seen :7
[2022-05-18 02:07:40] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:07:40] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 02:07:40] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:07:40] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-18 02:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:07:40] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-18 02:07:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:07:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:07:40] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-18 02:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:07:40] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2022-05-18 02:07:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:07:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2022-05-18 02:07:41] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 1 ms to minimize.
[2022-05-18 02:07:41] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:07:41] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:07:42] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 6 ms to minimize.
[2022-05-18 02:07:42] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 0 ms to minimize.
[2022-05-18 02:07:42] [INFO ] Deduced a trap composed of 169 places in 248 ms of which 0 ms to minimize.
[2022-05-18 02:07:43] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2022-05-18 02:07:43] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2022-05-18 02:07:43] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2022-05-18 02:07:43] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2022-05-18 02:07:44] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2022-05-18 02:07:44] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 0 ms to minimize.
[2022-05-18 02:07:44] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 1 ms to minimize.
[2022-05-18 02:07:45] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 5 ms to minimize.
[2022-05-18 02:07:45] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2022-05-18 02:07:45] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2022-05-18 02:07:45] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 13 ms to minimize.
[2022-05-18 02:07:46] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2022-05-18 02:07:46] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:07:46] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:07:46] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2022-05-18 02:07:47] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:07:47] [INFO ] Deduced a trap composed of 169 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:07:47] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:07:48] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2022-05-18 02:07:48] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:07:48] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 0 ms to minimize.
[2022-05-18 02:07:49] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:07:49] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 1 ms to minimize.
[2022-05-18 02:07:49] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2022-05-18 02:07:49] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:07:50] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2022-05-18 02:07:50] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:07:50] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2022-05-18 02:07:51] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:07:51] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2022-05-18 02:07:51] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:07:51] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 0 ms to minimize.
[2022-05-18 02:07:52] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2022-05-18 02:07:52] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:07:53] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:07:53] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:07:53] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2022-05-18 02:07:53] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:07:54] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2022-05-18 02:07:54] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 1 ms to minimize.
[2022-05-18 02:07:54] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:07:55] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:07:55] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:07:55] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:07:56] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 0 ms to minimize.
[2022-05-18 02:07:56] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:07:56] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:07:57] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:07:57] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:07:57] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2022-05-18 02:07:59] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:07:59] [INFO ] Deduced a trap composed of 173 places in 225 ms of which 0 ms to minimize.
[2022-05-18 02:08:00] [INFO ] Deduced a trap composed of 167 places in 221 ms of which 1 ms to minimize.
[2022-05-18 02:08:00] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2022-05-18 02:08:00] [INFO ] Deduced a trap composed of 169 places in 224 ms of which 0 ms to minimize.
[2022-05-18 02:08:01] [INFO ] Deduced a trap composed of 168 places in 238 ms of which 1 ms to minimize.
[2022-05-18 02:08:01] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2022-05-18 02:08:01] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:08:02] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:08:02] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:08:02] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 1 ms to minimize.
[2022-05-18 02:08:03] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:08:03] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:08:03] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2022-05-18 02:08:03] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 0 ms to minimize.
[2022-05-18 02:08:04] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2022-05-18 02:08:04] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:08:04] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:08:05] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:08:05] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:08:05] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:08:05] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:08:06] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2022-05-18 02:08:06] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:08:06] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:08:06] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:08:07] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:08:07] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:08:08] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:08:08] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:08:08] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:08:09] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2022-05-18 02:08:09] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-18 02:08:10] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-18 02:08:10] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-18 02:08:10] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-18 02:08:11] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:08:11] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:08:14] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-18 02:08:14] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-18 02:08:14] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-18 02:08:14] [INFO ] Deduced a trap composed of 175 places in 196 ms of which 1 ms to minimize.
[2022-05-18 02:08:15] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2022-05-18 02:08:15] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2022-05-18 02:08:16] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 0 ms to minimize.
[2022-05-18 02:08:16] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 0 ms to minimize.
[2022-05-18 02:08:16] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2022-05-18 02:08:17] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 0 ms to minimize.
[2022-05-18 02:08:17] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 0 ms to minimize.
[2022-05-18 02:08:18] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2022-05-18 02:08:18] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:08:20] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 0 ms to minimize.
[2022-05-18 02:08:21] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2022-05-18 02:08:21] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2022-05-18 02:08:21] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:08:22] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:08:22] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 1 ms to minimize.
[2022-05-18 02:08:22] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 0 ms to minimize.
[2022-05-18 02:08:23] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 4 ms to minimize.
[2022-05-18 02:08:23] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:08:23] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:08:24] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2022-05-18 02:08:25] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 2 ms to minimize.
[2022-05-18 02:08: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:08:25] [INFO ] [Real]Absence check using 45 positive place invariants in 31 ms returned sat
[2022-05-18 02:08:25] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 02:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:26] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2022-05-18 02:08:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:08:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:08:26] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 02:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:32] [INFO ] [Nat]Absence check using state equation in 6250 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 4]
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 02:08:32] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:32] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-18 02:08:33] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-05-18 02:08:33] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:33] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-18 02:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:08:36] [INFO ] Implicit Places using invariants and state equation in 3544 ms returned []
Implicit Place search using SMT with State Equation took 3966 ms to find 0 implicit places.
[2022-05-18 02:08:36] [INFO ] Redundant transitions in 114 ms returned []
[2022-05-18 02:08:36] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:36] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-18 02:08:37] [INFO ] Dead Transitions using invariants and state equation in 462 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-08
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:37] [INFO ] Computed 62 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 737 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2022-05-18 02:08:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:37] [INFO ] Computed 62 place invariants in 23 ms
[2022-05-18 02:08:37] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:08:37] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 16 ms returned sat
[2022-05-18 02:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:37] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-05-18 02:08:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:08:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:08:37] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-18 02:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:38] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2022-05-18 02:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:08:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 162 ms returned sat
[2022-05-18 02:08:38] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:08:38] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-18 02:08:39] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 0 ms to minimize.
[2022-05-18 02:08:39] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2022-05-18 02:08:39] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:08:39] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 0 ms to minimize.
[2022-05-18 02:08:40] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2022-05-18 02:08:40] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2022-05-18 02:08:40] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2022-05-18 02:08:41] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2022-05-18 02:08:41] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:08:41] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2022-05-18 02:08:41] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:08:42] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 1 ms to minimize.
[2022-05-18 02:08:42] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:08:42] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:08:42] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 0 ms to minimize.
[2022-05-18 02:08:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 02:08:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:43] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-18 02:08:43] [INFO ] Dead Transitions using invariants and state equation in 487 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:43] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 72655 resets, run finished after 8125 ms. (steps per millisecond=123 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9651 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 1) seen :3
[2022-05-18 02:08:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:08:53] [INFO ] Computed 62 place invariants in 22 ms
[2022-05-18 02:08:53] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:08:53] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-18 02:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:53] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-05-18 02:08:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:08:53] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-18 02:08:53] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-18 02:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:08:54] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2022-05-18 02:08:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:08:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 150 ms returned sat
[2022-05-18 02:08:54] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 1 ms to minimize.
[2022-05-18 02:08:54] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:08:55] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 1 ms to minimize.
[2022-05-18 02:08:55] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:08:55] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:08:55] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:08:56] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2022-05-18 02:08:56] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:08:56] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2022-05-18 02:08:56] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2022-05-18 02:08:57] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2022-05-18 02:08:57] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:08:57] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-18 02:08:58] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-18 02:08:58] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2022-05-18 02:08:58] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:08:58] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 1 ms to minimize.
[2022-05-18 02:08:59] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:08:59] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2022-05-18 02:08:59] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:08:59] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:09:00] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:09:00] [INFO ] Deduced a trap composed of 169 places in 214 ms of which 0 ms to minimize.
[2022-05-18 02:09:00] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:09:01] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:09:01] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 1 ms to minimize.
[2022-05-18 02:09:01] [INFO ] Deduced a trap composed of 173 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:09:02] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2022-05-18 02:09:02] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:09:02] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2022-05-18 02:09:02] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2022-05-18 02:09:03] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2022-05-18 02:09:03] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 0 ms to minimize.
[2022-05-18 02:09:03] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 1 ms to minimize.
[2022-05-18 02:09:04] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:09:04] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-18 02:09:04] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2022-05-18 02:09:04] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 1 ms to minimize.
[2022-05-18 02:09:05] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 0 ms to minimize.
[2022-05-18 02:09:05] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2022-05-18 02:09:06] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2022-05-18 02:09:06] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:09:06] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:09:06] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:09:07] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:09:07] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2022-05-18 02:09:08] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:09:08] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2022-05-18 02:09:08] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:09:08] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:09:09] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:09:09] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-18 02:09:09] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 0 ms to minimize.
[2022-05-18 02:09:10] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2022-05-18 02:09:10] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:09:10] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:09:12] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 1 ms to minimize.
[2022-05-18 02:09:12] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:09:13] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:09:13] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-18 02:09:13] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 0 ms to minimize.
[2022-05-18 02:09:14] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2022-05-18 02:09:14] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-18 02:09:14] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2022-05-18 02:09:15] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 0 ms to minimize.
[2022-05-18 02:09:15] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2022-05-18 02:09:15] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2022-05-18 02:09:15] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:09:16] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:09:16] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2022-05-18 02:09:16] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:09:17] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2022-05-18 02:09:17] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2022-05-18 02:09:17] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-18 02:09:17] [INFO ] Deduced a trap composed of 172 places in 214 ms of which 0 ms to minimize.
[2022-05-18 02:09:18] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:09:18] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:09:18] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2022-05-18 02:09:18] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 1 ms to minimize.
[2022-05-18 02:09:19] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2022-05-18 02:09:19] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 0 ms to minimize.
[2022-05-18 02:09:19] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:09:19] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 1 ms to minimize.
[2022-05-18 02:09:20] [INFO ] Deduced a trap composed of 163 places in 223 ms of which 0 ms to minimize.
[2022-05-18 02:09:20] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2022-05-18 02:09:21] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 0 ms to minimize.
[2022-05-18 02:09:21] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2022-05-18 02:09:22] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2022-05-18 02:09:22] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2022-05-18 02:09:23] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2022-05-18 02:09:23] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:09:23] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-18 02:09:24] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-18 02:09:24] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 0 ms to minimize.
[2022-05-18 02:09:26] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-18 02:09:27] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2022-05-18 02:09:27] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2022-05-18 02:09:27] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:09:28] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 1 ms to minimize.
[2022-05-18 02:09:28] [INFO ] Deduced a trap composed of 163 places in 206 ms of which 1 ms to minimize.
[2022-05-18 02:09:28] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 1 ms to minimize.
[2022-05-18 02:09:29] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 0 ms to minimize.
[2022-05-18 02:09:29] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-18 02:09:30] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 0 ms to minimize.
[2022-05-18 02:09:30] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 0 ms to minimize.
[2022-05-18 02:09:30] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2022-05-18 02:09:31] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2022-05-18 02:09:32] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2022-05-18 02:09:34] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2022-05-18 02:09:34] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-18 02:09:34] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 1 ms to minimize.
[2022-05-18 02:09:34] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 0 ms to minimize.
[2022-05-18 02:09:35] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2022-05-18 02:09:35] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 0 ms to minimize.
[2022-05-18 02:09:35] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 0 ms to minimize.
[2022-05-18 02:09:36] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2022-05-18 02:09:36] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2022-05-18 02:09:36] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2022-05-18 02:09:38] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 0 ms to minimize.
[2022-05-18 02:09: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 02:09:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:38] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 02:09:39] [INFO ] Implicit Places using invariants in 614 ms returned []
[2022-05-18 02:09:39] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:39] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 02:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:09:43] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 4472 ms to find 0 implicit places.
[2022-05-18 02:09:43] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-18 02:09:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:43] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-18 02:09:43] [INFO ] Dead Transitions using invariants and state equation in 502 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-08 in 66837 ms.
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-15
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:44] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 723 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
[2022-05-18 02:09:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:44] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-18 02:09:44] [INFO ] [Real]Absence check using 45 positive place invariants in 21 ms returned sat
[2022-05-18 02:09:44] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 7 ms returned sat
[2022-05-18 02:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:09:44] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2022-05-18 02:09:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:09:44] [INFO ] [Nat]Absence check using 45 positive place invariants in 143 ms returned sat
[2022-05-18 02:09:44] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 02:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:09:49] [INFO ] [Nat]Absence check using state equation in 4777 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 02:09:49] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:49] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-18 02:09:50] [INFO ] Dead Transitions using invariants and state equation in 411 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:50] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 72563 resets, run finished after 8178 ms. (steps per millisecond=122 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9053 resets, run finished after 1480 ms. (steps per millisecond=675 ) properties (out of 1) seen :4
[2022-05-18 02:09:59] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:09:59] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-18 02:09:59] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:09:59] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned sat
[2022-05-18 02:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:10:00] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-05-18 02:10:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:10:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2022-05-18 02:10:00] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 02:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:10:06] [INFO ] [Nat]Absence check using state equation in 6264 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 02:10:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:10:06] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 02:10:06] [INFO ] Implicit Places using invariants in 432 ms returned []
[2022-05-18 02:10:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:10:07] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-18 02:10:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:10:10] [INFO ] Implicit Places using invariants and state equation in 3788 ms returned []
Implicit Place search using SMT with State Equation took 4246 ms to find 0 implicit places.
[2022-05-18 02:10:10] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 02:10:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 02:10:10] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 02:10:11] [INFO ] Dead Transitions using invariants and state equation in 458 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-15 in 27298 ms.
[2022-05-18 02:10:11] [INFO ] Flatten gal took : 301 ms
[2022-05-18 02:10:12] [INFO ] Applying decomposition
[2022-05-18 02:10:12] [INFO ] Flatten gal took : 198 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/graph17570650742200941034.txt, -o, /tmp/graph17570650742200941034.bin, -w, /tmp/graph17570650742200941034.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/graph17570650742200941034.bin, -l, -1, -v, -w, /tmp/graph17570650742200941034.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 02:10:14] [INFO ] Decomposing Gal with order
[2022-05-18 02:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 02:10:14] [INFO ] Removed a total of 2742 redundant transitions.
[2022-05-18 02:10:14] [INFO ] Flatten gal took : 439 ms
[2022-05-18 02:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 101 ms.
[2022-05-18 02:10:15] [INFO ] Time to serialize gal into /tmp/UpperBounds4438047357049027306.gal : 37 ms
[2022-05-18 02:10:15] [INFO ] Time to serialize properties into /tmp/UpperBounds3114524654114010412.prop : 76 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4438047357049027306.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3114524654114010412.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4438047357049027306.gal -t CGAL -reachable-file /tmp/UpperBounds3114524654114010412.prop --nowitness
Loading property file /tmp/UpperBounds3114524654114010412.prop.
Detected timeout of ITS tools.
[2022-05-18 02:32:22] [INFO ] Flatten gal took : 940 ms
[2022-05-18 02:32:22] [INFO ] Time to serialize gal into /tmp/UpperBounds11692758516062643322.gal : 89 ms
[2022-05-18 02:32:22] [INFO ] Time to serialize properties into /tmp/UpperBounds1959129078893837644.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11692758516062643322.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1959129078893837644.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11692758516062643322.gal -t CGAL -reachable-file /tmp/UpperBounds1959129078893837644.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds1959129078893837644.prop.
Detected timeout of ITS tools.
[2022-05-18 02:53:53] [INFO ] Flatten gal took : 672 ms
[2022-05-18 02:53:57] [INFO ] Input system was already deterministic with 981 transitions.
[2022-05-18 02:53:57] [INFO ] Transformed 410 places.
[2022-05-18 02:53:57] [INFO ] Transformed 981 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:54:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16590981488764891146.gal : 63 ms
[2022-05-18 02:54:27] [INFO ] Time to serialize properties into /tmp/UpperBounds4424483561911134091.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16590981488764891146.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4424483561911134091.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16590981488764891146.gal -t CGAL -reachable-file /tmp/UpperBounds4424483561911134091.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4424483561911134091.prop.

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-PT-S10J20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027100319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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