Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 624K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 311K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 10K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 25 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 25 12:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.9M May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621222861263

Running Version 0
[2021-05-17 03:41:02] [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]
[2021-05-17 03:41:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 03:41:02] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2021-05-17 03:41:02] [INFO ] Transformed 629 places.
[2021-05-17 03:41:02] [INFO ] Transformed 1590 transitions.
[2021-05-17 03:41:02] [INFO ] Parsed PT model containing 629 places and 1590 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 41 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 931 out of 935 initially.
// Phase 1: matrix 931 rows 629 cols
[2021-05-17 03:41:03] [INFO ] Computed 102 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 707 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :20
FORMULA PolyORBNT-PT-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :8
FORMULA PolyORBNT-PT-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :10
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :11
FORMULA PolyORBNT-PT-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :11
[2021-05-17 03:41:03] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2021-05-17 03:41:03] [INFO ] Computed 102 place invariants in 55 ms
[2021-05-17 03:41:03] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2021-05-17 03:41:03] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2021-05-17 03:41:03] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2021-05-17 03:41:03] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2021-05-17 03:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:04] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-17 03:41:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:41:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 152 ms returned sat
[2021-05-17 03:41:04] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 47 ms returned sat
[2021-05-17 03:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:04] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2021-05-17 03:41:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:41:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2021-05-17 03:41:05] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 88 ms.
[2021-05-17 03:41:05] [INFO ] Added : 20 causal constraints over 4 iterations in 504 ms. Result :sat
Minimization took 215 ms.
[2021-05-17 03:41:05] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:41:05] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 16 ms returned sat
[2021-05-17 03:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:06] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-17 03:41:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:41:06] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:41:06] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 15 ms returned sat
[2021-05-17 03:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:07] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2021-05-17 03:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 99 ms returned sat
[2021-05-17 03:41:07] [INFO ] Deduced a trap composed of 210 places in 247 ms of which 3 ms to minimize.
[2021-05-17 03:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2021-05-17 03:41:07] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 59 ms.
[2021-05-17 03:41:07] [INFO ] Added : 7 causal constraints over 2 iterations in 322 ms. Result :sat
Minimization took 130 ms.
[2021-05-17 03:41:08] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2021-05-17 03:41:08] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 16 ms returned sat
[2021-05-17 03:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:08] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2021-05-17 03:41:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:41:08] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2021-05-17 03:41:08] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 16 ms returned sat
[2021-05-17 03:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:08] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-17 03:41:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2021-05-17 03:41:09] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 59 ms.
[2021-05-17 03:41:09] [INFO ] Added : 20 causal constraints over 4 iterations in 500 ms. Result :sat
Minimization took 210 ms.
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 15 ms returned unsat
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 7 ms returned unsat
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:41:09] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 9 ms returned unsat
[2021-05-17 03:41:10] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:41:10] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 17 ms returned sat
[2021-05-17 03:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:10] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-05-17 03:41:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:41:10] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:41:10] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-17 03:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:11] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2021-05-17 03:41:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 03:41:11] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 2 ms to minimize.
[2021-05-17 03:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2021-05-17 03:41:11] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 42 ms.
[2021-05-17 03:41:12] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2021-05-17 03:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2021-05-17 03:41:12] [INFO ] Added : 42 causal constraints over 9 iterations in 1351 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : [4, 646, 1, 646, 1, 1, 1, 5] Max seen :[4, 3, 0, 3, 1, 1, 1, 0]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 15400 steps, including 977 resets, run finished after 92 ms. (steps per millisecond=167 ) properties (out of 4) seen :5 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 319 resets, run finished after 20 ms. (steps per millisecond=245 ) properties (out of 4) seen :3 could not realise parikh vector
FORMULA PolyORBNT-PT-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1100 steps, including 91 resets, run finished after 4 ms. (steps per millisecond=275 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 318 resets, run finished after 37 ms. (steps per millisecond=132 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 624 transition count 891
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 94 place count 580 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 579 transition count 890
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 95 place count 579 transition count 846
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 183 place count 535 transition count 846
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 534 transition count 845
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 534 transition count 845
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 3 with 4 rules applied. Total rules applied 189 place count 532 transition count 843
Applied a total of 189 rules in 191 ms. Remains 532 /629 variables (removed 97) and now considering 843/935 (removed 92) transitions.
[2021-05-17 03:41:13] [INFO ] Flow matrix only has 839 transitions (discarded 4 similar events)
// Phase 1: matrix 839 rows 532 cols
[2021-05-17 03:41:13] [INFO ] Computed 97 place invariants in 28 ms
[2021-05-17 03:41:13] [INFO ] Dead Transitions using invariants and state equation in 586 ms returned [506, 508, 509, 512, 514, 516, 518, 519, 521, 522, 523, 525, 526, 527, 528, 529, 533, 534, 535, 536, 537, 539, 540, 541, 542, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 556, 557, 558, 560, 561, 562, 563, 564, 565, 566, 568, 570, 571, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 584, 585, 586, 587, 588, 591, 592, 593, 594, 595, 596, 597, 602, 603, 604, 605, 606, 608, 609, 610, 612, 613, 616, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[630, 629, 628, 627, 626, 625, 624, 623, 622, 621, 620, 619, 618, 616, 613, 612, 610, 609, 608, 606, 605, 604, 603, 602, 597, 596, 595, 594, 593, 592, 591, 588, 587, 586, 585, 584, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 571, 570, 568, 566, 565, 564, 563, 562, 561, 560, 558, 557, 556, 554, 553, 552, 551, 550, 549, 548, 547, 546, 545, 544, 542, 541, 540, 539, 537, 536, 535, 534, 533, 529, 528, 527, 526, 525, 523, 522, 521, 519, 518, 516, 514, 512, 509, 508, 506]
Starting structural reductions, iteration 1 : 532/629 places, 748/935 transitions.
Applied a total of 0 rules in 52 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/629 places, 748/935 transitions.
Normalized transition count is 744 out of 748 initially.
// Phase 1: matrix 744 rows 532 cols
[2021-05-17 03:41:14] [INFO ] Computed 97 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47311 resets, run finished after 3773 ms. (steps per millisecond=265 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4446 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4541 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4531 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 3) seen :7
[2021-05-17 03:41:20] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2021-05-17 03:41:20] [INFO ] Computed 97 place invariants in 23 ms
[2021-05-17 03:41:20] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2021-05-17 03:41:20] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-17 03:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:21] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2021-05-17 03:41:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:41:21] [INFO ] [Real]Added 1 Read/Feed constraints in 18 ms returned sat
[2021-05-17 03:41:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:41:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 21 ms returned sat
[2021-05-17 03:41:21] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 33 ms returned sat
[2021-05-17 03:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:41:22] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2021-05-17 03:41:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2021-05-17 03:41:22] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 1 ms to minimize.
[2021-05-17 03:41:22] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 13 ms to minimize.
[2021-05-17 03:41:22] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 1 ms to minimize.
[2021-05-17 03:41:22] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2021-05-17 03:41:22] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 1 ms to minimize.
[2021-05-17 03:41:23] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:41:23] [INFO ] Deduced a trap composed of 180 places in 133 ms of which 0 ms to minimize.
[2021-05-17 03:41:23] [INFO ] Deduced a trap composed of 162 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:41:23] [INFO ] Deduced a trap composed of 159 places in 118 ms of which 0 ms to minimize.
[2021-05-17 03:41:23] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 1 ms to minimize.
[2021-05-17 03:41:24] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 13 ms to minimize.
[2021-05-17 03:41:24] [INFO ] Deduced a trap composed of 162 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:41:24] [INFO ] Deduced a trap composed of 168 places in 110 ms of which 0 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 172 places in 126 ms of which 1 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 186 places in 140 ms of which 0 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 0 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 180 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 166 places in 117 ms of which 1 ms to minimize.
[2021-05-17 03:41:25] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:41:26] [INFO ] Deduced a trap composed of 167 places in 137 ms of which 0 ms to minimize.
[2021-05-17 03:41:26] [INFO ] Deduced a trap composed of 177 places in 144 ms of which 0 ms to minimize.
[2021-05-17 03:41:29] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2021-05-17 03:42:06] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2021-05-17 03:42:06] [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)
[2021-05-17 03:42:06] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:42:06] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-17 03:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:42:07] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2021-05-17 03:42:07] [INFO ] [Real]Added 1 Read/Feed constraints in 15 ms returned sat
[2021-05-17 03:42:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:42:07] [INFO ] [Nat]Absence check using 76 positive place invariants in 20 ms returned sat
[2021-05-17 03:42:07] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-17 03:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:42:07] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2021-05-17 03:42:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 0 ms to minimize.
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 0 ms to minimize.
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 0 ms to minimize.
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 0 ms to minimize.
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 1 ms to minimize.
[2021-05-17 03:42:08] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:42:09] [INFO ] Deduced a trap composed of 180 places in 121 ms of which 1 ms to minimize.
[2021-05-17 03:42:09] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 4 ms to minimize.
[2021-05-17 03:42:09] [INFO ] Deduced a trap composed of 159 places in 172 ms of which 1 ms to minimize.
[2021-05-17 03:42:09] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 1 ms to minimize.
[2021-05-17 03:42:09] [INFO ] Deduced a trap composed of 162 places in 118 ms of which 0 ms to minimize.
[2021-05-17 03:42:10] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2021-05-17 03:42:10] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 11 ms to minimize.
[2021-05-17 03:42:10] [INFO ] Deduced a trap composed of 172 places in 130 ms of which 1 ms to minimize.
[2021-05-17 03:42:11] [INFO ] Deduced a trap composed of 186 places in 150 ms of which 1 ms to minimize.
[2021-05-17 03:42:11] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 0 ms to minimize.
[2021-05-17 03:42:11] [INFO ] Deduced a trap composed of 180 places in 154 ms of which 0 ms to minimize.
[2021-05-17 03:42:11] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:42:11] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 0 ms to minimize.
[2021-05-17 03:42:12] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 1 ms to minimize.
[2021-05-17 03:42:12] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 1 ms to minimize.
[2021-05-17 03:42:52] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2021-05-17 03:42:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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)
[2021-05-17 03:42:52] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:42:52] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [196, 196, 1] Max seen :[3, 3, 1]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 532/532 places, 748/748 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 532 transition count 747
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 531 transition count 747
Applied a total of 2 rules in 28 ms. Remains 531 /532 variables (removed 1) and now considering 747/748 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/532 places, 747/748 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:42:52] [INFO ] Computed 97 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47351 resets, run finished after 3511 ms. (steps per millisecond=284 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 4559 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4376 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 2) seen :6
[2021-05-17 03:42:58] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:42:58] [INFO ] Computed 97 place invariants in 17 ms
[2021-05-17 03:42:58] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:42:58] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-17 03:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:42:58] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-17 03:42:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:42:58] [INFO ] [Nat]Absence check using 76 positive place invariants in 11 ms returned sat
[2021-05-17 03:42:58] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 31 ms returned sat
[2021-05-17 03:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:42:59] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2021-05-17 03:42:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:42:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 03:42:59] [INFO ] Deduced a trap composed of 168 places in 114 ms of which 1 ms to minimize.
[2021-05-17 03:42:59] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 1 ms to minimize.
[2021-05-17 03:42:59] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 1 ms to minimize.
[2021-05-17 03:42:59] [INFO ] Deduced a trap composed of 186 places in 128 ms of which 0 ms to minimize.
[2021-05-17 03:42:59] [INFO ] Deduced a trap composed of 171 places in 135 ms of which 0 ms to minimize.
[2021-05-17 03:43:00] [INFO ] Deduced a trap composed of 170 places in 111 ms of which 1 ms to minimize.
[2021-05-17 03:43:00] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 7 ms to minimize.
[2021-05-17 03:43:00] [INFO ] Deduced a trap composed of 161 places in 137 ms of which 1 ms to minimize.
[2021-05-17 03:43:00] [INFO ] Deduced a trap composed of 168 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:00] [INFO ] Deduced a trap composed of 180 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:01] [INFO ] Deduced a trap composed of 178 places in 117 ms of which 1 ms to minimize.
[2021-05-17 03:43:01] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 0 ms to minimize.
[2021-05-17 03:43:01] [INFO ] Deduced a trap composed of 175 places in 145 ms of which 0 ms to minimize.
[2021-05-17 03:43:01] [INFO ] Deduced a trap composed of 172 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:43:01] [INFO ] Deduced a trap composed of 186 places in 109 ms of which 0 ms to minimize.
[2021-05-17 03:43:02] [INFO ] Deduced a trap composed of 170 places in 118 ms of which 0 ms to minimize.
[2021-05-17 03:43:02] [INFO ] Deduced a trap composed of 168 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:02] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:02] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 0 ms to minimize.
[2021-05-17 03:43:03] [INFO ] Deduced a trap composed of 170 places in 124 ms of which 1 ms to minimize.
[2021-05-17 03:43:03] [INFO ] Deduced a trap composed of 173 places in 136 ms of which 0 ms to minimize.
[2021-05-17 03:43:03] [INFO ] Deduced a trap composed of 155 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:43:03] [INFO ] Deduced a trap composed of 180 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:43:03] [INFO ] Deduced a trap composed of 179 places in 116 ms of which 1 ms to minimize.
[2021-05-17 03:43:04] [INFO ] Deduced a trap composed of 170 places in 137 ms of which 0 ms to minimize.
[2021-05-17 03:43:04] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 0 ms to minimize.
[2021-05-17 03:43:04] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 1 ms to minimize.
[2021-05-17 03:43:04] [INFO ] Deduced a trap composed of 176 places in 111 ms of which 1 ms to minimize.
[2021-05-17 03:43:05] [INFO ] Deduced a trap composed of 174 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:43:05] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 0 ms to minimize.
[2021-05-17 03:43:05] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 0 ms to minimize.
[2021-05-17 03:43:05] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:05] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 1 ms to minimize.
[2021-05-17 03:43:06] [INFO ] Deduced a trap composed of 179 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:06] [INFO ] Deduced a trap composed of 174 places in 128 ms of which 0 ms to minimize.
[2021-05-17 03:43:06] [INFO ] Deduced a trap composed of 186 places in 122 ms of which 1 ms to minimize.
[2021-05-17 03:43:07] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 1 ms to minimize.
[2021-05-17 03:43:07] [INFO ] Deduced a trap composed of 173 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:07] [INFO ] Deduced a trap composed of 179 places in 110 ms of which 1 ms to minimize.
[2021-05-17 03:43:08] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 0 ms to minimize.
[2021-05-17 03:43:08] [INFO ] Deduced a trap composed of 161 places in 111 ms of which 1 ms to minimize.
[2021-05-17 03:43:08] [INFO ] Deduced a trap composed of 159 places in 109 ms of which 1 ms to minimize.
[2021-05-17 03:43:43] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2021-05-17 03:43:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2021-05-17 03:43:43] [INFO ] [Real]Absence check using 76 positive place invariants in 11 ms returned sat
[2021-05-17 03:43:43] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-17 03:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:43:44] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-17 03:43:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:43:44] [INFO ] [Nat]Absence check using 76 positive place invariants in 10 ms returned sat
[2021-05-17 03:43:44] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2021-05-17 03:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:43:44] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-17 03:43:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 03:43:44] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 0 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 186 places in 133 ms of which 1 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 1 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 170 places in 110 ms of which 0 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 157 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:43:45] [INFO ] Deduced a trap composed of 161 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:43:46] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:43:46] [INFO ] Deduced a trap composed of 180 places in 110 ms of which 0 ms to minimize.
[2021-05-17 03:43:46] [INFO ] Deduced a trap composed of 178 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:43:46] [INFO ] Deduced a trap composed of 161 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:43:46] [INFO ] Deduced a trap composed of 175 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:43:47] [INFO ] Deduced a trap composed of 172 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:43:47] [INFO ] Deduced a trap composed of 186 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:47] [INFO ] Deduced a trap composed of 170 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:43:47] [INFO ] Deduced a trap composed of 168 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:43:48] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:43:48] [INFO ] Deduced a trap composed of 161 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:43:48] [INFO ] Deduced a trap composed of 170 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:43:48] [INFO ] Deduced a trap composed of 173 places in 109 ms of which 1 ms to minimize.
[2021-05-17 03:43:48] [INFO ] Deduced a trap composed of 155 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 180 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 179 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 1 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 168 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 176 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:43:49] [INFO ] Deduced a trap composed of 176 places in 127 ms of which 13 ms to minimize.
[2021-05-17 03:43:50] [INFO ] Deduced a trap composed of 174 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:50] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:43:50] [INFO ] Deduced a trap composed of 161 places in 113 ms of which 1 ms to minimize.
[2021-05-17 03:43:50] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:50] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:43:51] [INFO ] Deduced a trap composed of 179 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:43:51] [INFO ] Deduced a trap composed of 174 places in 113 ms of which 1 ms to minimize.
[2021-05-17 03:43:51] [INFO ] Deduced a trap composed of 186 places in 118 ms of which 1 ms to minimize.
[2021-05-17 03:43:52] [INFO ] Deduced a trap composed of 170 places in 123 ms of which 0 ms to minimize.
[2021-05-17 03:43:52] [INFO ] Deduced a trap composed of 173 places in 106 ms of which 0 ms to minimize.
[2021-05-17 03:43:53] [INFO ] Deduced a trap composed of 179 places in 105 ms of which 1 ms to minimize.
[2021-05-17 03:43:53] [INFO ] Deduced a trap composed of 171 places in 134 ms of which 0 ms to minimize.
[2021-05-17 03:43:53] [INFO ] Deduced a trap composed of 161 places in 110 ms of which 1 ms to minimize.
[2021-05-17 03:43:53] [INFO ] Deduced a trap composed of 159 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:44:29] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2021-05-17 03:44:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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)
Current structural bounds on expressions (after SMT) : [196, 196] Max seen :[3, 3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 03:44:29] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:29] [INFO ] Computed 97 place invariants in 16 ms
[2021-05-17 03:44:30] [INFO ] Implicit Places using invariants in 723 ms returned []
[2021-05-17 03:44:30] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:30] [INFO ] Computed 97 place invariants in 10 ms
[2021-05-17 03:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:44:36] [INFO ] Implicit Places using invariants and state equation in 6231 ms returned []
Implicit Place search using SMT with State Equation took 6969 ms to find 0 implicit places.
[2021-05-17 03:44:36] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-17 03:44:36] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:36] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 03:44:36] [INFO ] Dead Transitions using invariants and state equation in 499 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-04
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:36] [INFO ] Computed 97 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 459 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
[2021-05-17 03:44:36] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:36] [INFO ] Computed 97 place invariants in 18 ms
[2021-05-17 03:44:37] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:44:37] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-17 03:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:44:37] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2021-05-17 03:44:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:44:37] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2021-05-17 03:44:37] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2021-05-17 03:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:44:38] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-17 03:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:44:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 153 places in 128 ms of which 0 ms to minimize.
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 154 places in 133 ms of which 1 ms to minimize.
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 186 places in 131 ms of which 0 ms to minimize.
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:44:38] [INFO ] Deduced a trap composed of 170 places in 134 ms of which 1 ms to minimize.
[2021-05-17 03:44:39] [INFO ] Deduced a trap composed of 157 places in 117 ms of which 0 ms to minimize.
[2021-05-17 03:44:39] [INFO ] Deduced a trap composed of 161 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:44:39] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:44:39] [INFO ] Deduced a trap composed of 180 places in 129 ms of which 1 ms to minimize.
[2021-05-17 03:44:40] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 0 ms to minimize.
[2021-05-17 03:44:40] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 0 ms to minimize.
[2021-05-17 03:44:40] [INFO ] Deduced a trap composed of 175 places in 119 ms of which 0 ms to minimize.
[2021-05-17 03:44:40] [INFO ] Deduced a trap composed of 172 places in 126 ms of which 1 ms to minimize.
[2021-05-17 03:44:40] [INFO ] Deduced a trap composed of 186 places in 148 ms of which 0 ms to minimize.
[2021-05-17 03:44:41] [INFO ] Deduced a trap composed of 170 places in 108 ms of which 0 ms to minimize.
[2021-05-17 03:44:41] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:44:41] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:44:41] [INFO ] Deduced a trap composed of 161 places in 116 ms of which 1 ms to minimize.
[2021-05-17 03:44:41] [INFO ] Deduced a trap composed of 170 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:44:42] [INFO ] Deduced a trap composed of 173 places in 118 ms of which 1 ms to minimize.
[2021-05-17 03:44:42] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 1 ms to minimize.
[2021-05-17 03:44: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) : [196] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 03:44:42] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:42] [INFO ] Computed 97 place invariants in 16 ms
[2021-05-17 03:44:42] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:43] [INFO ] Computed 97 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47277 resets, run finished after 3483 ms. (steps per millisecond=287 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4455 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 1) seen :3
[2021-05-17 03:44:47] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:44:47] [INFO ] Computed 97 place invariants in 19 ms
[2021-05-17 03:44:47] [INFO ] [Real]Absence check using 76 positive place invariants in 11 ms returned sat
[2021-05-17 03:44:47] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-17 03:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:44:47] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-17 03:44:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:44:47] [INFO ] [Nat]Absence check using 76 positive place invariants in 11 ms returned sat
[2021-05-17 03:44:47] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2021-05-17 03:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:44:48] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2021-05-17 03:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:44:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 03:44:48] [INFO ] Deduced a trap composed of 168 places in 109 ms of which 1 ms to minimize.
[2021-05-17 03:44:48] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 0 ms to minimize.
[2021-05-17 03:44:48] [INFO ] Deduced a trap composed of 154 places in 128 ms of which 1 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 186 places in 110 ms of which 1 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 171 places in 130 ms of which 0 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 170 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 157 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 1 ms to minimize.
[2021-05-17 03:44:49] [INFO ] Deduced a trap composed of 168 places in 109 ms of which 1 ms to minimize.
[2021-05-17 03:44:50] [INFO ] Deduced a trap composed of 180 places in 150 ms of which 1 ms to minimize.
[2021-05-17 03:44:50] [INFO ] Deduced a trap composed of 178 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:44:50] [INFO ] Deduced a trap composed of 161 places in 107 ms of which 1 ms to minimize.
[2021-05-17 03:44:50] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:44:50] [INFO ] Deduced a trap composed of 172 places in 128 ms of which 0 ms to minimize.
[2021-05-17 03:44:51] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 1 ms to minimize.
[2021-05-17 03:44:51] [INFO ] Deduced a trap composed of 170 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:44:51] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 0 ms to minimize.
[2021-05-17 03:44:51] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 0 ms to minimize.
[2021-05-17 03:44:52] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:44:52] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:44:52] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 0 ms to minimize.
[2021-05-17 03:44:52] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 1 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 180 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 179 places in 136 ms of which 0 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 1 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 168 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 176 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:44:53] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 1 ms to minimize.
[2021-05-17 03:44:54] [INFO ] Deduced a trap composed of 174 places in 139 ms of which 0 ms to minimize.
[2021-05-17 03:44:54] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 1 ms to minimize.
[2021-05-17 03:44:54] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:44:54] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 1 ms to minimize.
[2021-05-17 03:44:54] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 1 ms to minimize.
[2021-05-17 03:44:55] [INFO ] Deduced a trap composed of 179 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:44:55] [INFO ] Deduced a trap composed of 174 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:44:55] [INFO ] Deduced a trap composed of 186 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:44:56] [INFO ] Deduced a trap composed of 170 places in 119 ms of which 0 ms to minimize.
[2021-05-17 03:44:56] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 0 ms to minimize.
[2021-05-17 03:44:57] [INFO ] Deduced a trap composed of 179 places in 109 ms of which 1 ms to minimize.
[2021-05-17 03:44:57] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2021-05-17 03:44:57] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 1 ms to minimize.
[2021-05-17 03:44:57] [INFO ] Deduced a trap composed of 159 places in 119 ms of which 0 ms to minimize.
[2021-05-17 03:45:33] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2021-05-17 03:45:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [196] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 17 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 13 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 03:45:33] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:33] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 03:45:33] [INFO ] Implicit Places using invariants in 552 ms returned []
[2021-05-17 03:45:33] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:33] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 03:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:45:40] [INFO ] Implicit Places using invariants and state equation in 6616 ms returned []
Implicit Place search using SMT with State Equation took 7182 ms to find 0 implicit places.
[2021-05-17 03:45:40] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-17 03:45:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:40] [INFO ] Computed 97 place invariants in 12 ms
[2021-05-17 03:45:40] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-04 in 63965 ms.
Starting property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-06
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:40] [INFO ] Computed 97 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2021-05-17 03:45:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:40] [INFO ] Computed 97 place invariants in 14 ms
[2021-05-17 03:45:40] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2021-05-17 03:45:40] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2021-05-17 03:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:45:41] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2021-05-17 03:45:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:45:41] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:45:41] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2021-05-17 03:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:45:41] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2021-05-17 03:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:45:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 0 ms to minimize.
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 153 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 154 places in 127 ms of which 0 ms to minimize.
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 0 ms to minimize.
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 171 places in 130 ms of which 1 ms to minimize.
[2021-05-17 03:45:42] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 0 ms to minimize.
[2021-05-17 03:45:43] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 1 ms to minimize.
[2021-05-17 03:45:43] [INFO ] Deduced a trap composed of 161 places in 132 ms of which 1 ms to minimize.
[2021-05-17 03:45:43] [INFO ] Deduced a trap composed of 168 places in 129 ms of which 0 ms to minimize.
[2021-05-17 03:45:43] [INFO ] Deduced a trap composed of 180 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:45:44] [INFO ] Deduced a trap composed of 178 places in 132 ms of which 1 ms to minimize.
[2021-05-17 03:45:44] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 0 ms to minimize.
[2021-05-17 03:45:44] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 1 ms to minimize.
[2021-05-17 03:45:44] [INFO ] Deduced a trap composed of 172 places in 144 ms of which 0 ms to minimize.
[2021-05-17 03:45:44] [INFO ] Deduced a trap composed of 186 places in 129 ms of which 1 ms to minimize.
[2021-05-17 03:45:45] [INFO ] Deduced a trap composed of 170 places in 125 ms of which 0 ms to minimize.
[2021-05-17 03:45:45] [INFO ] Deduced a trap composed of 168 places in 127 ms of which 1 ms to minimize.
[2021-05-17 03:45:45] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 0 ms to minimize.
[2021-05-17 03:45:45] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 0 ms to minimize.
[2021-05-17 03:45:45] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2021-05-17 03:45:46] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 1 ms to minimize.
[2021-05-17 03:45:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [196] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 24 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 03:45:46] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:46] [INFO ] Computed 97 place invariants in 11 ms
[2021-05-17 03:45:46] [INFO ] Dead Transitions using invariants and state equation in 539 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:46] [INFO ] Computed 97 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47223 resets, run finished after 3518 ms. (steps per millisecond=284 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4493 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 1) seen :3
[2021-05-17 03:45:51] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:45:51] [INFO ] Computed 97 place invariants in 18 ms
[2021-05-17 03:45:51] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2021-05-17 03:45:51] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 13 ms returned sat
[2021-05-17 03:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:45:51] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-17 03:45:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:45:51] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2021-05-17 03:45:51] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2021-05-17 03:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:45:52] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-17 03:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:45:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 03:45:52] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 0 ms to minimize.
[2021-05-17 03:45:52] [INFO ] Deduced a trap composed of 153 places in 135 ms of which 1 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 154 places in 132 ms of which 0 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 186 places in 251 ms of which 0 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 171 places in 122 ms of which 1 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 1 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 1 ms to minimize.
[2021-05-17 03:45:53] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 1 ms to minimize.
[2021-05-17 03:45:54] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 1 ms to minimize.
[2021-05-17 03:45:54] [INFO ] Deduced a trap composed of 180 places in 137 ms of which 1 ms to minimize.
[2021-05-17 03:45:54] [INFO ] Deduced a trap composed of 178 places in 118 ms of which 0 ms to minimize.
[2021-05-17 03:45:54] [INFO ] Deduced a trap composed of 161 places in 134 ms of which 1 ms to minimize.
[2021-05-17 03:45:55] [INFO ] Deduced a trap composed of 175 places in 119 ms of which 1 ms to minimize.
[2021-05-17 03:45:55] [INFO ] Deduced a trap composed of 172 places in 119 ms of which 0 ms to minimize.
[2021-05-17 03:45:55] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 1 ms to minimize.
[2021-05-17 03:45:55] [INFO ] Deduced a trap composed of 170 places in 123 ms of which 0 ms to minimize.
[2021-05-17 03:45:56] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 0 ms to minimize.
[2021-05-17 03:45:56] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 0 ms to minimize.
[2021-05-17 03:45:56] [INFO ] Deduced a trap composed of 161 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:45:56] [INFO ] Deduced a trap composed of 170 places in 113 ms of which 0 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 173 places in 237 ms of which 0 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 155 places in 114 ms of which 1 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 180 places in 114 ms of which 1 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 179 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 170 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:45:57] [INFO ] Deduced a trap composed of 168 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:45:58] [INFO ] Deduced a trap composed of 176 places in 119 ms of which 0 ms to minimize.
[2021-05-17 03:45:58] [INFO ] Deduced a trap composed of 176 places in 116 ms of which 0 ms to minimize.
[2021-05-17 03:45:58] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 0 ms to minimize.
[2021-05-17 03:45:58] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:45:59] [INFO ] Deduced a trap composed of 161 places in 118 ms of which 1 ms to minimize.
[2021-05-17 03:45:59] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:45:59] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 1 ms to minimize.
[2021-05-17 03:45:59] [INFO ] Deduced a trap composed of 179 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:46:00] [INFO ] Deduced a trap composed of 174 places in 108 ms of which 1 ms to minimize.
[2021-05-17 03:46:00] [INFO ] Deduced a trap composed of 186 places in 131 ms of which 0 ms to minimize.
[2021-05-17 03:46:00] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 0 ms to minimize.
[2021-05-17 03:46:01] [INFO ] Deduced a trap composed of 173 places in 114 ms of which 0 ms to minimize.
[2021-05-17 03:46:01] [INFO ] Deduced a trap composed of 179 places in 115 ms of which 1 ms to minimize.
[2021-05-17 03:46:01] [INFO ] Deduced a trap composed of 171 places in 111 ms of which 0 ms to minimize.
[2021-05-17 03:46:01] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 0 ms to minimize.
[2021-05-17 03:46:02] [INFO ] Deduced a trap composed of 159 places in 107 ms of which 0 ms to minimize.
[2021-05-17 03:46:37] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2021-05-17 03:46:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [196] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 14 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 13 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2021-05-17 03:46:37] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:46:37] [INFO ] Computed 97 place invariants in 24 ms
[2021-05-17 03:46:37] [INFO ] Implicit Places using invariants in 534 ms returned []
[2021-05-17 03:46:37] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:46:37] [INFO ] Computed 97 place invariants in 10 ms
[2021-05-17 03:46:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:46:44] [INFO ] Implicit Places using invariants and state equation in 6827 ms returned []
Implicit Place search using SMT with State Equation took 7361 ms to find 0 implicit places.
[2021-05-17 03:46:44] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-17 03:46:44] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2021-05-17 03:46:44] [INFO ] Computed 97 place invariants in 34 ms
[2021-05-17 03:46:45] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-06 in 64203 ms.
[2021-05-17 03:46:45] [INFO ] Flatten gal took : 102 ms
[2021-05-17 03:46:45] [INFO ] Applying decomposition
[2021-05-17 03:46:45] [INFO ] Flatten gal took : 45 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/graph1016054307634822966.txt, -o, /tmp/graph1016054307634822966.bin, -w, /tmp/graph1016054307634822966.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/graph1016054307634822966.bin, -l, -1, -v, -w, /tmp/graph1016054307634822966.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 03:46:45] [INFO ] Decomposing Gal with order
[2021-05-17 03:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 03:46:45] [INFO ] Removed a total of 721 redundant transitions.
[2021-05-17 03:46:45] [INFO ] Flatten gal took : 223 ms
[2021-05-17 03:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 32 ms.
[2021-05-17 03:46:45] [INFO ] Time to serialize gal into /tmp/UpperBounds6480831112401352902.gal : 14 ms
[2021-05-17 03:46:45] [INFO ] Time to serialize properties into /tmp/UpperBounds15195642456924239829.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6480831112401352902.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15195642456924239829.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/UpperBounds6480831112401352902.gal -t CGAL -reachable-file /tmp/UpperBounds15195642456924239829.prop --nowitness
Loading property file /tmp/UpperBounds15195642456924239829.prop.
Detected timeout of ITS tools.
[2021-05-17 04:08:41] [INFO ] Flatten gal took : 247 ms
[2021-05-17 04:08:42] [INFO ] Time to serialize gal into /tmp/UpperBounds3639008746509670331.gal : 59 ms
[2021-05-17 04:08:42] [INFO ] Time to serialize properties into /tmp/UpperBounds3155684165727958289.prop : 7 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/UpperBounds3639008746509670331.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3155684165727958289.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/UpperBounds3639008746509670331.gal -t CGAL -reachable-file /tmp/UpperBounds3155684165727958289.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3155684165727958289.prop.
Detected timeout of ITS tools.
[2021-05-17 04:30:38] [INFO ] Flatten gal took : 408 ms
[2021-05-17 04:30:46] [INFO ] Input system was already deterministic with 747 transitions.
[2021-05-17 04:30:46] [INFO ] Transformed 531 places.
[2021-05-17 04:30:46] [INFO ] Transformed 747 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
[2021-05-17 04:31:16] [INFO ] Time to serialize gal into /tmp/UpperBounds18206693338708077274.gal : 48 ms
[2021-05-17 04:31:16] [INFO ] Time to serialize properties into /tmp/UpperBounds8368903178719869041.prop : 2 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/UpperBounds18206693338708077274.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8368903178719869041.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/UpperBounds18206693338708077274.gal -t CGAL -reachable-file /tmp/UpperBounds8368903178719869041.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/UpperBounds8368903178719869041.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-S05J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J40, 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 r159-oct2-162089268400459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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