Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 44K Apr 30 03:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 30 03:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 30 03:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 30 03:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652838822279

Running Version 0
[2022-05-18 01:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:53:44] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-18 01:53:44] [INFO ] Transformed 909 places.
[2022-05-18 01:53:44] [INFO ] Transformed 1970 transitions.
[2022-05-18 01:53:44] [INFO ] Parsed PT model containing 909 places and 1970 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1311 out of 1315 initially.
// Phase 1: matrix 1311 rows 909 cols
[2022-05-18 01:53:44] [INFO ] Computed 142 place invariants in 125 ms
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-06 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 678 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :19
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :19
[2022-05-18 01:53:44] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2022-05-18 01:53:45] [INFO ] Computed 142 place invariants in 75 ms
[2022-05-18 01:53:45] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2022-05-18 01:53:45] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 44 ms returned sat
[2022-05-18 01:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:45] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-05-18 01:53:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:53:46] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:53:46] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 35 ms returned sat
[2022-05-18 01:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:46] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2022-05-18 01:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:53:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2022-05-18 01:53:46] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 126 ms.
[2022-05-18 01:53:47] [INFO ] Deduced a trap composed of 540 places in 355 ms of which 4 ms to minimize.
[2022-05-18 01:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 745 ms
[2022-05-18 01:53:48] [INFO ] Added : 17 causal constraints over 4 iterations in 1590 ms. Result :sat
Minimization took 291 ms.
[2022-05-18 01:53:48] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:53:48] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 40 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 27 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 43 ms returned unsat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned sat
[2022-05-18 01:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:50] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-05-18 01:53:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:53:50] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2022-05-18 01:53:50] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-18 01:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:50] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-05-18 01:53:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 46 ms returned sat
[2022-05-18 01:53:50] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 82 ms.
[2022-05-18 01:53:51] [INFO ] Added : 17 causal constraints over 4 iterations in 1022 ms. Result :sat
Minimization took 307 ms.
[2022-05-18 01:53:52] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2022-05-18 01:53:52] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-18 01:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:52] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-05-18 01:53:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:53:52] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-18 01:53:53] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2022-05-18 01:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:53] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2022-05-18 01:53:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 31 ms returned sat
[2022-05-18 01:53:53] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 73 ms.
[2022-05-18 01:53:54] [INFO ] Deduced a trap composed of 540 places in 339 ms of which 1 ms to minimize.
[2022-05-18 01:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 714 ms
[2022-05-18 01:53:55] [INFO ] Added : 17 causal constraints over 4 iterations in 1421 ms. Result :sat
Minimization took 293 ms.
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned unsat
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2022-05-18 01:53:55] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [262, 1, 3, 1, 1, 1, 1, 262, 262, 1, 1, 1] Max seen :[3, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 5300 steps, including 333 resets, run finished after 37 ms. (steps per millisecond=143 ) properties (out of 3) seen :3 could not realise parikh vector
Incomplete Parikh walk after 5600 steps, including 325 resets, run finished after 36 ms. (steps per millisecond=155 ) properties (out of 3) seen :6 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 332 resets, run finished after 31 ms. (steps per millisecond=170 ) properties (out of 3) seen :3 could not realise parikh vector
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 136 place count 839 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
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 271 place count 771 transition count 1182
Applied a total of 271 rules in 350 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2022-05-18 01:53:56] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2022-05-18 01:53:56] [INFO ] Computed 137 place invariants in 62 ms
[2022-05-18 01:53:57] [INFO ] Dead Transitions using invariants and state equation in 1292 ms returned [743, 745, 746, 747, 748, 751, 753, 755, 756, 757, 759, 760, 761, 762, 763, 764, 765, 766, 768, 769, 770, 771, 772, 773, 775, 776, 777, 778, 779, 780, 781, 782, 785, 787, 788, 790, 791, 792, 793, 794, 796, 797, 798, 799, 800, 801, 802, 803, 804, 806, 809, 810, 811, 812, 813, 814, 815, 818, 820, 821, 823, 824, 825, 829, 830, 831, 832, 833, 834, 835, 836, 838, 840, 842, 844, 845, 846, 848, 849, 850, 851, 852, 853, 854, 855, 856, 858, 859, 860, 862, 863, 864, 865, 866, 867]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[867, 866, 865, 864, 863, 862, 860, 859, 858, 856, 855, 854, 853, 852, 851, 850, 849, 848, 846, 845, 844, 842, 840, 838, 836, 835, 834, 833, 832, 831, 830, 829, 825, 824, 823, 821, 820, 818, 815, 814, 813, 812, 811, 810, 809, 806, 804, 803, 802, 801, 800, 799, 798, 797, 796, 794, 793, 792, 791, 790, 788, 787, 785, 782, 781, 780, 779, 778, 777, 776, 775, 773, 772, 771, 770, 769, 768, 766, 765, 764, 763, 762, 761, 760, 759, 757, 756, 755, 753, 751, 748, 747, 746, 745, 743]
Starting structural reductions, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 45 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:53:57] [INFO ] Computed 137 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 47289 resets, run finished after 6198 ms. (steps per millisecond=161 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3314 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3272 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000000 steps, including 3344 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 3) seen :9
[2022-05-18 01:54:08] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:54:08] [INFO ] Computed 137 place invariants in 38 ms
[2022-05-18 01:54:08] [INFO ] [Real]Absence check using 112 positive place invariants in 21 ms returned sat
[2022-05-18 01:54:08] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-18 01:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:09] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2022-05-18 01:54:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:54:09] [INFO ] [Nat]Absence check using 112 positive place invariants in 24 ms returned sat
[2022-05-18 01:54:09] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-18 01:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:09] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-18 01:54:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2022-05-18 01:54:10] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:54:10] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 2 ms to minimize.
[2022-05-18 01:54:10] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 1 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:54:12] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 0 ms to minimize.
[2022-05-18 01:54:12] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 0 ms to minimize.
[2022-05-18 01:54:12] [INFO ] Deduced a trap composed of 260 places in 210 ms of which 0 ms to minimize.
[2022-05-18 01:54:13] [INFO ] Deduced a trap composed of 255 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:54:13] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:54:13] [INFO ] Deduced a trap composed of 256 places in 213 ms of which 0 ms to minimize.
[2022-05-18 01:54:14] [INFO ] Deduced a trap composed of 245 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:54:14] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 1 ms to minimize.
[2022-05-18 01:54:14] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:54:16] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:17] [INFO ] Deduced a trap composed of 246 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:54:17] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:54:17] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:54:17] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:54:18] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:18] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 1 ms to minimize.
[2022-05-18 01:54:18] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:19] [INFO ] Deduced a trap composed of 272 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:54:19] [INFO ] Deduced a trap composed of 251 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:54:19] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2022-05-18 01:54:20] [INFO ] Deduced a trap composed of 257 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:54:20] [INFO ] Deduced a trap composed of 254 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:54:21] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:54:21] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:54:21] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:54:22] [INFO ] Deduced a trap composed of 252 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:54:22] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:54:23] [INFO ] Deduced a trap composed of 237 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:23] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:54:23] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 1 ms to minimize.
[2022-05-18 01:54:24] [INFO ] Deduced a trap composed of 243 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:54:25] [INFO ] Deduced a trap composed of 234 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:54:28] [INFO ] Deduced a trap composed of 254 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:54:28] [INFO ] Deduced a trap composed of 239 places in 209 ms of which 0 ms to minimize.
[2022-05-18 01:54:28] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:54:29] [INFO ] Deduced a trap composed of 263 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:54:30] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 1 ms to minimize.
[2022-05-18 01:54:30] [INFO ] Deduced a trap composed of 260 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:54:31] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:31] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:54:31] [INFO ] Deduced a trap composed of 227 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:54:32] [INFO ] Deduced a trap composed of 230 places in 208 ms of which 0 ms to minimize.
[2022-05-18 01:54:34] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:54:35] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:54:54] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2022-05-18 01:54:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:54:55] [INFO ] [Real]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:54:55] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-18 01:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:55] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2022-05-18 01:54:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:54:55] [INFO ] [Nat]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:54:55] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-18 01:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:56] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2022-05-18 01:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2022-05-18 01:54:56] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 0 ms to minimize.
[2022-05-18 01:54:57] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 7 ms to minimize.
[2022-05-18 01:54:57] [INFO ] Deduced a trap composed of 249 places in 231 ms of which 1 ms to minimize.
[2022-05-18 01:54:57] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 1 ms to minimize.
[2022-05-18 01:54:57] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 1 ms to minimize.
[2022-05-18 01:54:58] [INFO ] Deduced a trap composed of 255 places in 234 ms of which 1 ms to minimize.
[2022-05-18 01:54:58] [INFO ] Deduced a trap composed of 245 places in 247 ms of which 0 ms to minimize.
[2022-05-18 01:54:58] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:59] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:54:59] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:54:59] [INFO ] Deduced a trap composed of 255 places in 217 ms of which 2 ms to minimize.
[2022-05-18 01:55:00] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 1 ms to minimize.
[2022-05-18 01:55:00] [INFO ] Deduced a trap composed of 252 places in 233 ms of which 2 ms to minimize.
[2022-05-18 01:55:01] [INFO ] Deduced a trap composed of 315 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:55:01] [INFO ] Deduced a trap composed of 251 places in 231 ms of which 1 ms to minimize.
[2022-05-18 01:55:01] [INFO ] Deduced a trap composed of 246 places in 218 ms of which 0 ms to minimize.
[2022-05-18 01:55:02] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:55:02] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 0 ms to minimize.
[2022-05-18 01:55:02] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:55:02] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:03] [INFO ] Deduced a trap composed of 257 places in 212 ms of which 0 ms to minimize.
[2022-05-18 01:55:03] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:55:04] [INFO ] Deduced a trap composed of 248 places in 216 ms of which 0 ms to minimize.
[2022-05-18 01:55:04] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:55:04] [INFO ] Deduced a trap composed of 248 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:55:05] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 9 ms to minimize.
[2022-05-18 01:55:05] [INFO ] Deduced a trap composed of 251 places in 207 ms of which 0 ms to minimize.
[2022-05-18 01:55:05] [INFO ] Deduced a trap composed of 276 places in 214 ms of which 0 ms to minimize.
[2022-05-18 01:55:06] [INFO ] Deduced a trap composed of 250 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:55:06] [INFO ] Deduced a trap composed of 258 places in 213 ms of which 0 ms to minimize.
[2022-05-18 01:55:07] [INFO ] Deduced a trap composed of 254 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:55:08] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:55:08] [INFO ] Deduced a trap composed of 239 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:55:09] [INFO ] Deduced a trap composed of 257 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:55:11] [INFO ] Deduced a trap composed of 244 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:55:11] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 0 ms to minimize.
[2022-05-18 01:55:11] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 1 ms to minimize.
[2022-05-18 01:55:11] [INFO ] Deduced a trap composed of 250 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:55:12] [INFO ] Deduced a trap composed of 257 places in 227 ms of which 1 ms to minimize.
[2022-05-18 01:55:14] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:55:41] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2022-05-18 01:55:41] [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)
[2022-05-18 01:55:41] [INFO ] [Real]Absence check using 112 positive place invariants in 37 ms returned sat
[2022-05-18 01:55:41] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-18 01:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:41] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2022-05-18 01:55:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:55:42] [INFO ] [Nat]Absence check using 112 positive place invariants in 26 ms returned sat
[2022-05-18 01:55:42] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-18 01:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:42] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-18 01:55:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2022-05-18 01:55:42] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 0 ms to minimize.
[2022-05-18 01:55:42] [INFO ] Deduced a trap composed of 224 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:55:43] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 1 ms to minimize.
[2022-05-18 01:55:43] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 0 ms to minimize.
[2022-05-18 01:55:43] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 0 ms to minimize.
[2022-05-18 01:55:44] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:55:44] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:55:44] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:55:45] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:55:45] [INFO ] Deduced a trap composed of 260 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:55:45] [INFO ] Deduced a trap composed of 255 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:55:45] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:55:46] [INFO ] Deduced a trap composed of 256 places in 218 ms of which 0 ms to minimize.
[2022-05-18 01:55:46] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:55:46] [INFO ] Deduced a trap composed of 248 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:55:47] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:49] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:49] [INFO ] Deduced a trap composed of 246 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:55:49] [INFO ] Deduced a trap composed of 245 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:55:50] [INFO ] Deduced a trap composed of 251 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:55:50] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 0 ms to minimize.
[2022-05-18 01:55:50] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:55:50] [INFO ] Deduced a trap composed of 231 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:55:51] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:55:51] [INFO ] Deduced a trap composed of 272 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:55:51] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:55:52] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2022-05-18 01:55:52] [INFO ] Deduced a trap composed of 257 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:55:53] [INFO ] Deduced a trap composed of 254 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:55:53] [INFO ] Deduced a trap composed of 240 places in 231 ms of which 0 ms to minimize.
[2022-05-18 01:55:53] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 0 ms to minimize.
[2022-05-18 01:55:54] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:55] [INFO ] Deduced a trap composed of 252 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:55] [INFO ] Deduced a trap composed of 251 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:55:55] [INFO ] Deduced a trap composed of 237 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:55:55] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 0 ms to minimize.
[2022-05-18 01:55:56] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:55:57] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:55:57] [INFO ] Deduced a trap composed of 234 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:56:00] [INFO ] Deduced a trap composed of 254 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:56:01] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:56:01] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:56:02] [INFO ] Deduced a trap composed of 263 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:56:03] [INFO ] Deduced a trap composed of 233 places in 228 ms of which 1 ms to minimize.
[2022-05-18 01:56:03] [INFO ] Deduced a trap composed of 260 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:56:03] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:56:04] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:56:04] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:56:05] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 0 ms to minimize.
[2022-05-18 01:56:07] [INFO ] Deduced a trap composed of 233 places in 210 ms of which 1 ms to minimize.
[2022-05-18 01:56:08] [INFO ] Deduced a trap composed of 237 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:56:27] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2022-05-18 01:56:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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) : [4, 142, 4] Max seen :[3, 3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 44 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 33 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-18 01:56:27] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:56:27] [INFO ] Computed 137 place invariants in 41 ms
[2022-05-18 01:56:28] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2022-05-18 01:56:28] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:56:28] [INFO ] Computed 137 place invariants in 26 ms
[2022-05-18 01:56:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:56:44] [INFO ] Implicit Places using invariants and state equation in 16001 ms returned []
Implicit Place search using SMT with State Equation took 17377 ms to find 0 implicit places.
[2022-05-18 01:56:44] [INFO ] Redundant transitions in 73 ms returned []
[2022-05-18 01:56:44] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:56:44] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-18 01:56:46] [INFO ] Dead Transitions using invariants and state equation in 1166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:56:46] [INFO ] Computed 137 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 463 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2022-05-18 01:56:46] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:56:46] [INFO ] Computed 137 place invariants in 34 ms
[2022-05-18 01:56:46] [INFO ] [Real]Absence check using 112 positive place invariants in 20 ms returned sat
[2022-05-18 01:56:46] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-18 01:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:56:47] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2022-05-18 01:56:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:56:47] [INFO ] [Nat]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:56:47] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-18 01:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:56:47] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-18 01:56:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:56:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2022-05-18 01:56:47] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 0 ms to minimize.
[2022-05-18 01:56:48] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:56:48] [INFO ] Deduced a trap composed of 240 places in 223 ms of which 0 ms to minimize.
[2022-05-18 01:56:48] [INFO ] Deduced a trap composed of 233 places in 231 ms of which 0 ms to minimize.
[2022-05-18 01:56:48] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:56:49] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:56:49] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:56:49] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 0 ms to minimize.
[2022-05-18 01:56:50] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:56:50] [INFO ] Deduced a trap composed of 260 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:56:50] [INFO ] Deduced a trap composed of 255 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:56:51] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:56:51] [INFO ] Deduced a trap composed of 256 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:56:51] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:56:52] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:56:52] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 0 ms to minimize.
[2022-05-18 01:56: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 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 771 transition count 1086
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 770 transition count 1086
Applied a total of 2 rules in 41 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2022-05-18 01:56:52] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:56:52] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-18 01:56:53] [INFO ] Dead Transitions using invariants and state equation in 1181 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:56:53] [INFO ] Computed 137 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 51942 resets, run finished after 6712 ms. (steps per millisecond=148 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3422 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 1) seen :3
[2022-05-18 01:57:02] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:57:02] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:57:02] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2022-05-18 01:57:02] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2022-05-18 01:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:57:02] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2022-05-18 01:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:57:02] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-18 01:57:02] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-18 01:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:57:02] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-05-18 01:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:57:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 529 ms returned sat
[2022-05-18 01:57:03] [INFO ] Deduced a trap composed of 251 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:57:03] [INFO ] Deduced a trap composed of 255 places in 219 ms of which 1 ms to minimize.
[2022-05-18 01:57:04] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:57:04] [INFO ] Deduced a trap composed of 248 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:57:05] [INFO ] Deduced a trap composed of 256 places in 230 ms of which 0 ms to minimize.
[2022-05-18 01:57:05] [INFO ] Deduced a trap composed of 255 places in 228 ms of which 0 ms to minimize.
[2022-05-18 01:57:05] [INFO ] Deduced a trap composed of 254 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:57:05] [INFO ] Deduced a trap composed of 263 places in 226 ms of which 1 ms to minimize.
[2022-05-18 01:57:06] [INFO ] Deduced a trap composed of 246 places in 230 ms of which 0 ms to minimize.
[2022-05-18 01:57:06] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:57:07] [INFO ] Deduced a trap composed of 259 places in 221 ms of which 0 ms to minimize.
[2022-05-18 01:57:07] [INFO ] Deduced a trap composed of 257 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:57:08] [INFO ] Deduced a trap composed of 257 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:57:08] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:57:08] [INFO ] Deduced a trap composed of 264 places in 227 ms of which 0 ms to minimize.
[2022-05-18 01:57:09] [INFO ] Deduced a trap composed of 252 places in 238 ms of which 1 ms to minimize.
[2022-05-18 01:57:09] [INFO ] Deduced a trap composed of 257 places in 228 ms of which 1 ms to minimize.
[2022-05-18 01:57:10] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 1 ms to minimize.
[2022-05-18 01:57:10] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:57:10] [INFO ] Deduced a trap composed of 256 places in 214 ms of which 1 ms to minimize.
[2022-05-18 01:57:11] [INFO ] Deduced a trap composed of 264 places in 228 ms of which 0 ms to minimize.
[2022-05-18 01:57:11] [INFO ] Deduced a trap composed of 221 places in 228 ms of which 1 ms to minimize.
[2022-05-18 01:57:12] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 1 ms to minimize.
[2022-05-18 01:57:12] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 1 ms to minimize.
[2022-05-18 01:57:13] [INFO ] Deduced a trap composed of 238 places in 231 ms of which 1 ms to minimize.
[2022-05-18 01:57:47] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2022-05-18 01:57:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-18 01:57:47] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:57:47] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:57:49] [INFO ] Implicit Places using invariants in 1309 ms returned []
[2022-05-18 01:57:49] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:57:49] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-18 01:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:58:02] [INFO ] Implicit Places using invariants and state equation in 13162 ms returned []
Implicit Place search using SMT with State Equation took 14472 ms to find 0 implicit places.
[2022-05-18 01:58:02] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 01:58:02] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:58:02] [INFO ] Computed 137 place invariants in 29 ms
[2022-05-18 01:58:03] [INFO ] Dead Transitions using invariants and state equation in 1107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00 in 77475 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-08
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:58:03] [INFO ] Computed 137 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 498 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2022-05-18 01:58:03] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:58:03] [INFO ] Computed 137 place invariants in 34 ms
[2022-05-18 01:58:03] [INFO ] [Real]Absence check using 112 positive place invariants in 21 ms returned sat
[2022-05-18 01:58:03] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-18 01:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:58:04] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2022-05-18 01:58:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:58:04] [INFO ] [Nat]Absence check using 112 positive place invariants in 24 ms returned sat
[2022-05-18 01:58:04] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-18 01:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:58:05] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2022-05-18 01:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:58:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2022-05-18 01:58:05] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:58:05] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 0 ms to minimize.
[2022-05-18 01:58:06] [INFO ] Deduced a trap composed of 249 places in 228 ms of which 0 ms to minimize.
[2022-05-18 01:58:06] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 1 ms to minimize.
[2022-05-18 01:58:06] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:58:07] [INFO ] Deduced a trap composed of 255 places in 228 ms of which 1 ms to minimize.
[2022-05-18 01:58:07] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:58:07] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 0 ms to minimize.
[2022-05-18 01:58:07] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 0 ms to minimize.
[2022-05-18 01:58:08] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:58:08] [INFO ] Deduced a trap composed of 255 places in 259 ms of which 1 ms to minimize.
[2022-05-18 01:58:08] [INFO ] Deduced a trap composed of 237 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:58:09] [INFO ] Deduced a trap composed of 252 places in 231 ms of which 0 ms to minimize.
[2022-05-18 01:58:09] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2022-05-18 01:58:09] [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) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-18 01:58:09] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:58:09] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:58:11] [INFO ] Dead Transitions using invariants and state equation in 1158 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:58:11] [INFO ] Computed 137 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 47237 resets, run finished after 6207 ms. (steps per millisecond=161 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3278 resets, run finished after 1529 ms. (steps per millisecond=654 ) properties (out of 1) seen :3
[2022-05-18 01:58:18] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:58:18] [INFO ] Computed 137 place invariants in 26 ms
[2022-05-18 01:58:18] [INFO ] [Real]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:58:18] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-18 01:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:58:19] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2022-05-18 01:58:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:58:19] [INFO ] [Nat]Absence check using 112 positive place invariants in 24 ms returned sat
[2022-05-18 01:58:19] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-18 01:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:58:20] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2022-05-18 01:58:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:58:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2022-05-18 01:58:20] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:58:21] [INFO ] Deduced a trap composed of 231 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:58:21] [INFO ] Deduced a trap composed of 249 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:58:21] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:58:21] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 1 ms to minimize.
[2022-05-18 01:58:22] [INFO ] Deduced a trap composed of 255 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:58:22] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 1 ms to minimize.
[2022-05-18 01:58:22] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:58:23] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:58:23] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:58:23] [INFO ] Deduced a trap composed of 255 places in 226 ms of which 1 ms to minimize.
[2022-05-18 01:58:23] [INFO ] Deduced a trap composed of 237 places in 225 ms of which 1 ms to minimize.
[2022-05-18 01:58:24] [INFO ] Deduced a trap composed of 252 places in 229 ms of which 1 ms to minimize.
[2022-05-18 01:58:24] [INFO ] Deduced a trap composed of 315 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:58:25] [INFO ] Deduced a trap composed of 251 places in 225 ms of which 1 ms to minimize.
[2022-05-18 01:58:25] [INFO ] Deduced a trap composed of 246 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:58:25] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:58:26] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 1 ms to minimize.
[2022-05-18 01:58:26] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:58:26] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:58:27] [INFO ] Deduced a trap composed of 257 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:58:27] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:58:28] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:58:28] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:58:28] [INFO ] Deduced a trap composed of 248 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:58:29] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2022-05-18 01:58:29] [INFO ] Deduced a trap composed of 251 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:58:29] [INFO ] Deduced a trap composed of 276 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:58:30] [INFO ] Deduced a trap composed of 250 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:58:30] [INFO ] Deduced a trap composed of 258 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:58:31] [INFO ] Deduced a trap composed of 254 places in 218 ms of which 1 ms to minimize.
[2022-05-18 01:58:31] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2022-05-18 01:58:32] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 0 ms to minimize.
[2022-05-18 01:58:32] [INFO ] Deduced a trap composed of 257 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:58:34] [INFO ] Deduced a trap composed of 244 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:58:35] [INFO ] Deduced a trap composed of 238 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:58:35] [INFO ] Deduced a trap composed of 246 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:58:35] [INFO ] Deduced a trap composed of 250 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:58:36] [INFO ] Deduced a trap composed of 257 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:58:38] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2022-05-18 01:59:05] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2022-05-18 01:59:05] [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) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 45 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-18 01:59:05] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:59:05] [INFO ] Computed 137 place invariants in 31 ms
[2022-05-18 01:59:06] [INFO ] Implicit Places using invariants in 1324 ms returned []
[2022-05-18 01:59:06] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:59:06] [INFO ] Computed 137 place invariants in 31 ms
[2022-05-18 01:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:59:23] [INFO ] Implicit Places using invariants and state equation in 16602 ms returned []
Implicit Place search using SMT with State Equation took 17927 ms to find 0 implicit places.
[2022-05-18 01:59:23] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 01:59:23] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:59:23] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:59:24] [INFO ] Dead Transitions using invariants and state equation in 1186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-08 in 80705 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-09
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:59:24] [INFO ] Computed 137 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 458 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2022-05-18 01:59:24] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-18 01:59:24] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:59:24] [INFO ] [Real]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:59:24] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-18 01:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:59:25] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2022-05-18 01:59:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:59:25] [INFO ] [Nat]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-18 01:59:25] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-18 01:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:59:25] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-18 01:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:59:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2022-05-18 01:59:25] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:59:26] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 1 ms to minimize.
[2022-05-18 01:59:26] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 0 ms to minimize.
[2022-05-18 01:59:26] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:59:27] [INFO ] Deduced a trap composed of 243 places in 216 ms of which 0 ms to minimize.
[2022-05-18 01:59:27] [INFO ] Deduced a trap composed of 234 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:59:27] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 2 ms to minimize.
[2022-05-18 01:59:27] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 0 ms to minimize.
[2022-05-18 01:59:28] [INFO ] Deduced a trap composed of 239 places in 207 ms of which 1 ms to minimize.
[2022-05-18 01:59:28] [INFO ] Deduced a trap composed of 260 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:59:28] [INFO ] Deduced a trap composed of 255 places in 211 ms of which 0 ms to minimize.
[2022-05-18 01:59:29] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 3 ms to minimize.
[2022-05-18 01:59:29] [INFO ] Deduced a trap composed of 256 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:59:29] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 0 ms to minimize.
[2022-05-18 01:59:30] [INFO ] Deduced a trap composed of 248 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:59:30] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:59:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 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 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 47 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2022-05-18 01:59:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:59:30] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-18 01:59:31] [INFO ] Dead Transitions using invariants and state equation in 1118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:59:31] [INFO ] Computed 137 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 52049 resets, run finished after 6590 ms. (steps per millisecond=151 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3447 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties (out of 1) seen :3
[2022-05-18 01:59:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 01:59:39] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 01:59:39] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2022-05-18 01:59:39] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-18 01:59:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:59:40] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-18 01:59:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:59:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2022-05-18 01:59:40] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-18 01:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:59:40] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-18 01:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:59:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 533 ms returned sat
[2022-05-18 01:59:41] [INFO ] Deduced a trap composed of 251 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:59:41] [INFO ] Deduced a trap composed of 255 places in 239 ms of which 0 ms to minimize.
[2022-05-18 01:59:42] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:59:42] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 0 ms to minimize.
[2022-05-18 01:59:43] [INFO ] Deduced a trap composed of 256 places in 233 ms of which 1 ms to minimize.
[2022-05-18 01:59:43] [INFO ] Deduced a trap composed of 255 places in 225 ms of which 0 ms to minimize.
[2022-05-18 01:59:43] [INFO ] Deduced a trap composed of 254 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:59:43] [INFO ] Deduced a trap composed of 263 places in 234 ms of which 0 ms to minimize.
[2022-05-18 01:59:44] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:59:44] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:59:45] [INFO ] Deduced a trap composed of 259 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:59:45] [INFO ] Deduced a trap composed of 257 places in 226 ms of which 0 ms to minimize.
[2022-05-18 01:59:45] [INFO ] Deduced a trap composed of 257 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:59:46] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:59:46] [INFO ] Deduced a trap composed of 264 places in 216 ms of which 1 ms to minimize.
[2022-05-18 01:59:47] [INFO ] Deduced a trap composed of 252 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:59:47] [INFO ] Deduced a trap composed of 257 places in 230 ms of which 1 ms to minimize.
[2022-05-18 01:59:47] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2022-05-18 01:59:48] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 0 ms to minimize.
[2022-05-18 01:59:48] [INFO ] Deduced a trap composed of 256 places in 215 ms of which 1 ms to minimize.
[2022-05-18 01:59:49] [INFO ] Deduced a trap composed of 264 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:59:49] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 0 ms to minimize.
[2022-05-18 01:59:49] [INFO ] Deduced a trap composed of 227 places in 225 ms of which 0 ms to minimize.
[2022-05-18 01:59:50] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:59:51] [INFO ] Deduced a trap composed of 238 places in 219 ms of which 0 ms to minimize.
[2022-05-18 02:00:25] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2022-05-18 02:00:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-18 02:00:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 02:00:25] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-18 02:00:26] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2022-05-18 02:00:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 02:00:27] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-18 02:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 02:00:39] [INFO ] Implicit Places using invariants and state equation in 12251 ms returned []
Implicit Place search using SMT with State Equation took 13513 ms to find 0 implicit places.
[2022-05-18 02:00:39] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-18 02:00:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-18 02:00:39] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-18 02:00:40] [INFO ] Dead Transitions using invariants and state equation in 1101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-09 in 76115 ms.
[2022-05-18 02:00:40] [INFO ] Flatten gal took : 196 ms
[2022-05-18 02:00:40] [INFO ] Applying decomposition
[2022-05-18 02:00:40] [INFO ] Flatten gal took : 80 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/graph1715642669754401196.txt, -o, /tmp/graph1715642669754401196.bin, -w, /tmp/graph1715642669754401196.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/graph1715642669754401196.bin, -l, -1, -v, -w, /tmp/graph1715642669754401196.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 02:00:41] [INFO ] Decomposing Gal with order
[2022-05-18 02:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 02:00:41] [INFO ] Removed a total of 1273 redundant transitions.
[2022-05-18 02:00:41] [INFO ] Flatten gal took : 344 ms
[2022-05-18 02:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 65 ms.
[2022-05-18 02:00:41] [INFO ] Time to serialize gal into /tmp/UpperBounds17888116676948697235.gal : 47 ms
[2022-05-18 02:00:41] [INFO ] Time to serialize properties into /tmp/UpperBounds7475674138645650967.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/UpperBounds17888116676948697235.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7475674138645650967.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/UpperBounds17888116676948697235.gal -t CGAL -reachable-file /tmp/UpperBounds7475674138645650967.prop --nowitness
Loading property file /tmp/UpperBounds7475674138645650967.prop.
Detected timeout of ITS tools.
[2022-05-18 02:23:03] [INFO ] Flatten gal took : 320 ms
[2022-05-18 02:23:03] [INFO ] Time to serialize gal into /tmp/UpperBounds15600499587698590635.gal : 56 ms
[2022-05-18 02:23:03] [INFO ] Time to serialize properties into /tmp/UpperBounds11013990580749828956.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/UpperBounds15600499587698590635.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11013990580749828956.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/UpperBounds15600499587698590635.gal -t CGAL -reachable-file /tmp/UpperBounds11013990580749828956.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11013990580749828956.prop.
Detected timeout of ITS tools.
[2022-05-18 02:45:27] [INFO ] Flatten gal took : 334 ms
[2022-05-18 02:45:28] [INFO ] Input system was already deterministic with 1087 transitions.
[2022-05-18 02:45:28] [INFO ] Transformed 771 places.
[2022-05-18 02:45:28] [INFO ] Transformed 1087 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:45:58] [INFO ] Time to serialize gal into /tmp/UpperBounds9207642602354881359.gal : 5 ms
[2022-05-18 02:45:58] [INFO ] Time to serialize properties into /tmp/UpperBounds14441589934460447737.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9207642602354881359.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14441589934460447737.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/UpperBounds9207642602354881359.gal -t CGAL -reachable-file /tmp/UpperBounds14441589934460447737.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/UpperBounds14441589934460447737.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-S05J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is PolyORBNT-PT-S05J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027100313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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