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.r293-tall-167873945800749.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 itstools
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 r293-tall-167873945800749
=====================================================================

--------------------
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 1678960366607

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 09:52:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 09:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 09:52:48] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-16 09:52:48] [INFO ] Transformed 1189 places.
[2023-03-16 09:52:48] [INFO ] Transformed 2350 transitions.
[2023-03-16 09:52:48] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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-16 09:52:48] [INFO ] Computed 182 place invariants in 161 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 656 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :37
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 68 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :25
[2023-03-16 09:52:48] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-16 09:52:49] [INFO ] Computed 182 place invariants in 112 ms
[2023-03-16 09:52:50] [INFO ] [Real]Absence check using 157 positive place invariants in 64 ms returned sat
[2023-03-16 09:52:50] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 31 ms returned unsat
[2023-03-16 09:52:50] [INFO ] [Real]Absence check using 157 positive place invariants in 42 ms returned sat
[2023-03-16 09:52:50] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-16 09:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:52:51] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2023-03-16 09:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:52:52] [INFO ] [Nat]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-16 09:52:52] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-16 09:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:52:52] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2023-03-16 09:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:52:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 09:52:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 3878 ms returned unknown
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 38 ms returned unsat
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive place invariants in 46 ms returned sat
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 27 ms returned unsat
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-16 09:52:57] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-16 09:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:52:58] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2023-03-16 09:52:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:52:58] [INFO ] [Nat]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-16 09:52:58] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-16 09:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:52:59] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2023-03-16 09:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 125 ms returned sat
[2023-03-16 09:53:00] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 156 ms.
[2023-03-16 09:53:00] [INFO ] Added : 17 causal constraints over 4 iterations in 990 ms. Result :sat
Minimization took 515 ms.
[2023-03-16 09:53:01] [INFO ] [Real]Absence check using 157 positive place invariants in 48 ms returned sat
[2023-03-16 09:53:01] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 41 ms returned unsat
[2023-03-16 09:53:01] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-16 09:53:01] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-16 09:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:03] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2023-03-16 09:53:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:53:03] [INFO ] [Nat]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-16 09:53:03] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-16 09:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:04] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2023-03-16 09:53:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2023-03-16 09:53:04] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 91 ms.
[2023-03-16 09:53:05] [INFO ] Added : 17 causal constraints over 4 iterations in 922 ms. Result :sat
Minimization took 519 ms.
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 44 ms returned unsat
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 11 ms returned unsat
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-16 09:53:06] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1, 10, 988, 1, 988, 1, 1, 1] Max seen :[4, 3, 1, 10, 3, 1, 3, 1, 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 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 425 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-16 09:53:06] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-16 09:53:07] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-16 09:53:09] [INFO ] Dead Transitions using invariants and state equation in 2086 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 REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 57 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2570 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:53:09] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 47185 resets, run finished after 8382 ms. (steps per millisecond=119 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2698 resets, run finished after 1663 ms. (steps per millisecond=601 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2682 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2686 resets, run finished after 1689 ms. (steps per millisecond=592 ) properties (out of 3) seen :9
[2023-03-16 09:53:22] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:53:22] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 09:53:22] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-16 09:53:22] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 35 ms returned sat
[2023-03-16 09:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:23] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2023-03-16 09:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:53:24] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-16 09:53:24] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 39 ms returned sat
[2023-03-16 09:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:25] [INFO ] [Nat]Absence check using state equation in 1454 ms returned sat
[2023-03-16 09:53:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:53:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2194 ms returned sat
[2023-03-16 09:53:28] [INFO ] Deduced a trap composed of 344 places in 386 ms of which 9 ms to minimize.
[2023-03-16 09:53:28] [INFO ] Deduced a trap composed of 332 places in 390 ms of which 1 ms to minimize.
[2023-03-16 09:53:29] [INFO ] Deduced a trap composed of 323 places in 375 ms of which 1 ms to minimize.
[2023-03-16 09:53:29] [INFO ] Deduced a trap composed of 327 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:53:29] [INFO ] Deduced a trap composed of 321 places in 339 ms of which 1 ms to minimize.
[2023-03-16 09:53:30] [INFO ] Deduced a trap composed of 336 places in 344 ms of which 1 ms to minimize.
[2023-03-16 09:53:30] [INFO ] Deduced a trap composed of 326 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:53:31] [INFO ] Deduced a trap composed of 324 places in 344 ms of which 1 ms to minimize.
[2023-03-16 09:53:31] [INFO ] Deduced a trap composed of 312 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:53:31] [INFO ] Deduced a trap composed of 321 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:53:32] [INFO ] Deduced a trap composed of 330 places in 369 ms of which 2 ms to minimize.
[2023-03-16 09:53:32] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 1 ms to minimize.
[2023-03-16 09:53:33] [INFO ] Deduced a trap composed of 326 places in 347 ms of which 1 ms to minimize.
[2023-03-16 09:53:33] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 1 ms to minimize.
[2023-03-16 09:53:34] [INFO ] Deduced a trap composed of 309 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:53:34] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-16 09:53:35] [INFO ] Deduced a trap composed of 311 places in 347 ms of which 1 ms to minimize.
[2023-03-16 09:53:35] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-16 09:53:36] [INFO ] Deduced a trap composed of 335 places in 348 ms of which 2 ms to minimize.
[2023-03-16 09:53:36] [INFO ] Deduced a trap composed of 330 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:53:37] [INFO ] Deduced a trap composed of 323 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:53:37] [INFO ] Deduced a trap composed of 314 places in 367 ms of which 2 ms to minimize.
[2023-03-16 09:53:38] [INFO ] Deduced a trap composed of 317 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:53:38] [INFO ] Deduced a trap composed of 335 places in 362 ms of which 0 ms to minimize.
[2023-03-16 09:53:39] [INFO ] Deduced a trap composed of 345 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:53:39] [INFO ] Deduced a trap composed of 329 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:53:40] [INFO ] Deduced a trap composed of 320 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:53:40] [INFO ] Deduced a trap composed of 320 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:53:41] [INFO ] Deduced a trap composed of 336 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:53:42] [INFO ] Deduced a trap composed of 305 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:53:42] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:53:43] [INFO ] Deduced a trap composed of 315 places in 391 ms of which 1 ms to minimize.
[2023-03-16 09:53:44] [INFO ] Deduced a trap composed of 335 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:53:44] [INFO ] Deduced a trap composed of 356 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:53:45] [INFO ] Deduced a trap composed of 311 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:53:45] [INFO ] Deduced a trap composed of 323 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:53:46] [INFO ] Deduced a trap composed of 335 places in 355 ms of which 0 ms to minimize.
[2023-03-16 09:53:46] [INFO ] Deduced a trap composed of 335 places in 356 ms of which 1 ms to minimize.
[2023-03-16 09:53:47] [INFO ] Deduced a trap composed of 320 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:53:48] [INFO ] Deduced a trap composed of 312 places in 362 ms of which 0 ms to minimize.
[2023-03-16 09:53:49] [INFO ] Deduced a trap composed of 308 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:53:50] [INFO ] Deduced a trap composed of 317 places in 345 ms of which 0 ms to minimize.
[2023-03-16 09:53:50] [INFO ] Deduced a trap composed of 306 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:53:51] [INFO ] Deduced a trap composed of 315 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:53:53] [INFO ] Deduced a trap composed of 345 places in 354 ms of which 1 ms to minimize.
[2023-03-16 09:53:54] [INFO ] Deduced a trap composed of 303 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:53:57] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 29409 ms
[2023-03-16 09:53:57] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-16 09:53:57] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-16 09:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:58] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2023-03-16 09:53:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:53:58] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-16 09:53:58] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-16 09:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:53:59] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2023-03-16 09:54:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 728 ms returned sat
[2023-03-16 09:54:00] [INFO ] Deduced a trap composed of 201 places in 408 ms of which 0 ms to minimize.
[2023-03-16 09:54:01] [INFO ] Deduced a trap composed of 320 places in 363 ms of which 1 ms to minimize.
[2023-03-16 09:54:01] [INFO ] Deduced a trap composed of 332 places in 395 ms of which 1 ms to minimize.
[2023-03-16 09:54:01] [INFO ] Deduced a trap composed of 291 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:54:02] [INFO ] Deduced a trap composed of 332 places in 381 ms of which 0 ms to minimize.
[2023-03-16 09:54:02] [INFO ] Deduced a trap composed of 376 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:54:03] [INFO ] Deduced a trap composed of 315 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:54:03] [INFO ] Deduced a trap composed of 323 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:54:04] [INFO ] Deduced a trap composed of 303 places in 357 ms of which 0 ms to minimize.
[2023-03-16 09:54:05] [INFO ] Deduced a trap composed of 336 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:54:05] [INFO ] Deduced a trap composed of 350 places in 380 ms of which 9 ms to minimize.
[2023-03-16 09:54:05] [INFO ] Deduced a trap composed of 314 places in 386 ms of which 0 ms to minimize.
[2023-03-16 09:54:06] [INFO ] Deduced a trap composed of 330 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:54:08] [INFO ] Deduced a trap composed of 396 places in 347 ms of which 1 ms to minimize.
[2023-03-16 09:54:08] [INFO ] Deduced a trap composed of 324 places in 352 ms of which 0 ms to minimize.
[2023-03-16 09:54:08] [INFO ] Deduced a trap composed of 329 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:54:09] [INFO ] Deduced a trap composed of 308 places in 431 ms of which 1 ms to minimize.
[2023-03-16 09:54:09] [INFO ] Deduced a trap composed of 308 places in 391 ms of which 1 ms to minimize.
[2023-03-16 09:54:10] [INFO ] Deduced a trap composed of 336 places in 370 ms of which 3 ms to minimize.
[2023-03-16 09:54:10] [INFO ] Deduced a trap composed of 312 places in 366 ms of which 4 ms to minimize.
[2023-03-16 09:54:11] [INFO ] Deduced a trap composed of 293 places in 361 ms of which 2 ms to minimize.
[2023-03-16 09:54:12] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 11 ms to minimize.
[2023-03-16 09:54:12] [INFO ] Deduced a trap composed of 338 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:54:13] [INFO ] Deduced a trap composed of 332 places in 339 ms of which 1 ms to minimize.
[2023-03-16 09:54:13] [INFO ] Deduced a trap composed of 308 places in 342 ms of which 1 ms to minimize.
[2023-03-16 09:54:14] [INFO ] Deduced a trap composed of 321 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:54:14] [INFO ] Deduced a trap composed of 326 places in 386 ms of which 1 ms to minimize.
[2023-03-16 09:54:14] [INFO ] Deduced a trap composed of 326 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:54:15] [INFO ] Deduced a trap composed of 308 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:54:16] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:54:16] [INFO ] Deduced a trap composed of 327 places in 348 ms of which 0 ms to minimize.
[2023-03-16 09:54:17] [INFO ] Deduced a trap composed of 305 places in 327 ms of which 1 ms to minimize.
[2023-03-16 09:54:17] [INFO ] Deduced a trap composed of 294 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:54:18] [INFO ] Deduced a trap composed of 299 places in 341 ms of which 1 ms to minimize.
[2023-03-16 09:54:18] [INFO ] Deduced a trap composed of 324 places in 356 ms of which 1 ms to minimize.
[2023-03-16 09:54:18] [INFO ] Deduced a trap composed of 335 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:54:19] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:54:20] [INFO ] Deduced a trap composed of 335 places in 360 ms of which 0 ms to minimize.
[2023-03-16 09:54:22] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 1 ms to minimize.
[2023-03-16 09:54:22] [INFO ] Deduced a trap composed of 330 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:54:23] [INFO ] Deduced a trap composed of 335 places in 341 ms of which 1 ms to minimize.
[2023-03-16 09:54:23] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 1 ms to minimize.
[2023-03-16 09:54:24] [INFO ] Deduced a trap composed of 314 places in 331 ms of which 1 ms to minimize.
[2023-03-16 09:54:24] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 0 ms to minimize.
[2023-03-16 09:54:25] [INFO ] Deduced a trap composed of 321 places in 366 ms of which 0 ms to minimize.
[2023-03-16 09:54:28] [INFO ] Deduced a trap composed of 339 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:54:30] [INFO ] Deduced a trap composed of 321 places in 445 ms of which 1 ms to minimize.
[2023-03-16 09:54:33] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:54:34] [INFO ] Deduced a trap composed of 323 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:54:34] [INFO ] Deduced a trap composed of 314 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:54:34] [INFO ] Deduced a trap composed of 332 places in 354 ms of which 1 ms to minimize.
[2023-03-16 09:54:35] [INFO ] Deduced a trap composed of 317 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:54:37] [INFO ] Deduced a trap composed of 317 places in 346 ms of which 1 ms to minimize.
[2023-03-16 09:54:38] [INFO ] Deduced a trap composed of 341 places in 346 ms of which 1 ms to minimize.
[2023-03-16 09:54:39] [INFO ] Deduced a trap composed of 338 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:54:39] [INFO ] Deduced a trap composed of 311 places in 356 ms of which 0 ms to minimize.
[2023-03-16 09:54:40] [INFO ] Deduced a trap composed of 320 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:54:40] [INFO ] Deduced a trap composed of 311 places in 338 ms of which 1 ms to minimize.
[2023-03-16 09:54:41] [INFO ] Deduced a trap composed of 323 places in 354 ms of which 0 ms to minimize.
[2023-03-16 09:54:42] [INFO ] Deduced a trap composed of 342 places in 348 ms of which 1 ms to minimize.
[2023-03-16 09:54:43] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43257 ms
[2023-03-16 09:54:43] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-16 09:54:43] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-16 09:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:54:44] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-16 09:54:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:54:44] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-16 09:54:44] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 36 ms returned sat
[2023-03-16 09:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:54:45] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2023-03-16 09:54:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 704 ms returned sat
[2023-03-16 09:54:47] [INFO ] Deduced a trap composed of 201 places in 404 ms of which 1 ms to minimize.
[2023-03-16 09:54:47] [INFO ] Deduced a trap composed of 320 places in 399 ms of which 1 ms to minimize.
[2023-03-16 09:54:47] [INFO ] Deduced a trap composed of 332 places in 410 ms of which 1 ms to minimize.
[2023-03-16 09:54:48] [INFO ] Deduced a trap composed of 291 places in 392 ms of which 1 ms to minimize.
[2023-03-16 09:54:48] [INFO ] Deduced a trap composed of 332 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:54:49] [INFO ] Deduced a trap composed of 376 places in 386 ms of which 1 ms to minimize.
[2023-03-16 09:54:49] [INFO ] Deduced a trap composed of 315 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:54:50] [INFO ] Deduced a trap composed of 323 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:54:50] [INFO ] Deduced a trap composed of 303 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:54:51] [INFO ] Deduced a trap composed of 336 places in 352 ms of which 1 ms to minimize.
[2023-03-16 09:54:51] [INFO ] Deduced a trap composed of 350 places in 402 ms of which 1 ms to minimize.
[2023-03-16 09:54:52] [INFO ] Deduced a trap composed of 314 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:54:52] [INFO ] Deduced a trap composed of 330 places in 368 ms of which 1 ms to minimize.
[2023-03-16 09:54:54] [INFO ] Deduced a trap composed of 396 places in 379 ms of which 0 ms to minimize.
[2023-03-16 09:54:54] [INFO ] Deduced a trap composed of 324 places in 357 ms of which 0 ms to minimize.
[2023-03-16 09:54:55] [INFO ] Deduced a trap composed of 329 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:54:55] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:54:56] [INFO ] Deduced a trap composed of 308 places in 357 ms of which 0 ms to minimize.
[2023-03-16 09:54:56] [INFO ] Deduced a trap composed of 336 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:54:57] [INFO ] Deduced a trap composed of 312 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:54:58] [INFO ] Deduced a trap composed of 293 places in 388 ms of which 1 ms to minimize.
[2023-03-16 09:54:58] [INFO ] Deduced a trap composed of 332 places in 366 ms of which 0 ms to minimize.
[2023-03-16 09:54:59] [INFO ] Deduced a trap composed of 338 places in 357 ms of which 1 ms to minimize.
[2023-03-16 09:54:59] [INFO ] Deduced a trap composed of 332 places in 395 ms of which 1 ms to minimize.
[2023-03-16 09:55:00] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 0 ms to minimize.
[2023-03-16 09:55:00] [INFO ] Deduced a trap composed of 321 places in 365 ms of which 0 ms to minimize.
[2023-03-16 09:55:00] [INFO ] Deduced a trap composed of 326 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:55:01] [INFO ] Deduced a trap composed of 326 places in 365 ms of which 0 ms to minimize.
[2023-03-16 09:55:01] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:55:02] [INFO ] Deduced a trap composed of 314 places in 324 ms of which 1 ms to minimize.
[2023-03-16 09:55:02] [INFO ] Deduced a trap composed of 327 places in 348 ms of which 0 ms to minimize.
[2023-03-16 09:55:03] [INFO ] Deduced a trap composed of 305 places in 327 ms of which 1 ms to minimize.
[2023-03-16 09:55:04] [INFO ] Deduced a trap composed of 294 places in 354 ms of which 1 ms to minimize.
[2023-03-16 09:55:04] [INFO ] Deduced a trap composed of 299 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:55:04] [INFO ] Deduced a trap composed of 324 places in 337 ms of which 1 ms to minimize.
[2023-03-16 09:55:05] [INFO ] Deduced a trap composed of 335 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:55:05] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 2 ms to minimize.
[2023-03-16 09:55:07] [INFO ] Deduced a trap composed of 335 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:55:08] [INFO ] Deduced a trap composed of 332 places in 362 ms of which 0 ms to minimize.
[2023-03-16 09:55:09] [INFO ] Deduced a trap composed of 330 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:55:09] [INFO ] Deduced a trap composed of 335 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:55:10] [INFO ] Deduced a trap composed of 323 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:55:10] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2023-03-16 09:55:11] [INFO ] Deduced a trap composed of 314 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:55:12] [INFO ] Deduced a trap composed of 321 places in 353 ms of which 0 ms to minimize.
[2023-03-16 09:55:14] [INFO ] Deduced a trap composed of 339 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:55:17] [INFO ] Deduced a trap composed of 321 places in 344 ms of which 0 ms to minimize.
[2023-03-16 09:55:20] [INFO ] Deduced a trap composed of 314 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:55:20] [INFO ] Deduced a trap composed of 323 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:55:20] [INFO ] Deduced a trap composed of 314 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:55:21] [INFO ] Deduced a trap composed of 332 places in 381 ms of which 0 ms to minimize.
[2023-03-16 09:55:22] [INFO ] Deduced a trap composed of 317 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:55:24] [INFO ] Deduced a trap composed of 317 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:55:25] [INFO ] Deduced a trap composed of 341 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:55:25] [INFO ] Deduced a trap composed of 338 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:55:26] [INFO ] Deduced a trap composed of 311 places in 385 ms of which 1 ms to minimize.
[2023-03-16 09:55:26] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:55:27] [INFO ] Deduced a trap composed of 311 places in 371 ms of which 2 ms to minimize.
[2023-03-16 09:55:28] [INFO ] Deduced a trap composed of 323 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:55:28] [INFO ] Deduced a trap composed of 342 places in 338 ms of which 1 ms to minimize.
[2023-03-16 09:55:29] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43169 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 REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 85 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 97 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 09:55:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:55:29] [INFO ] Invariant cache hit.
[2023-03-16 09:55:32] [INFO ] Implicit Places using invariants in 2445 ms returned []
[2023-03-16 09:55:32] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:55:32] [INFO ] Invariant cache hit.
[2023-03-16 09:55:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:55:58] [INFO ] Implicit Places using invariants and state equation in 25624 ms returned []
Implicit Place search using SMT with State Equation took 28077 ms to find 0 implicit places.
[2023-03-16 09:55:58] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-16 09:55:58] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:55:58] [INFO ] Invariant cache hit.
[2023-03-16 09:56:00] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30254 ms. 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-16 09:56:00] [INFO ] Computed 177 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 493 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 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-16 09:56:00] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:56:00] [INFO ] Computed 177 place invariants in 46 ms
[2023-03-16 09:56:00] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-16 09:56:00] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-16 09:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:01] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2023-03-16 09:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:56:01] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-16 09:56:01] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-16 09:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:03] [INFO ] [Nat]Absence check using state equation in 1464 ms returned sat
[2023-03-16 09:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:56:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2256 ms returned sat
[2023-03-16 09:56:05] [INFO ] Deduced a trap composed of 344 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:56:06] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:56:06] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 0 ms to minimize.
[2023-03-16 09:56: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 REACHABILITY 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 59 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-16 09:56:06] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 09:56:06] [INFO ] Computed 177 place invariants in 37 ms
[2023-03-16 09:56:08] [INFO ] Dead Transitions using invariants and state equation in 2044 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2105 ms. 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-16 09:56:08] [INFO ] Computed 177 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 52300 resets, run finished after 9095 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2749 resets, run finished after 1718 ms. (steps per millisecond=582 ) properties (out of 1) seen :3
[2023-03-16 09:56:19] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 09:56:19] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 09:56:19] [INFO ] [Real]Absence check using 155 positive place invariants in 32 ms returned sat
[2023-03-16 09:56:20] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 35 ms returned sat
[2023-03-16 09:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:21] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2023-03-16 09:56:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:56:21] [INFO ] [Nat]Absence check using 155 positive place invariants in 33 ms returned sat
[2023-03-16 09:56:21] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-16 09:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:22] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2023-03-16 09:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:56:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 09:56:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 4280 ms returned sat
[2023-03-16 09:56:27] [INFO ] Deduced a trap composed of 327 places in 345 ms of which 0 ms to minimize.
[2023-03-16 09:56:27] [INFO ] Deduced a trap composed of 339 places in 373 ms of which 1 ms to minimize.
[2023-03-16 09:56:28] [INFO ] Deduced a trap composed of 314 places in 356 ms of which 1 ms to minimize.
[2023-03-16 09:56:28] [INFO ] Deduced a trap composed of 320 places in 348 ms of which 1 ms to minimize.
[2023-03-16 09:56:28] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:56:29] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:56:29] [INFO ] Deduced a trap composed of 320 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:56:30] [INFO ] Deduced a trap composed of 317 places in 333 ms of which 1 ms to minimize.
[2023-03-16 09:56:30] [INFO ] Deduced a trap composed of 317 places in 338 ms of which 1 ms to minimize.
[2023-03-16 09:56:31] [INFO ] Deduced a trap composed of 302 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:56:31] [INFO ] Deduced a trap composed of 332 places in 338 ms of which 1 ms to minimize.
[2023-03-16 09:56:32] [INFO ] Deduced a trap composed of 327 places in 341 ms of which 1 ms to minimize.
[2023-03-16 09:56:32] [INFO ] Deduced a trap composed of 321 places in 346 ms of which 1 ms to minimize.
[2023-03-16 09:56:33] [INFO ] Deduced a trap composed of 330 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:56:33] [INFO ] Deduced a trap composed of 309 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:56:34] [INFO ] Deduced a trap composed of 332 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:56:34] [INFO ] Deduced a trap composed of 341 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:56:34] [INFO ] Deduced a trap composed of 305 places in 334 ms of which 1 ms to minimize.
[2023-03-16 09:56:35] [INFO ] Deduced a trap composed of 323 places in 349 ms of which 0 ms to minimize.
[2023-03-16 09:56:36] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 0 ms to minimize.
[2023-03-16 09:56:37] [INFO ] Deduced a trap composed of 317 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:56:37] [INFO ] Deduced a trap composed of 335 places in 348 ms of which 1 ms to minimize.
[2023-03-16 09:56:38] [INFO ] Deduced a trap composed of 300 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:56:39] [INFO ] Deduced a trap composed of 327 places in 351 ms of which 0 ms to minimize.
[2023-03-16 09:56:40] [INFO ] Deduced a trap composed of 327 places in 347 ms of which 1 ms to minimize.
[2023-03-16 09:56:43] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 16341 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 REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-16 09:56:43] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 09:56:43] [INFO ] Invariant cache hit.
[2023-03-16 09:56:45] [INFO ] Implicit Places using invariants in 2421 ms returned []
[2023-03-16 09:56:45] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 09:56:45] [INFO ] Invariant cache hit.
[2023-03-16 09:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:57:11] [INFO ] Implicit Places using invariants and state equation in 26019 ms returned []
Implicit Place search using SMT with State Equation took 28446 ms to find 0 implicit places.
[2023-03-16 09:57:11] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-16 09:57:11] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 09:57:11] [INFO ] Invariant cache hit.
[2023-03-16 09:57:13] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30537 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01 in 73576 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-16 09:57:13] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 474 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2023-03-16 09:57:13] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:57:13] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 09:57:14] [INFO ] [Real]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-16 09:57:14] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-16 09:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:57:15] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2023-03-16 09:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:57:15] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-16 09:57:15] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 45 ms returned sat
[2023-03-16 09:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:57:16] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-16 09:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:57:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 720 ms returned sat
[2023-03-16 09:57:17] [INFO ] Deduced a trap composed of 201 places in 406 ms of which 1 ms to minimize.
[2023-03-16 09:57:17] [INFO ] Deduced a trap composed of 320 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:57:18] [INFO ] Deduced a trap composed of 332 places in 392 ms of which 1 ms to minimize.
[2023-03-16 09:57:18] [INFO ] Deduced a trap composed of 291 places in 376 ms of which 0 ms to minimize.
[2023-03-16 09:57:19] [INFO ] Deduced a trap composed of 332 places in 385 ms of which 1 ms to minimize.
[2023-03-16 09:57:19] [INFO ] Deduced a trap composed of 376 places in 402 ms of which 1 ms to minimize.
[2023-03-16 09:57:20] [INFO ] Deduced a trap composed of 315 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:57:20] [INFO ] Deduced a trap composed of 323 places in 384 ms of which 1 ms to minimize.
[2023-03-16 09:57:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 09:57:20] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:57:20] [INFO ] Invariant cache hit.
[2023-03-16 09:57:22] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. 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-16 09:57:22] [INFO ] Computed 177 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 47469 resets, run finished after 8167 ms. (steps per millisecond=122 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2709 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 1) seen :3
[2023-03-16 09:57:32] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:57:32] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-16 09:57:32] [INFO ] [Real]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-16 09:57:32] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 35 ms returned sat
[2023-03-16 09:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:57:33] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-16 09:57:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:57:33] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-16 09:57:33] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-16 09:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:57:34] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-16 09:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:57:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 744 ms returned sat
[2023-03-16 09:57:35] [INFO ] Deduced a trap composed of 201 places in 400 ms of which 1 ms to minimize.
[2023-03-16 09:57:36] [INFO ] Deduced a trap composed of 320 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:57:36] [INFO ] Deduced a trap composed of 332 places in 386 ms of which 1 ms to minimize.
[2023-03-16 09:57:37] [INFO ] Deduced a trap composed of 291 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:57:37] [INFO ] Deduced a trap composed of 332 places in 389 ms of which 1 ms to minimize.
[2023-03-16 09:57:38] [INFO ] Deduced a trap composed of 376 places in 402 ms of which 1 ms to minimize.
[2023-03-16 09:57:38] [INFO ] Deduced a trap composed of 315 places in 390 ms of which 3 ms to minimize.
[2023-03-16 09:57:39] [INFO ] Deduced a trap composed of 323 places in 386 ms of which 1 ms to minimize.
[2023-03-16 09:57:39] [INFO ] Deduced a trap composed of 303 places in 396 ms of which 1 ms to minimize.
[2023-03-16 09:57:40] [INFO ] Deduced a trap composed of 336 places in 348 ms of which 1 ms to minimize.
[2023-03-16 09:57:40] [INFO ] Deduced a trap composed of 350 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:57:41] [INFO ] Deduced a trap composed of 314 places in 394 ms of which 1 ms to minimize.
[2023-03-16 09:57:41] [INFO ] Deduced a trap composed of 330 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:57:43] [INFO ] Deduced a trap composed of 396 places in 348 ms of which 0 ms to minimize.
[2023-03-16 09:57:43] [INFO ] Deduced a trap composed of 324 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:57:44] [INFO ] Deduced a trap composed of 329 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:57:44] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 0 ms to minimize.
[2023-03-16 09:57:45] [INFO ] Deduced a trap composed of 308 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:57:45] [INFO ] Deduced a trap composed of 336 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:57:46] [INFO ] Deduced a trap composed of 312 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:57:47] [INFO ] Deduced a trap composed of 293 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:57:47] [INFO ] Deduced a trap composed of 332 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:57:48] [INFO ] Deduced a trap composed of 338 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:57:48] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-16 09:57:49] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 1 ms to minimize.
[2023-03-16 09:57:49] [INFO ] Deduced a trap composed of 321 places in 350 ms of which 1 ms to minimize.
[2023-03-16 09:57:49] [INFO ] Deduced a trap composed of 326 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:57:50] [INFO ] Deduced a trap composed of 326 places in 351 ms of which 1 ms to minimize.
[2023-03-16 09:57:50] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:57:51] [INFO ] Deduced a trap composed of 314 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:57:51] [INFO ] Deduced a trap composed of 327 places in 352 ms of which 1 ms to minimize.
[2023-03-16 09:57:52] [INFO ] Deduced a trap composed of 305 places in 320 ms of which 1 ms to minimize.
[2023-03-16 09:57:52] [INFO ] Deduced a trap composed of 294 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:57:53] [INFO ] Deduced a trap composed of 299 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:57:53] [INFO ] Deduced a trap composed of 324 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:57:54] [INFO ] Deduced a trap composed of 335 places in 360 ms of which 0 ms to minimize.
[2023-03-16 09:57:54] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:57:56] [INFO ] Deduced a trap composed of 335 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:57:57] [INFO ] Deduced a trap composed of 332 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:57:58] [INFO ] Deduced a trap composed of 330 places in 368 ms of which 1 ms to minimize.
[2023-03-16 09:57:58] [INFO ] Deduced a trap composed of 335 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:57:59] [INFO ] Deduced a trap composed of 323 places in 352 ms of which 1 ms to minimize.
[2023-03-16 09:57:59] [INFO ] Deduced a trap composed of 314 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:58:00] [INFO ] Deduced a trap composed of 314 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:58:01] [INFO ] Deduced a trap composed of 321 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:58:03] [INFO ] Deduced a trap composed of 339 places in 361 ms of which 0 ms to minimize.
[2023-03-16 09:58:06] [INFO ] Deduced a trap composed of 321 places in 353 ms of which 3 ms to minimize.
[2023-03-16 09:58:09] [INFO ] Deduced a trap composed of 314 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:58:09] [INFO ] Deduced a trap composed of 323 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:58:10] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:58:10] [INFO ] Deduced a trap composed of 332 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:58:11] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:58:13] [INFO ] Deduced a trap composed of 317 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:58:14] [INFO ] Deduced a trap composed of 341 places in 363 ms of which 3 ms to minimize.
[2023-03-16 09:58:15] [INFO ] Deduced a trap composed of 338 places in 358 ms of which 0 ms to minimize.
[2023-03-16 09:58:15] [INFO ] Deduced a trap composed of 311 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:58:15] [INFO ] Deduced a trap composed of 320 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:58:16] [INFO ] Deduced a trap composed of 311 places in 353 ms of which 1 ms to minimize.
[2023-03-16 09:58:17] [INFO ] Deduced a trap composed of 323 places in 361 ms of which 0 ms to minimize.
[2023-03-16 09:58:17] [INFO ] Deduced a trap composed of 342 places in 361 ms of which 0 ms to minimize.
[2023-03-16 09:58:18] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43226 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 REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 09:58:18] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:58:18] [INFO ] Invariant cache hit.
[2023-03-16 09:58:21] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2023-03-16 09:58:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:58:21] [INFO ] Invariant cache hit.
[2023-03-16 09:58:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:58:49] [INFO ] Implicit Places using invariants and state equation in 28676 ms returned []
Implicit Place search using SMT with State Equation took 30972 ms to find 0 implicit places.
[2023-03-16 09:58:49] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 09:58:49] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:58:49] [INFO ] Invariant cache hit.
[2023-03-16 09:58:51] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33031 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07 in 98099 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-16 09:58:51] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 476 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-16 09:58:51] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:58:52] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 09:58:52] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-16 09:58:52] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-16 09:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:58:53] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2023-03-16 09:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:58:53] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-16 09:58:53] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 40 ms returned sat
[2023-03-16 09:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:58:54] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2023-03-16 09:58:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:58:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 702 ms returned sat
[2023-03-16 09:58:55] [INFO ] Deduced a trap composed of 201 places in 410 ms of which 1 ms to minimize.
[2023-03-16 09:58:55] [INFO ] Deduced a trap composed of 320 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:58:56] [INFO ] Deduced a trap composed of 332 places in 403 ms of which 1 ms to minimize.
[2023-03-16 09:58:56] [INFO ] Deduced a trap composed of 291 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:58:57] [INFO ] Deduced a trap composed of 332 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:58:57] [INFO ] Deduced a trap composed of 376 places in 396 ms of which 1 ms to minimize.
[2023-03-16 09:58:58] [INFO ] Deduced a trap composed of 315 places in 375 ms of which 1 ms to minimize.
[2023-03-16 09:58:58] [INFO ] Deduced a trap composed of 323 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:58:58] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 REACHABILITY 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-16 09:58:58] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:58:58] [INFO ] Invariant cache hit.
[2023-03-16 09:59:00] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2021 ms. 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-16 09:59:00] [INFO ] Computed 177 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 47417 resets, run finished after 8055 ms. (steps per millisecond=124 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2686 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties (out of 1) seen :3
[2023-03-16 09:59:10] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 09:59:10] [INFO ] Computed 177 place invariants in 38 ms
[2023-03-16 09:59:10] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-16 09:59:10] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-16 09:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:59:11] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2023-03-16 09:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:59:11] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-16 09:59:11] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 36 ms returned sat
[2023-03-16 09:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:59:12] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2023-03-16 09:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:59:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 754 ms returned sat
[2023-03-16 09:59:13] [INFO ] Deduced a trap composed of 201 places in 395 ms of which 1 ms to minimize.
[2023-03-16 09:59:14] [INFO ] Deduced a trap composed of 320 places in 357 ms of which 1 ms to minimize.
[2023-03-16 09:59:14] [INFO ] Deduced a trap composed of 332 places in 372 ms of which 0 ms to minimize.
[2023-03-16 09:59:15] [INFO ] Deduced a trap composed of 291 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:59:15] [INFO ] Deduced a trap composed of 332 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:59:15] [INFO ] Deduced a trap composed of 376 places in 404 ms of which 1 ms to minimize.
[2023-03-16 09:59:16] [INFO ] Deduced a trap composed of 315 places in 373 ms of which 1 ms to minimize.
[2023-03-16 09:59:16] [INFO ] Deduced a trap composed of 323 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:59:17] [INFO ] Deduced a trap composed of 303 places in 384 ms of which 1 ms to minimize.
[2023-03-16 09:59:18] [INFO ] Deduced a trap composed of 336 places in 384 ms of which 1 ms to minimize.
[2023-03-16 09:59:18] [INFO ] Deduced a trap composed of 350 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:59:19] [INFO ] Deduced a trap composed of 314 places in 380 ms of which 1 ms to minimize.
[2023-03-16 09:59:19] [INFO ] Deduced a trap composed of 330 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:59:21] [INFO ] Deduced a trap composed of 396 places in 352 ms of which 1 ms to minimize.
[2023-03-16 09:59:21] [INFO ] Deduced a trap composed of 324 places in 337 ms of which 1 ms to minimize.
[2023-03-16 09:59:22] [INFO ] Deduced a trap composed of 329 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:59:22] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:59:23] [INFO ] Deduced a trap composed of 308 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:59:23] [INFO ] Deduced a trap composed of 336 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:59:24] [INFO ] Deduced a trap composed of 312 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:59:25] [INFO ] Deduced a trap composed of 293 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:59:25] [INFO ] Deduced a trap composed of 332 places in 362 ms of which 0 ms to minimize.
[2023-03-16 09:59:26] [INFO ] Deduced a trap composed of 338 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:59:26] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 1 ms to minimize.
[2023-03-16 09:59:27] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:59:27] [INFO ] Deduced a trap composed of 321 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:59:27] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 0 ms to minimize.
[2023-03-16 09:59:28] [INFO ] Deduced a trap composed of 326 places in 356 ms of which 0 ms to minimize.
[2023-03-16 09:59:28] [INFO ] Deduced a trap composed of 308 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:59:29] [INFO ] Deduced a trap composed of 314 places in 343 ms of which 1 ms to minimize.
[2023-03-16 09:59:29] [INFO ] Deduced a trap composed of 327 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:59:30] [INFO ] Deduced a trap composed of 305 places in 345 ms of which 1 ms to minimize.
[2023-03-16 09:59:31] [INFO ] Deduced a trap composed of 294 places in 373 ms of which 1 ms to minimize.
[2023-03-16 09:59:31] [INFO ] Deduced a trap composed of 299 places in 363 ms of which 1 ms to minimize.
[2023-03-16 09:59:31] [INFO ] Deduced a trap composed of 324 places in 362 ms of which 0 ms to minimize.
[2023-03-16 09:59:32] [INFO ] Deduced a trap composed of 335 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:59:32] [INFO ] Deduced a trap composed of 308 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:59:34] [INFO ] Deduced a trap composed of 335 places in 363 ms of which 1 ms to minimize.
[2023-03-16 09:59:35] [INFO ] Deduced a trap composed of 332 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:59:36] [INFO ] Deduced a trap composed of 330 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:59:36] [INFO ] Deduced a trap composed of 335 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:59:37] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 0 ms to minimize.
[2023-03-16 09:59:37] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-16 09:59:38] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:59:39] [INFO ] Deduced a trap composed of 321 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:59:41] [INFO ] Deduced a trap composed of 339 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:59:44] [INFO ] Deduced a trap composed of 321 places in 361 ms of which 1 ms to minimize.
[2023-03-16 09:59:47] [INFO ] Deduced a trap composed of 314 places in 335 ms of which 0 ms to minimize.
[2023-03-16 09:59:47] [INFO ] Deduced a trap composed of 323 places in 346 ms of which 1 ms to minimize.
[2023-03-16 09:59:48] [INFO ] Deduced a trap composed of 314 places in 339 ms of which 1 ms to minimize.
[2023-03-16 09:59:48] [INFO ] Deduced a trap composed of 332 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:59:49] [INFO ] Deduced a trap composed of 317 places in 363 ms of which 0 ms to minimize.
[2023-03-16 09:59:51] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 1 ms to minimize.
[2023-03-16 09:59:52] [INFO ] Deduced a trap composed of 341 places in 359 ms of which 1 ms to minimize.
[2023-03-16 09:59:53] [INFO ] Deduced a trap composed of 338 places in 364 ms of which 0 ms to minimize.
[2023-03-16 09:59:53] [INFO ] Deduced a trap composed of 311 places in 342 ms of which 1 ms to minimize.
[2023-03-16 09:59:54] [INFO ] Deduced a trap composed of 320 places in 337 ms of which 1 ms to minimize.
[2023-03-16 09:59:54] [INFO ] Deduced a trap composed of 311 places in 329 ms of which 1 ms to minimize.
[2023-03-16 09:59:55] [INFO ] Deduced a trap composed of 323 places in 334 ms of which 1 ms to minimize.
[2023-03-16 09:59:55] [INFO ] Deduced a trap composed of 342 places in 348 ms of which 1 ms to minimize.
[2023-03-16 09:59:56] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43270 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 REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY 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-16 09:59:56] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:59:56] [INFO ] Invariant cache hit.
[2023-03-16 09:59:59] [INFO ] Implicit Places using invariants in 2358 ms returned []
[2023-03-16 09:59:59] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 09:59:59] [INFO ] Invariant cache hit.
[2023-03-16 09:59:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:02:39] [INFO ] Performed 7/1011 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-16 10:02:39] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-16 10:02:39] [INFO ] Implicit Places using invariants and state equation in 160028 ms returned []
Implicit Place search using SMT with State Equation took 162387 ms to find 0 implicit places.
[2023-03-16 10:02:39] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 10:02:39] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 10:02:39] [INFO ] Invariant cache hit.
[2023-03-16 10:02:41] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164428 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09 in 229295 ms.
[2023-03-16 10:02:41] [INFO ] Flatten gal took : 179 ms
[2023-03-16 10:02:41] [INFO ] Applying decomposition
[2023-03-16 10:02:41] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18440651220804111070.txt' '-o' '/tmp/graph18440651220804111070.bin' '-w' '/tmp/graph18440651220804111070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18440651220804111070.bin' '-l' '-1' '-v' '-w' '/tmp/graph18440651220804111070.weights' '-q' '0' '-e' '0.001'
[2023-03-16 10:02:41] [INFO ] Decomposing Gal with order
[2023-03-16 10:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 10:02:42] [INFO ] Removed a total of 1454 redundant transitions.
[2023-03-16 10:02:42] [INFO ] Flatten gal took : 477 ms
[2023-03-16 10:02:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 741 labels/synchronizations in 101 ms.
[2023-03-16 10:02:42] [INFO ] Time to serialize gal into /tmp/UpperBounds3241686895109340362.gal : 57 ms
[2023-03-16 10:02:42] [INFO ] Time to serialize properties into /tmp/UpperBounds646439979883140214.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3241686895109340362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds646439979883140214.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds646439979883140214.prop.
Detected timeout of ITS tools.
[2023-03-16 10:26:25] [INFO ] Flatten gal took : 2097 ms
[2023-03-16 10:26:25] [INFO ] Time to serialize gal into /tmp/UpperBounds13482752214156278897.gal : 80 ms
[2023-03-16 10:26:25] [INFO ] Time to serialize properties into /tmp/UpperBounds13203978128640006968.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13482752214156278897.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13203978128640006968.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds13203978128640006968.prop.
Detected timeout of ITS tools.
[2023-03-16 10:49:52] [INFO ] Flatten gal took : 937 ms
[2023-03-16 10:49:56] [INFO ] Input system was already deterministic with 1427 transitions.
[2023-03-16 10:49:56] [INFO ] Transformed 1011 places.
[2023-03-16 10:49:56] [INFO ] Transformed 1427 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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-16 10:50:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16413584517623413095.gal : 11 ms
[2023-03-16 10:50:27] [INFO ] Time to serialize properties into /tmp/UpperBounds13326042968201341896.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16413584517623413095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13326042968201341896.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13326042968201341896.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12688676 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15878528 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r293-tall-167873945800749"
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 ;