Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 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-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678879317026

Running Version 202205111006
[2023-03-15 11:21:58] [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]
[2023-03-15 11:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:21:58] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2023-03-15 11:21:58] [INFO ] Transformed 1189 places.
[2023-03-15 11:21:58] [INFO ] Transformed 2350 transitions.
[2023-03-15 11:21:58] [INFO ] Parsed PT model containing 1189 places and 2350 transitions in 399 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 1691 out of 1695 initially.
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 11:21:59] [INFO ] Computed 182 place invariants in 221 ms
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 688 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 14) seen :36
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :21
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10000 steps, including 146 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :25
[2023-03-15 11:21:59] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 11:21:59] [INFO ] Computed 182 place invariants in 94 ms
[2023-03-15 11:22:00] [INFO ] [Real]Absence check using 157 positive place invariants in 59 ms returned sat
[2023-03-15 11:22:00] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 30 ms returned unsat
[2023-03-15 11:22:00] [INFO ] [Real]Absence check using 157 positive place invariants in 48 ms returned sat
[2023-03-15 11:22:00] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-15 11:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:01] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2023-03-15 11:22:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:01] [INFO ] [Nat]Absence check using 157 positive place invariants in 74 ms returned sat
[2023-03-15 11:22:01] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-15 11:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:02] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2023-03-15 11:22:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:22:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:22:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3709 ms returned unknown
[2023-03-15 11:22:06] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-15 11:22:06] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 36 ms returned unsat
[2023-03-15 11:22:06] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-15 11:22:07] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 26 ms returned unsat
[2023-03-15 11:22:07] [INFO ] [Real]Absence check using 157 positive place invariants in 33 ms returned sat
[2023-03-15 11:22:07] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-15 11:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:08] [INFO ] [Real]Absence check using state equation in 1224 ms returned sat
[2023-03-15 11:22:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:08] [INFO ] [Nat]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-15 11:22:08] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-15 11:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:09] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2023-03-15 11:22:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 112 ms returned sat
[2023-03-15 11:22:09] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 175 ms.
[2023-03-15 11:22:11] [INFO ] Deduced a trap composed of 441 places in 533 ms of which 3 ms to minimize.
[2023-03-15 11:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 793 ms
[2023-03-15 11:22:11] [INFO ] Added : 17 causal constraints over 4 iterations in 2298 ms. Result :sat
Minimization took 586 ms.
[2023-03-15 11:22:12] [INFO ] [Real]Absence check using 157 positive place invariants in 72 ms returned sat
[2023-03-15 11:22:12] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 43 ms returned unsat
[2023-03-15 11:22:12] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-15 11:22:12] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-15 11:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:14] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-15 11:22:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:14] [INFO ] [Nat]Absence check using 157 positive place invariants in 33 ms returned sat
[2023-03-15 11:22:14] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-15 11:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:15] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2023-03-15 11:22:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 111 ms returned sat
[2023-03-15 11:22:15] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 106 ms.
[2023-03-15 11:22:17] [INFO ] Deduced a trap composed of 441 places in 513 ms of which 2 ms to minimize.
[2023-03-15 11:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 754 ms
[2023-03-15 11:22:17] [INFO ] Added : 17 causal constraints over 4 iterations in 2108 ms. Result :sat
Minimization took 598 ms.
[2023-03-15 11:22:18] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-15 11:22:18] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 41 ms returned unsat
[2023-03-15 11:22:18] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-15 11:22:18] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-15 11:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:19] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-15 11:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:19] [INFO ] [Nat]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-15 11:22:19] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-15 11:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:20] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2023-03-15 11:22:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 817 ms returned sat
[2023-03-15 11:22:21] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 108 ms.
[2023-03-15 11:22:21] [INFO ] Added : 28 causal constraints over 6 iterations in 737 ms. Result :sat
Minimization took 804 ms.
[2023-03-15 11:22:22] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-15 11:22:22] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 3 ms returned unsat
[2023-03-15 11:22:23] [INFO ] [Real]Absence check using 157 positive place invariants in 44 ms returned sat
[2023-03-15 11:22:23] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1, 10, 988, 1, 988, 1, 1, 1, 1] Max seen :[4, 3, 1, 10, 3, 1, 3, 1, 0, 1, 1]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 175 place count 1099 transition count 1610
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 175 place count 1099 transition count 1527
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 341 place count 1016 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 342 place count 1015 transition count 1526
Iterating global reduction 2 with 1 rules applied. Total rules applied 343 place count 1015 transition count 1526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 347 place count 1013 transition count 1524
Applied a total of 347 rules in 407 ms. Remains 1013 /1189 variables (removed 176) and now considering 1524/1695 (removed 171) transitions.
[2023-03-15 11:22:23] [INFO ] Flow matrix only has 1520 transitions (discarded 4 similar events)
// Phase 1: matrix 1520 rows 1013 cols
[2023-03-15 11:22:23] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 11:22:25] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1013/1189 places, 1429/1695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1013 /1013 variables (removed 0) and now considering 1429/1429 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/1189 places, 1429/1695 transitions.
Normalized transition count is 1425 out of 1429 initially.
// Phase 1: matrix 1425 rows 1013 cols
[2023-03-15 11:22:25] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 47085 resets, run finished after 8147 ms. (steps per millisecond=122 ) properties (out of 4) seen :10
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2668 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2629 resets, run finished after 1759 ms. (steps per millisecond=568 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2688 resets, run finished after 1762 ms. (steps per millisecond=567 ) properties (out of 3) seen :9
[2023-03-15 11:22:39] [INFO ] Flow matrix only has 1425 transitions (discarded 4 similar events)
// Phase 1: matrix 1425 rows 1013 cols
[2023-03-15 11:22:39] [INFO ] Computed 177 place invariants in 38 ms
[2023-03-15 11:22:39] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-15 11:22:39] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 11:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:40] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-15 11:22:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:40] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 11:22:40] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-15 11:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:40] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-15 11:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:22:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:22:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 4054 ms returned sat
[2023-03-15 11:22:45] [INFO ] Deduced a trap composed of 314 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:22:45] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 2 ms to minimize.
[2023-03-15 11:22:46] [INFO ] Deduced a trap composed of 325 places in 360 ms of which 0 ms to minimize.
[2023-03-15 11:22:46] [INFO ] Deduced a trap composed of 326 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:22:46] [INFO ] Deduced a trap composed of 328 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:22:47] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 0 ms to minimize.
[2023-03-15 11:22:47] [INFO ] Deduced a trap composed of 308 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:22:48] [INFO ] Deduced a trap composed of 328 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:22:48] [INFO ] Deduced a trap composed of 328 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:22:49] [INFO ] Deduced a trap composed of 341 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:22:50] [INFO ] Deduced a trap composed of 313 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:22:50] [INFO ] Deduced a trap composed of 313 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:22:51] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:22:54] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 9367 ms
[2023-03-15 11:22:54] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-15 11:22:54] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 11:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:39] [INFO ] [Real]Absence check using state equation in 44858 ms returned unknown
[2023-03-15 11:23:39] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 11:23:39] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 11:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:24:24] [INFO ] [Real]Absence check using state equation in 44859 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 988, 988] Max seen :[3, 3, 3]
Support contains 2 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1013/1013 places, 1429/1429 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1013 transition count 1428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1012 transition count 1428
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1012 transition count 1427
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1011 transition count 1427
Applied a total of 4 rules in 77 ms. Remains 1011 /1013 variables (removed 2) and now considering 1427/1429 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1013 places, 1427/1429 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:24:24] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 47519 resets, run finished after 8002 ms. (steps per millisecond=124 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2695 resets, run finished after 1748 ms. (steps per millisecond=572 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2655 resets, run finished after 1762 ms. (steps per millisecond=567 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2736 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 3) seen :9
[2023-03-15 11:24:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:24:37] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-15 11:24:37] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 11:24:37] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-15 11:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:24:39] [INFO ] [Real]Absence check using state equation in 1519 ms returned sat
[2023-03-15 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:24:39] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 11:24:39] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-15 11:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:24:40] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-15 11:24:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:24:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2742 ms returned sat
[2023-03-15 11:24:43] [INFO ] Deduced a trap composed of 344 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:24:43] [INFO ] Deduced a trap composed of 336 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:24:44] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:24:44] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:24:44] [INFO ] Deduced a trap composed of 336 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:24:45] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:24:45] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:24:46] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:24:46] [INFO ] Deduced a trap composed of 345 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:24:46] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:24:47] [INFO ] Deduced a trap composed of 323 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:24:47] [INFO ] Deduced a trap composed of 332 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:24:48] [INFO ] Deduced a trap composed of 312 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:24:49] [INFO ] Deduced a trap composed of 338 places in 327 ms of which 1 ms to minimize.
[2023-03-15 11:24:49] [INFO ] Deduced a trap composed of 326 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:24:50] [INFO ] Deduced a trap composed of 335 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:24:50] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:24:51] [INFO ] Deduced a trap composed of 339 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:24:52] [INFO ] Deduced a trap composed of 318 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:24:53] [INFO ] Deduced a trap composed of 332 places in 338 ms of which 3 ms to minimize.
[2023-03-15 11:24:53] [INFO ] Deduced a trap composed of 344 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:24:54] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:24:54] [INFO ] Deduced a trap composed of 353 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:24:55] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:24:56] [INFO ] Deduced a trap composed of 334 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:24:56] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:24:56] [INFO ] Deduced a trap composed of 326 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 330 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 321 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:24:58] [INFO ] Deduced a trap composed of 342 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:24:58] [INFO ] Deduced a trap composed of 315 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 326 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:25:00] [INFO ] Deduced a trap composed of 317 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:25:01] [INFO ] Deduced a trap composed of 345 places in 327 ms of which 0 ms to minimize.
[2023-03-15 11:25:01] [INFO ] Deduced a trap composed of 324 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:25:01] [INFO ] Deduced a trap composed of 321 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:25:02] [INFO ] Deduced a trap composed of 324 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:25:03] [INFO ] Deduced a trap composed of 341 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:25:03] [INFO ] Deduced a trap composed of 328 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:25:06] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 24004 ms
[2023-03-15 11:25:07] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-15 11:25:07] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-15 11:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:07] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2023-03-15 11:25:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:08] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 11:25:08] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 36 ms returned sat
[2023-03-15 11:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:08] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2023-03-15 11:25:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2760 ms returned sat
[2023-03-15 11:25:11] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:25:12] [INFO ] Deduced a trap composed of 335 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:25:12] [INFO ] Deduced a trap composed of 333 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 336 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 305 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 333 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 320 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 329 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:25:15] [INFO ] Deduced a trap composed of 326 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:25:15] [INFO ] Deduced a trap composed of 357 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:25:16] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 2 ms to minimize.
[2023-03-15 11:25:16] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 2 ms to minimize.
[2023-03-15 11:25:16] [INFO ] Deduced a trap composed of 333 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:25:17] [INFO ] Deduced a trap composed of 332 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:25:17] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:25:18] [INFO ] Deduced a trap composed of 308 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:25:18] [INFO ] Deduced a trap composed of 333 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:25:19] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:25:19] [INFO ] Deduced a trap composed of 317 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:25:20] [INFO ] Deduced a trap composed of 318 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:25:20] [INFO ] Deduced a trap composed of 326 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:25:21] [INFO ] Deduced a trap composed of 332 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:25:22] [INFO ] Deduced a trap composed of 332 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:25:23] [INFO ] Deduced a trap composed of 343 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:25:23] [INFO ] Deduced a trap composed of 335 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:25:24] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 0 ms to minimize.
[2023-03-15 11:25:24] [INFO ] Deduced a trap composed of 322 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:25:25] [INFO ] Deduced a trap composed of 339 places in 329 ms of which 0 ms to minimize.
[2023-03-15 11:25:25] [INFO ] Deduced a trap composed of 330 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:25:26] [INFO ] Deduced a trap composed of 323 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:25:27] [INFO ] Deduced a trap composed of 326 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:25:27] [INFO ] Deduced a trap composed of 320 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:25:28] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:25:29] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:25:29] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:25:29] [INFO ] Deduced a trap composed of 320 places in 325 ms of which 0 ms to minimize.
[2023-03-15 11:25:30] [INFO ] Deduced a trap composed of 323 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:25:30] [INFO ] Deduced a trap composed of 339 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:25:31] [INFO ] Deduced a trap composed of 311 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:25:31] [INFO ] Deduced a trap composed of 317 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:25:32] [INFO ] Deduced a trap composed of 320 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:25:32] [INFO ] Deduced a trap composed of 332 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:25:33] [INFO ] Deduced a trap composed of 329 places in 352 ms of which 0 ms to minimize.
[2023-03-15 11:25:33] [INFO ] Deduced a trap composed of 317 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:25:34] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:25:34] [INFO ] Deduced a trap composed of 329 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:25:35] [INFO ] Deduced a trap composed of 329 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:25:36] [INFO ] Deduced a trap composed of 338 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:25:38] [INFO ] Deduced a trap composed of 305 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:25:38] [INFO ] Deduced a trap composed of 317 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:25:38] [INFO ] Deduced a trap composed of 320 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:25:39] [INFO ] Deduced a trap composed of 317 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:25:40] [INFO ] Deduced a trap composed of 342 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:25:41] [INFO ] Deduced a trap composed of 336 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:25:42] [INFO ] Deduced a trap composed of 309 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:25:44] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:25:45] [INFO ] Deduced a trap composed of 354 places in 330 ms of which 0 ms to minimize.
[2023-03-15 11:25:45] [INFO ] Deduced a trap composed of 323 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:25:48] [INFO ] Deduced a trap composed of 345 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:25:48] [INFO ] Deduced a trap composed of 332 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:25:49] [INFO ] Deduced a trap composed of 335 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:25:49] [INFO ] Deduced a trap composed of 329 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:25:50] [INFO ] Deduced a trap composed of 315 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:25:51] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:25:51] [INFO ] Deduced a trap composed of 321 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:25:52] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:25:52] [INFO ] Deduced a trap composed of 311 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:25:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:25:53] [INFO ] [Real]Absence check using 156 positive place invariants in 30 ms returned sat
[2023-03-15 11:25:53] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-15 11:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:53] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2023-03-15 11:25:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:54] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 11:25:54] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 36 ms returned sat
[2023-03-15 11:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:54] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-15 11:25:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2718 ms returned sat
[2023-03-15 11:25:57] [INFO ] Deduced a trap composed of 332 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:25:58] [INFO ] Deduced a trap composed of 335 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:25:58] [INFO ] Deduced a trap composed of 333 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:25:59] [INFO ] Deduced a trap composed of 336 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:25:59] [INFO ] Deduced a trap composed of 305 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:25:59] [INFO ] Deduced a trap composed of 333 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 320 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:26:00] [INFO ] Deduced a trap composed of 329 places in 337 ms of which 0 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 357 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:26:01] [INFO ] Deduced a trap composed of 338 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:26:02] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:26:02] [INFO ] Deduced a trap composed of 333 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 332 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:26:03] [INFO ] Deduced a trap composed of 323 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:26:04] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:26:04] [INFO ] Deduced a trap composed of 333 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:26:05] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:26:05] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:26:06] [INFO ] Deduced a trap composed of 318 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:26:06] [INFO ] Deduced a trap composed of 326 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:26:07] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:26:08] [INFO ] Deduced a trap composed of 332 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:26:09] [INFO ] Deduced a trap composed of 343 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:26:09] [INFO ] Deduced a trap composed of 335 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:26:10] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:26:10] [INFO ] Deduced a trap composed of 322 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:26:11] [INFO ] Deduced a trap composed of 339 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:26:11] [INFO ] Deduced a trap composed of 330 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:26:11] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 326 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 320 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:26:14] [INFO ] Deduced a trap composed of 320 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:26:15] [INFO ] Deduced a trap composed of 326 places in 359 ms of which 1 ms to minimize.
[2023-03-15 11:26:15] [INFO ] Deduced a trap composed of 323 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:26:16] [INFO ] Deduced a trap composed of 320 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:26:16] [INFO ] Deduced a trap composed of 323 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:26:17] [INFO ] Deduced a trap composed of 339 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:26:17] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 317 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 320 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 332 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 0 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 317 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:26:20] [INFO ] Deduced a trap composed of 323 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 329 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 329 places in 370 ms of which 1 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 338 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:26:24] [INFO ] Deduced a trap composed of 305 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:26:24] [INFO ] Deduced a trap composed of 317 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:26:25] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:26:25] [INFO ] Deduced a trap composed of 317 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:26:26] [INFO ] Deduced a trap composed of 342 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:26:27] [INFO ] Deduced a trap composed of 336 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:26:29] [INFO ] Deduced a trap composed of 309 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:26:31] [INFO ] Deduced a trap composed of 335 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:26:31] [INFO ] Deduced a trap composed of 354 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:26:31] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 0 ms to minimize.
[2023-03-15 11:26:34] [INFO ] Deduced a trap composed of 345 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:26:34] [INFO ] Deduced a trap composed of 332 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:26:35] [INFO ] Deduced a trap composed of 335 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:26:35] [INFO ] Deduced a trap composed of 329 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:26:36] [INFO ] Deduced a trap composed of 315 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:26:37] [INFO ] Deduced a trap composed of 314 places in 347 ms of which 0 ms to minimize.
[2023-03-15 11:26:38] [INFO ] Deduced a trap composed of 321 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:26:38] [INFO ] Deduced a trap composed of 323 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:26:38] [INFO ] Trap strengthening (SAT) tested/added 66/66 trap constraints in 41463 ms
Current structural bounds on expressions (after SMT) : [4, 988, 988] Max seen :[3, 3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 47 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 45 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 11:26:39] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:26:39] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 11:26:41] [INFO ] Implicit Places using invariants in 2363 ms returned []
[2023-03-15 11:26:41] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:26:41] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-15 11:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:27:12] [INFO ] Performed 689/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:27:19] [INFO ] Implicit Places using invariants and state equation in 37858 ms returned []
Implicit Place search using SMT with State Equation took 40223 ms to find 0 implicit places.
[2023-03-15 11:27:19] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-15 11:27:19] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:27:19] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 1982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:27:21] [INFO ] Computed 177 place invariants in 42 ms
Incomplete random walk after 10000 steps, including 480 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-15 11:27:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:27:21] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 11:27:21] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 11:27:21] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 11:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:23] [INFO ] [Real]Absence check using state equation in 1501 ms returned sat
[2023-03-15 11:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:27:23] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-15 11:27:23] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 39 ms returned sat
[2023-03-15 11:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:24] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-15 11:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:27:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2742 ms returned sat
[2023-03-15 11:27:27] [INFO ] Deduced a trap composed of 344 places in 383 ms of which 1 ms to minimize.
[2023-03-15 11:27:27] [INFO ] Deduced a trap composed of 336 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:27:28] [INFO ] Deduced a trap composed of 338 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:27:28] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:27:28] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 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 1011 transition count 1426
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 1010 transition count 1426
Applied a total of 2 rules in 53 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-15 11:27:28] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:27:28] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 11:27:30] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:27:30] [INFO ] Computed 177 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 51991 resets, run finished after 8530 ms. (steps per millisecond=117 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2708 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 1) seen :3
[2023-03-15 11:27:40] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:27:40] [INFO ] Computed 177 place invariants in 50 ms
[2023-03-15 11:27:41] [INFO ] [Real]Absence check using 155 positive place invariants in 34 ms returned sat
[2023-03-15 11:27:41] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-15 11:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:42] [INFO ] [Real]Absence check using state equation in 1728 ms returned sat
[2023-03-15 11:27:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:27:42] [INFO ] [Nat]Absence check using 155 positive place invariants in 32 ms returned sat
[2023-03-15 11:27:42] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-15 11:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:44] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2023-03-15 11:27:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:27:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1950 ms returned sat
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 342 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:27:46] [INFO ] Deduced a trap composed of 317 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:27:47] [INFO ] Deduced a trap composed of 317 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:27:47] [INFO ] Deduced a trap composed of 318 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 327 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 326 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:27:48] [INFO ] Deduced a trap composed of 345 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:27:49] [INFO ] Deduced a trap composed of 321 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:27:49] [INFO ] Deduced a trap composed of 330 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:27:50] [INFO ] Deduced a trap composed of 326 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:27:50] [INFO ] Deduced a trap composed of 345 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:27:51] [INFO ] Deduced a trap composed of 315 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:27:51] [INFO ] Deduced a trap composed of 311 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:27:51] [INFO ] Deduced a trap composed of 311 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:27:52] [INFO ] Deduced a trap composed of 335 places in 324 ms of which 0 ms to minimize.
[2023-03-15 11:27:52] [INFO ] Deduced a trap composed of 330 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:27:53] [INFO ] Deduced a trap composed of 339 places in 324 ms of which 1 ms to minimize.
[2023-03-15 11:27:53] [INFO ] Deduced a trap composed of 318 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:27:54] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 0 ms to minimize.
[2023-03-15 11:27:55] [INFO ] Deduced a trap composed of 335 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:27:55] [INFO ] Deduced a trap composed of 326 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:27:56] [INFO ] Deduced a trap composed of 303 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:27:57] [INFO ] Deduced a trap composed of 293 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:27:57] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:27:58] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:27:59] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 0 ms to minimize.
[2023-03-15 11:27:59] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:28:00] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:28:00] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:28:03] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:28:03] [INFO ] Deduced a trap composed of 324 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:28:04] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:28:06] [INFO ] Deduced a trap composed of 339 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:28:08] [INFO ] Deduced a trap composed of 305 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:28:10] [INFO ] Deduced a trap composed of 324 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:28:13] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 27392 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 42 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 44 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 11:28:13] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:28:13] [INFO ] Computed 177 place invariants in 41 ms
[2023-03-15 11:28:16] [INFO ] Implicit Places using invariants in 2553 ms returned []
[2023-03-15 11:28:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:28:16] [INFO ] Computed 177 place invariants in 26 ms
[2023-03-15 11:28:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:28:46] [INFO ] Performed 206/1010 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:28:59] [INFO ] Implicit Places using invariants and state equation in 43671 ms returned []
Implicit Place search using SMT with State Equation took 46226 ms to find 0 implicit places.
[2023-03-15 11:28:59] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-15 11:28:59] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 11:28:59] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-15 11:29:01] [INFO ] Dead Transitions using invariants and state equation in 1999 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01 in 100414 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:29:01] [INFO ] Computed 177 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 484 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-15 11:29:01] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:29:01] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 11:29:02] [INFO ] [Real]Absence check using 156 positive place invariants in 30 ms returned sat
[2023-03-15 11:29:02] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-15 11:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:02] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2023-03-15 11:29:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:03] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-15 11:29:03] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-15 11:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:03] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-15 11:29:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:29:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2783 ms returned sat
[2023-03-15 11:29:07] [INFO ] Deduced a trap composed of 332 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:29:07] [INFO ] Deduced a trap composed of 335 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:29:07] [INFO ] Deduced a trap composed of 333 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:29:08] [INFO ] Deduced a trap composed of 336 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:29:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 51 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 11:29:08] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:29:08] [INFO ] Computed 177 place invariants in 25 ms
[2023-03-15 11:29:10] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:29:10] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 47184 resets, run finished after 8038 ms. (steps per millisecond=124 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2632 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 1) seen :3
[2023-03-15 11:29:20] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:29:20] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 11:29:20] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 11:29:20] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 11:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:21] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2023-03-15 11:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:21] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-15 11:29:21] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-15 11:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:21] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-15 11:29:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:29:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2808 ms returned sat
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 335 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 333 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:29:26] [INFO ] Deduced a trap composed of 336 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:29:26] [INFO ] Deduced a trap composed of 305 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:29:27] [INFO ] Deduced a trap composed of 333 places in 351 ms of which 0 ms to minimize.
[2023-03-15 11:29:27] [INFO ] Deduced a trap composed of 320 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 329 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 326 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 357 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:29:29] [INFO ] Deduced a trap composed of 338 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:29:29] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:29:30] [INFO ] Deduced a trap composed of 333 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:29:30] [INFO ] Deduced a trap composed of 332 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:29:30] [INFO ] Deduced a trap composed of 323 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 333 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 0 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 317 places in 387 ms of which 0 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 318 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 0 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 332 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Deduced a trap composed of 332 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Deduced a trap composed of 343 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:29:37] [INFO ] Deduced a trap composed of 335 places in 332 ms of which 3 ms to minimize.
[2023-03-15 11:29:37] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:29:38] [INFO ] Deduced a trap composed of 322 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:29:38] [INFO ] Deduced a trap composed of 339 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:29:39] [INFO ] Deduced a trap composed of 330 places in 339 ms of which 2 ms to minimize.
[2023-03-15 11:29:39] [INFO ] Deduced a trap composed of 323 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:29:40] [INFO ] Deduced a trap composed of 326 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:29:40] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:29:41] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 326 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 323 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:29:44] [INFO ] Deduced a trap composed of 339 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:29:44] [INFO ] Deduced a trap composed of 311 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:29:46] [INFO ] Deduced a trap composed of 332 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:29:46] [INFO ] Deduced a trap composed of 329 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:29:47] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:29:47] [INFO ] Deduced a trap composed of 323 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:29:48] [INFO ] Deduced a trap composed of 329 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:29:48] [INFO ] Deduced a trap composed of 329 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:29:49] [INFO ] Deduced a trap composed of 338 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:29:51] [INFO ] Deduced a trap composed of 305 places in 334 ms of which 0 ms to minimize.
[2023-03-15 11:29:51] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:29:52] [INFO ] Deduced a trap composed of 320 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:29:52] [INFO ] Deduced a trap composed of 317 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 342 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 336 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:29:56] [INFO ] Deduced a trap composed of 309 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:29:58] [INFO ] Deduced a trap composed of 335 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:29:58] [INFO ] Deduced a trap composed of 354 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:29:58] [INFO ] Deduced a trap composed of 323 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:30:01] [INFO ] Deduced a trap composed of 345 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:30:01] [INFO ] Deduced a trap composed of 332 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:30:02] [INFO ] Deduced a trap composed of 335 places in 354 ms of which 0 ms to minimize.
[2023-03-15 11:30:02] [INFO ] Deduced a trap composed of 329 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:30:03] [INFO ] Deduced a trap composed of 315 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:30:04] [INFO ] Deduced a trap composed of 314 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:30:05] [INFO ] Deduced a trap composed of 321 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:30:05] [INFO ] Deduced a trap composed of 323 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:30:06] [INFO ] Deduced a trap composed of 311 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:30:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 41 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 11:30:06] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:30:06] [INFO ] Computed 177 place invariants in 25 ms
[2023-03-15 11:30:08] [INFO ] Implicit Places using invariants in 2373 ms returned []
[2023-03-15 11:30:08] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:30:08] [INFO ] Computed 177 place invariants in 43 ms
[2023-03-15 11:30:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:30:44] [INFO ] Performed 605/1011 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2023-03-15 11:31:01] [INFO ] Implicit Places using invariants and state equation in 52541 ms returned []
Implicit Place search using SMT with State Equation took 54915 ms to find 0 implicit places.
[2023-03-15 11:31:01] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 11:31:01] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:01] [INFO ] Computed 177 place invariants in 38 ms
[2023-03-15 11:31:03] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07 in 121574 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:03] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-15 11:31:03] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:03] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 11:31:03] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 11:31:03] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 11:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:04] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2023-03-15 11:31:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:31:04] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-15 11:31:04] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 45 ms returned sat
[2023-03-15 11:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:05] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2023-03-15 11:31:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:31:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2745 ms returned sat
[2023-03-15 11:31:08] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:31:08] [INFO ] Deduced a trap composed of 335 places in 327 ms of which 1 ms to minimize.
[2023-03-15 11:31:09] [INFO ] Deduced a trap composed of 333 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:31:09] [INFO ] Deduced a trap composed of 336 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:31: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 11:31:09] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:09] [INFO ] Computed 177 place invariants in 27 ms
[2023-03-15 11:31:11] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:11] [INFO ] Computed 177 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 47366 resets, run finished after 7928 ms. (steps per millisecond=126 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2606 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 1) seen :3
[2023-03-15 11:31:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:31:21] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-15 11:31:21] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-15 11:31:21] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 11:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:22] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2023-03-15 11:31:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:31:22] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 11:31:22] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-15 11:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:23] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2023-03-15 11:31:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:31:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2770 ms returned sat
[2023-03-15 11:31:26] [INFO ] Deduced a trap composed of 332 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:31:26] [INFO ] Deduced a trap composed of 335 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:31:27] [INFO ] Deduced a trap composed of 333 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:31:27] [INFO ] Deduced a trap composed of 336 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:31:28] [INFO ] Deduced a trap composed of 305 places in 373 ms of which 1 ms to minimize.
[2023-03-15 11:31:28] [INFO ] Deduced a trap composed of 333 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:31:29] [INFO ] Deduced a trap composed of 320 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:31:29] [INFO ] Deduced a trap composed of 329 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:31:29] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:31:30] [INFO ] Deduced a trap composed of 357 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:31:30] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:31:31] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:31:31] [INFO ] Deduced a trap composed of 333 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:31:31] [INFO ] Deduced a trap composed of 332 places in 328 ms of which 0 ms to minimize.
[2023-03-15 11:31:32] [INFO ] Deduced a trap composed of 323 places in 334 ms of which 0 ms to minimize.
[2023-03-15 11:31:33] [INFO ] Deduced a trap composed of 308 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:31:33] [INFO ] Deduced a trap composed of 333 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:31:33] [INFO ] Deduced a trap composed of 308 places in 344 ms of which 0 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 317 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 318 places in 363 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:31:37] [INFO ] Deduced a trap composed of 332 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:31:38] [INFO ] Deduced a trap composed of 343 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:31:38] [INFO ] Deduced a trap composed of 335 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Deduced a trap composed of 302 places in 359 ms of which 0 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Deduced a trap composed of 322 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Deduced a trap composed of 339 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:31:40] [INFO ] Deduced a trap composed of 330 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:31:40] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 320 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 320 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:31:43] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 323 places in 371 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 0 ms to minimize.
[2023-03-15 11:31:45] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:31:45] [INFO ] Deduced a trap composed of 339 places in 368 ms of which 1 ms to minimize.
[2023-03-15 11:31:46] [INFO ] Deduced a trap composed of 311 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:31:46] [INFO ] Deduced a trap composed of 317 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:31:47] [INFO ] Deduced a trap composed of 320 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:31:47] [INFO ] Deduced a trap composed of 332 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 329 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 317 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:31:49] [INFO ] Deduced a trap composed of 323 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:31:49] [INFO ] Deduced a trap composed of 329 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:31:50] [INFO ] Deduced a trap composed of 329 places in 354 ms of which 0 ms to minimize.
[2023-03-15 11:31:51] [INFO ] Deduced a trap composed of 338 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 305 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 317 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 342 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:31:55] [INFO ] Deduced a trap composed of 336 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:31:57] [INFO ] Deduced a trap composed of 309 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:31:59] [INFO ] Deduced a trap composed of 335 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:32:00] [INFO ] Deduced a trap composed of 354 places in 329 ms of which 0 ms to minimize.
[2023-03-15 11:32:00] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:32:03] [INFO ] Deduced a trap composed of 345 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:32:03] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:32:03] [INFO ] Deduced a trap composed of 335 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:32:04] [INFO ] Deduced a trap composed of 329 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:32:04] [INFO ] Deduced a trap composed of 315 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:32:06] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:32:06] [INFO ] Deduced a trap composed of 321 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:32:07] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:32:07] [INFO ] Trap strengthening (SAT) tested/added 66/66 trap constraints in 41365 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 40 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 39 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-15 11:32:07] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:32:07] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 11:32:09] [INFO ] Implicit Places using invariants in 2328 ms returned []
[2023-03-15 11:32:09] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:32:09] [INFO ] Computed 177 place invariants in 25 ms
[2023-03-15 11:32:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:32:40] [INFO ] Performed 497/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:32:55] [INFO ] Implicit Places using invariants and state equation in 45393 ms returned []
Implicit Place search using SMT with State Equation took 47723 ms to find 0 implicit places.
[2023-03-15 11:32:55] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-15 11:32:55] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 11:32:55] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-15 11:32:57] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09 in 113919 ms.
[2023-03-15 11:32:57] [INFO ] Flatten gal took : 175 ms
[2023-03-15 11:32:57] [INFO ] Applying decomposition
[2023-03-15 11:32:57] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1911046865500304118.txt' '-o' '/tmp/graph1911046865500304118.bin' '-w' '/tmp/graph1911046865500304118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1911046865500304118.bin' '-l' '-1' '-v' '-w' '/tmp/graph1911046865500304118.weights' '-q' '0' '-e' '0.001'
[2023-03-15 11:32:58] [INFO ] Decomposing Gal with order
[2023-03-15 11:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:32:58] [INFO ] Removed a total of 1454 redundant transitions.
[2023-03-15 11:32:58] [INFO ] Flatten gal took : 558 ms
[2023-03-15 11:32:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 745 labels/synchronizations in 78 ms.
[2023-03-15 11:32:58] [INFO ] Time to serialize gal into /tmp/UpperBounds12750438609924834064.gal : 19 ms
[2023-03-15 11:32:58] [INFO ] Time to serialize properties into /tmp/UpperBounds7226335891066167236.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12750438609924834064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7226335891066167236.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds7226335891066167236.prop.
Detected timeout of ITS tools.
[2023-03-15 11:56:48] [INFO ] Flatten gal took : 641 ms
[2023-03-15 11:56:48] [INFO ] Time to serialize gal into /tmp/UpperBounds13951267046975836423.gal : 46 ms
[2023-03-15 11:56:48] [INFO ] Time to serialize properties into /tmp/UpperBounds12291355127760357463.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13951267046975836423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12291355127760357463.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds12291355127760357463.prop.
Detected timeout of ITS tools.
[2023-03-15 12:20:57] [INFO ] Flatten gal took : 545 ms
[2023-03-15 12:20:59] [INFO ] Input system was already deterministic with 1427 transitions.
[2023-03-15 12:20:59] [INFO ] Transformed 1011 places.
[2023-03-15 12:20:59] [INFO ] Transformed 1427 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 12:21:29] [INFO ] Time to serialize gal into /tmp/UpperBounds17724638185800585572.gal : 16 ms
[2023-03-15 12:21:29] [INFO ] Time to serialize properties into /tmp/UpperBounds6373851799278612576.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17724638185800585572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6373851799278612576.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6373851799278612576.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-PT-S05J80, 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 r319-tall-167873970000094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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