Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 14M 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-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678879700211

Running Version 202205111006
[2023-03-15 11:28:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 11:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:28:22] [INFO ] Load time of PNML (sax parser for PT used): 897 ms
[2023-03-15 11:28:22] [INFO ] Transformed 664 places.
[2023-03-15 11:28:22] [INFO ] Transformed 12050 transitions.
[2023-03-15 11:28:22] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 1096 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 11:28:23] [INFO ] Computed 92 place invariants in 158 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 561 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :20
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :21
[2023-03-15 11:28:24] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 11:28:24] [INFO ] Computed 92 place invariants in 102 ms
[2023-03-15 11:28:24] [INFO ] [Real]Absence check using 63 positive place invariants in 38 ms returned sat
[2023-03-15 11:28:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 30 ms returned unsat
[2023-03-15 11:28:24] [INFO ] [Real]Absence check using 63 positive place invariants in 57 ms returned sat
[2023-03-15 11:28:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-15 11:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:25] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2023-03-15 11:28:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-15 11:28:26] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-15 11:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:29] [INFO ] [Nat]Absence check using state equation in 3551 ms returned sat
[2023-03-15 11:28:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:28:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2023-03-15 11:28:29] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 264 ms.
[2023-03-15 11:28:30] [INFO ] Added : 28 causal constraints over 6 iterations in 1076 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 11:28:30] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-15 11:28:30] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 14 ms returned unsat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 16 ms returned unsat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using state equation in 375 ms returned unsat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned unsat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 33 ms returned unsat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-15 11:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:32] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2023-03-15 11:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:32] [INFO ] [Nat]Absence check using 63 positive place invariants in 50 ms returned sat
[2023-03-15 11:28:32] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-15 11:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:34] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2023-03-15 11:28:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:28:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 3748 ms returned unknown
[2023-03-15 11:28:37] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-15 11:28:37] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-15 11:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:38] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-15 11:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:38] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-15 11:28:38] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-15 11:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:40] [INFO ] [Nat]Absence check using state equation in 1517 ms returned sat
[2023-03-15 11:28:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2023-03-15 11:28:40] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 128 ms.
[2023-03-15 11:28:43] [INFO ] Added : 5 causal constraints over 1 iterations in 3249 ms. Result :unknown
[2023-03-15 11:28:43] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-15 11:28:43] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-15 11:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:44] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2023-03-15 11:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:44] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-15 11:28:44] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-15 11:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:49] [INFO ] [Nat]Absence check using state equation in 4901 ms returned unknown
[2023-03-15 11:28:49] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-15 11:28:49] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 13 ms returned unsat
[2023-03-15 11:28:49] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-15 11:28:49] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-15 11:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:50] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-15 11:28:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:50] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-15 11:28:50] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-15 11:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:52] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2023-03-15 11:28:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 262 ms returned sat
[2023-03-15 11:28:52] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 190 ms.
[2023-03-15 11:28:53] [INFO ] Added : 11 causal constraints over 3 iterations in 554 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : [1, 151, 1, 4, 10, 1, 1, 226, 302, 4, 1, 302] Max seen :[1, 0, 1, 4, 10, 1, 1, 0, 1, 0, 1, 3]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 387 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2023-03-15 11:28:54] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2023-03-15 11:28:54] [INFO ] Computed 82 place invariants in 29 ms
[2023-03-15 11:28:55] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 581/664 places, 1252/1940 transitions.
Applied a total of 0 rules in 67 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/664 places, 1252/1940 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:28:55] [INFO ] Computed 82 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70208 resets, run finished after 7129 ms. (steps per millisecond=140 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8783 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8736 resets, run finished after 1538 ms. (steps per millisecond=650 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8802 resets, run finished after 1450 ms. (steps per millisecond=689 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8752 resets, run finished after 1579 ms. (steps per millisecond=633 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8952 resets, run finished after 1457 ms. (steps per millisecond=686 ) properties (out of 5) seen :10
[2023-03-15 11:29:10] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:29:10] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive place invariants in 26 ms returned sat
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 19 ms returned unsat
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:29:10] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:11] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-15 11:29:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:12] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:29:12] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-15 11:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:12] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2023-03-15 11:29:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:29:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1091 ms returned sat
[2023-03-15 11:29:14] [INFO ] Deduced a trap composed of 237 places in 301 ms of which 3 ms to minimize.
[2023-03-15 11:29:14] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 2 ms to minimize.
[2023-03-15 11:29:14] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 3 ms to minimize.
[2023-03-15 11:29:15] [INFO ] Deduced a trap composed of 226 places in 296 ms of which 3 ms to minimize.
[2023-03-15 11:29:15] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 0 ms to minimize.
[2023-03-15 11:29:16] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:29:16] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 0 ms to minimize.
[2023-03-15 11:29:16] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-15 11:29:16] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:29:17] [INFO ] Deduced a trap composed of 244 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:29:17] [INFO ] Deduced a trap composed of 244 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:29:17] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:29:18] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:29:19] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:29:19] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:29:19] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:29:20] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:29:20] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2023-03-15 11:29:20] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 0 ms to minimize.
[2023-03-15 11:29:21] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:29:21] [INFO ] Deduced a trap composed of 229 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:29:21] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:29:22] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:29:22] [INFO ] Deduced a trap composed of 239 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:29:22] [INFO ] Deduced a trap composed of 237 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:29:23] [INFO ] Deduced a trap composed of 229 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:29:23] [INFO ] Deduced a trap composed of 243 places in 269 ms of which 0 ms to minimize.
[2023-03-15 11:29:23] [INFO ] Deduced a trap composed of 241 places in 261 ms of which 1 ms to minimize.
[2023-03-15 11:29:24] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:29:24] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 0 ms to minimize.
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 233 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:29:25] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:29:26] [INFO ] Deduced a trap composed of 237 places in 260 ms of which 1 ms to minimize.
[2023-03-15 11:29:26] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 18 ms to minimize.
[2023-03-15 11:29:27] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 1 ms to minimize.
[2023-03-15 11:29:27] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 2 ms to minimize.
[2023-03-15 11:29:27] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 234 places in 302 ms of which 0 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 235 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:29:28] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 1 ms to minimize.
[2023-03-15 11:29:29] [INFO ] Deduced a trap composed of 236 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:29:29] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:29:30] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:29:30] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 0 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 0 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 227 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 238 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 0 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 241 places in 267 ms of which 2 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 229 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Deduced a trap composed of 241 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:29:37] [INFO ] Deduced a trap composed of 222 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:29:37] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 0 ms to minimize.
[2023-03-15 11:29:37] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:29:38] [INFO ] Deduced a trap composed of 240 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:29:38] [INFO ] Deduced a trap composed of 234 places in 314 ms of which 2 ms to minimize.
[2023-03-15 11:29:39] [INFO ] Deduced a trap composed of 228 places in 493 ms of which 2 ms to minimize.
[2023-03-15 11:29:39] [INFO ] Deduced a trap composed of 232 places in 353 ms of which 3 ms to minimize.
[2023-03-15 11:29:40] [INFO ] Deduced a trap composed of 246 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:29:41] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 234 places in 302 ms of which 3 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 0 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 229 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 238 places in 327 ms of which 0 ms to minimize.
[2023-03-15 11:29:44] [INFO ] Deduced a trap composed of 228 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:29:44] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:29:46] [INFO ] Deduced a trap composed of 228 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:29:46] [INFO ] Deduced a trap composed of 224 places in 316 ms of which 0 ms to minimize.
[2023-03-15 11:29:47] [INFO ] Deduced a trap composed of 239 places in 481 ms of which 0 ms to minimize.
[2023-03-15 11:29:48] [INFO ] Deduced a trap composed of 235 places in 376 ms of which 0 ms to minimize.
[2023-03-15 11:29:49] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:29:49] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 0 ms to minimize.
[2023-03-15 11:29:50] [INFO ] Deduced a trap composed of 239 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:29:50] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 0 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:29:55] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:29:56] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 43238 ms
[2023-03-15 11:29:57] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:29:57] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 2 ms returned unsat
[2023-03-15 11:29:57] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-15 11:29:57] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-15 11:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:58] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2023-03-15 11:29:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:58] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:29:58] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-15 11:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:59] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2023-03-15 11:29:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 212 ms returned sat
[2023-03-15 11:29:59] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:30:00] [INFO ] Deduced a trap composed of 231 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:30:00] [INFO ] Deduced a trap composed of 231 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:30:00] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 2 ms to minimize.
[2023-03-15 11:30:01] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:30:01] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 0 ms to minimize.
[2023-03-15 11:30:01] [INFO ] Deduced a trap composed of 229 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:30:02] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:30:02] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:30:02] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:30:03] [INFO ] Deduced a trap composed of 241 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:30:03] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-15 11:30:03] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:30:04] [INFO ] Deduced a trap composed of 230 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:30:04] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:30:05] [INFO ] Deduced a trap composed of 233 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:30:05] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:30:05] [INFO ] Deduced a trap composed of 235 places in 266 ms of which 0 ms to minimize.
[2023-03-15 11:30:06] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:30:06] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 0 ms to minimize.
[2023-03-15 11:30:06] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:30:07] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:30:07] [INFO ] Deduced a trap composed of 237 places in 489 ms of which 1 ms to minimize.
[2023-03-15 11:30:08] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:30:08] [INFO ] Deduced a trap composed of 237 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:30:08] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:30:09] [INFO ] Deduced a trap composed of 235 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:30:09] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 1 ms to minimize.
[2023-03-15 11:30:10] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:30:10] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:30:10] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:30:11] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:30:11] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:30:11] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-15 11:30:12] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:30:12] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:30:12] [INFO ] Deduced a trap composed of 243 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:30:13] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 0 ms to minimize.
[2023-03-15 11:30:13] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 0 ms to minimize.
[2023-03-15 11:30:13] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:30:14] [INFO ] Deduced a trap composed of 240 places in 267 ms of which 1 ms to minimize.
[2023-03-15 11:30:14] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:30:14] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:30:15] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:30:15] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-15 11:30:16] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 0 ms to minimize.
[2023-03-15 11:30:16] [INFO ] Deduced a trap composed of 224 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:30:16] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:30:17] [INFO ] Deduced a trap composed of 239 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:30:17] [INFO ] Deduced a trap composed of 222 places in 308 ms of which 1 ms to minimize.
[2023-03-15 11:30:17] [INFO ] Deduced a trap composed of 236 places in 311 ms of which 1 ms to minimize.
[2023-03-15 11:30:18] [INFO ] Deduced a trap composed of 236 places in 305 ms of which 1 ms to minimize.
[2023-03-15 11:30:18] [INFO ] Deduced a trap composed of 246 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:30:19] [INFO ] Deduced a trap composed of 232 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:30:19] [INFO ] Deduced a trap composed of 238 places in 293 ms of which 0 ms to minimize.
[2023-03-15 11:30:19] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:30:20] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:30:21] [INFO ] Deduced a trap composed of 245 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:30:21] [INFO ] Deduced a trap composed of 240 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:30:22] [INFO ] Deduced a trap composed of 246 places in 265 ms of which 0 ms to minimize.
[2023-03-15 11:30:22] [INFO ] Deduced a trap composed of 238 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:30:22] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 2 ms to minimize.
[2023-03-15 11:30:23] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:30:23] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:30:24] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:30:24] [INFO ] Deduced a trap composed of 233 places in 296 ms of which 0 ms to minimize.
[2023-03-15 11:30:26] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:30:26] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:30:27] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:30:27] [INFO ] Deduced a trap composed of 222 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:30:28] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:30:29] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:30:31] [INFO ] Deduced a trap composed of 245 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:30:31] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:30:32] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:30:32] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:30:33] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:30:33] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 0 ms to minimize.
[2023-03-15 11:30:34] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:30:36] [INFO ] Deduced a trap composed of 233 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:30:37] [INFO ] Deduced a trap composed of 232 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:30:38] [INFO ] Deduced a trap composed of 224 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:30:39] [INFO ] Deduced a trap composed of 244 places in 295 ms of which 0 ms to minimize.
[2023-03-15 11:30:39] [INFO ] Deduced a trap composed of 230 places in 304 ms of which 0 ms to minimize.
[2023-03-15 11:30:39] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:30:41] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:30:43] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 43947 ms
Current structural bounds on expressions (after SMT) : [2, 3, 60, 1, 60] Max seen :[2, 3, 3, 1, 3]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 42 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:30:43] [INFO ] Computed 82 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 70416 resets, run finished after 6506 ms. (steps per millisecond=153 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8642 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8737 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 2) seen :4
[2023-03-15 11:30:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:30:52] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 11:30:52] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-15 11:30:53] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:30:54] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2023-03-15 11:30:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:30:54] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:30:54] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-15 11:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:30:54] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-15 11:30:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:30:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1071 ms returned sat
[2023-03-15 11:30:56] [INFO ] Deduced a trap composed of 237 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:30:56] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:30:56] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 0 ms to minimize.
[2023-03-15 11:30:57] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:30:57] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:30:58] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-15 11:30:58] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 1 ms to minimize.
[2023-03-15 11:30:58] [INFO ] Deduced a trap composed of 234 places in 316 ms of which 0 ms to minimize.
[2023-03-15 11:30:59] [INFO ] Deduced a trap composed of 236 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:30:59] [INFO ] Deduced a trap composed of 244 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:30:59] [INFO ] Deduced a trap composed of 244 places in 273 ms of which 0 ms to minimize.
[2023-03-15 11:31:00] [INFO ] Deduced a trap composed of 238 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:31:00] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 1 ms to minimize.
[2023-03-15 11:31:01] [INFO ] Deduced a trap composed of 224 places in 282 ms of which 0 ms to minimize.
[2023-03-15 11:31:01] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:31:02] [INFO ] Deduced a trap composed of 234 places in 317 ms of which 0 ms to minimize.
[2023-03-15 11:31:02] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:31:02] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:31:03] [INFO ] Deduced a trap composed of 244 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:03] [INFO ] Deduced a trap composed of 226 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:31:03] [INFO ] Deduced a trap composed of 229 places in 288 ms of which 0 ms to minimize.
[2023-03-15 11:31:04] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:31:04] [INFO ] Deduced a trap composed of 233 places in 293 ms of which 1 ms to minimize.
[2023-03-15 11:31:04] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 0 ms to minimize.
[2023-03-15 11:31:05] [INFO ] Deduced a trap composed of 237 places in 333 ms of which 1 ms to minimize.
[2023-03-15 11:31:05] [INFO ] Deduced a trap composed of 229 places in 294 ms of which 0 ms to minimize.
[2023-03-15 11:31:05] [INFO ] Deduced a trap composed of 243 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:06] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 1 ms to minimize.
[2023-03-15 11:31:06] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:31:07] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 0 ms to minimize.
[2023-03-15 11:31:07] [INFO ] Deduced a trap composed of 233 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:31:07] [INFO ] Deduced a trap composed of 226 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:31:08] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 0 ms to minimize.
[2023-03-15 11:31:08] [INFO ] Deduced a trap composed of 237 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:09] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:31:09] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:31:09] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:31:10] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:31:10] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:11] [INFO ] Deduced a trap composed of 235 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:31:11] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:31:11] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:31:12] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:31:12] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:31:12] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 1 ms to minimize.
[2023-03-15 11:31:13] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:31:13] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:31:14] [INFO ] Deduced a trap composed of 232 places in 378 ms of which 0 ms to minimize.
[2023-03-15 11:31:14] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:31:14] [INFO ] Deduced a trap composed of 227 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:31:15] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:15] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:31:16] [INFO ] Deduced a trap composed of 240 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:31:16] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:31:16] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:31:17] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:31:17] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 0 ms to minimize.
[2023-03-15 11:31:17] [INFO ] Deduced a trap composed of 238 places in 300 ms of which 0 ms to minimize.
[2023-03-15 11:31:18] [INFO ] Deduced a trap composed of 229 places in 298 ms of which 0 ms to minimize.
[2023-03-15 11:31:18] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:31:19] [INFO ] Deduced a trap composed of 241 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:31:19] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:31:20] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 0 ms to minimize.
[2023-03-15 11:31:20] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:31:20] [INFO ] Deduced a trap composed of 240 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:31:21] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:31:21] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:31:22] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:22] [INFO ] Deduced a trap composed of 246 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:23] [INFO ] Deduced a trap composed of 236 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:31:24] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:31:24] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:25] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:31:25] [INFO ] Deduced a trap composed of 229 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:31:25] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:31:26] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:31:26] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:31:27] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:31:27] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-15 11:31:27] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:31:28] [INFO ] Deduced a trap composed of 224 places in 323 ms of which 0 ms to minimize.
[2023-03-15 11:31:29] [INFO ] Deduced a trap composed of 239 places in 351 ms of which 0 ms to minimize.
[2023-03-15 11:31:30] [INFO ] Deduced a trap composed of 235 places in 305 ms of which 1 ms to minimize.
[2023-03-15 11:31:31] [INFO ] Deduced a trap composed of 230 places in 328 ms of which 0 ms to minimize.
[2023-03-15 11:31:31] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 0 ms to minimize.
[2023-03-15 11:31:32] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:31:32] [INFO ] Deduced a trap composed of 228 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 0 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 224 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 0 ms to minimize.
[2023-03-15 11:31:37] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 43304 ms
[2023-03-15 11:31:39] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:31:39] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:40] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2023-03-15 11:31:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:31:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:31:40] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:31:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:41] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2023-03-15 11:31:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 217 ms returned sat
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 231 places in 258 ms of which 0 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 231 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:31:43] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 0 ms to minimize.
[2023-03-15 11:31:43] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:31:43] [INFO ] Deduced a trap composed of 229 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 0 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 245 places in 293 ms of which 0 ms to minimize.
[2023-03-15 11:31:45] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 1 ms to minimize.
[2023-03-15 11:31:45] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:31:46] [INFO ] Deduced a trap composed of 241 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:31:46] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:31:46] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:31:47] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 0 ms to minimize.
[2023-03-15 11:31:47] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 235 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:31:48] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:31:49] [INFO ] Deduced a trap composed of 240 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:31:49] [INFO ] Deduced a trap composed of 237 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:31:50] [INFO ] Deduced a trap composed of 239 places in 293 ms of which 0 ms to minimize.
[2023-03-15 11:31:50] [INFO ] Deduced a trap composed of 237 places in 305 ms of which 0 ms to minimize.
[2023-03-15 11:31:50] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:31:51] [INFO ] Deduced a trap composed of 235 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:31:51] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:51] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:31:52] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 0 ms to minimize.
[2023-03-15 11:31:52] [INFO ] Deduced a trap composed of 230 places in 491 ms of which 0 ms to minimize.
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 0 ms to minimize.
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 234 places in 317 ms of which 1 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:55] [INFO ] Deduced a trap composed of 243 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:31:55] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:31:55] [INFO ] Deduced a trap composed of 222 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:31:56] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:31:56] [INFO ] Deduced a trap composed of 240 places in 300 ms of which 1 ms to minimize.
[2023-03-15 11:31:56] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:31:57] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:31:57] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:31:58] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:31:58] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 1 ms to minimize.
[2023-03-15 11:31:58] [INFO ] Deduced a trap composed of 224 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:31:59] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:31:59] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:31:59] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:32:00] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 1 ms to minimize.
[2023-03-15 11:32:00] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:32:01] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 0 ms to minimize.
[2023-03-15 11:32:01] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:32:01] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:32:02] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:32:03] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 0 ms to minimize.
[2023-03-15 11:32:03] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 0 ms to minimize.
[2023-03-15 11:32:04] [INFO ] Deduced a trap composed of 240 places in 261 ms of which 0 ms to minimize.
[2023-03-15 11:32:04] [INFO ] Deduced a trap composed of 246 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:32:04] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-15 11:32:05] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-15 11:32:05] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-15 11:32:05] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 0 ms to minimize.
[2023-03-15 11:32:06] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 0 ms to minimize.
[2023-03-15 11:32:06] [INFO ] Deduced a trap composed of 233 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:32:08] [INFO ] Deduced a trap composed of 236 places in 346 ms of which 0 ms to minimize.
[2023-03-15 11:32:08] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:32:09] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:32:09] [INFO ] Deduced a trap composed of 222 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:32:10] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 0 ms to minimize.
[2023-03-15 11:32:11] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 0 ms to minimize.
[2023-03-15 11:32:13] [INFO ] Deduced a trap composed of 245 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:32:14] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:32:14] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:32:14] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:32:15] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:32:15] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:32:16] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:32:19] [INFO ] Deduced a trap composed of 233 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:32:19] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:32:20] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:32:21] [INFO ] Deduced a trap composed of 244 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:32:21] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:32:22] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-15 11:32:23] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 0 ms to minimize.
[2023-03-15 11:32:25] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 43934 ms
Current structural bounds on expressions (after SMT) : [60, 60] Max seen :[3, 3]
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 40 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 36 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 11:32:25] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:25] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-15 11:32:26] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-15 11:32:26] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:26] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 11:32:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:32:33] [INFO ] Implicit Places using invariants and state equation in 7529 ms returned []
Implicit Place search using SMT with State Equation took 8315 ms to find 0 implicit places.
[2023-03-15 11:32:34] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-15 11:32:34] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:34] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-15 11:32:34] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:34] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 689 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-15 11:32:34] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:34] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 11:32:34] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:32:34] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned sat
[2023-03-15 11:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:36] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2023-03-15 11:32:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-15 11:32:36] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-15 11:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:36] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-15 11:32:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:32:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1082 ms returned sat
[2023-03-15 11:32:38] [INFO ] Deduced a trap composed of 237 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:32:38] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:32:38] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:32:39] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:32:39] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:32:40] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:32:40] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:32:40] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:32:41] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:32:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 35 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 11:32:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:41] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-15 11:32:42] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:42] [INFO ] Computed 82 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 70215 resets, run finished after 6780 ms. (steps per millisecond=147 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8756 resets, run finished after 1592 ms. (steps per millisecond=628 ) properties (out of 1) seen :3
[2023-03-15 11:32:50] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:32:50] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 11:32:50] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-15 11:32:50] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:51] [INFO ] [Real]Absence check using state equation in 1188 ms returned sat
[2023-03-15 11:32:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:52] [INFO ] [Nat]Absence check using 63 positive place invariants in 23 ms returned sat
[2023-03-15 11:32:52] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 28 ms returned sat
[2023-03-15 11:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:52] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2023-03-15 11:32:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:32:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1105 ms returned sat
[2023-03-15 11:32:54] [INFO ] Deduced a trap composed of 237 places in 296 ms of which 0 ms to minimize.
[2023-03-15 11:32:54] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 0 ms to minimize.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 0 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:32:57] [INFO ] Deduced a trap composed of 234 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:32:57] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:32:58] [INFO ] Deduced a trap composed of 244 places in 319 ms of which 0 ms to minimize.
[2023-03-15 11:32:58] [INFO ] Deduced a trap composed of 244 places in 303 ms of which 1 ms to minimize.
[2023-03-15 11:32:58] [INFO ] Deduced a trap composed of 238 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:32:59] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:33:00] [INFO ] Deduced a trap composed of 224 places in 314 ms of which 0 ms to minimize.
[2023-03-15 11:33:00] [INFO ] Deduced a trap composed of 238 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:33:00] [INFO ] Deduced a trap composed of 234 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:33:01] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:33:01] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:33:01] [INFO ] Deduced a trap composed of 244 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:33:02] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:33:02] [INFO ] Deduced a trap composed of 229 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:33:02] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:33:03] [INFO ] Deduced a trap composed of 233 places in 309 ms of which 0 ms to minimize.
[2023-03-15 11:33:03] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:33:03] [INFO ] Deduced a trap composed of 237 places in 280 ms of which 0 ms to minimize.
[2023-03-15 11:33:04] [INFO ] Deduced a trap composed of 229 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:33:04] [INFO ] Deduced a trap composed of 243 places in 300 ms of which 0 ms to minimize.
[2023-03-15 11:33:05] [INFO ] Deduced a trap composed of 241 places in 279 ms of which 0 ms to minimize.
[2023-03-15 11:33:05] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:33:05] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:33:06] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:33:06] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:33:06] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:33:07] [INFO ] Deduced a trap composed of 237 places in 269 ms of which 0 ms to minimize.
[2023-03-15 11:33:07] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:33:08] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 0 ms to minimize.
[2023-03-15 11:33:08] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-15 11:33:09] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:33:09] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:33:09] [INFO ] Deduced a trap composed of 235 places in 311 ms of which 0 ms to minimize.
[2023-03-15 11:33:10] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:33:10] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:33:10] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:33:11] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:33:11] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:33:12] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-15 11:33:12] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:33:13] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:33:13] [INFO ] Deduced a trap composed of 224 places in 304 ms of which 0 ms to minimize.
[2023-03-15 11:33:13] [INFO ] Deduced a trap composed of 227 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:33:14] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 0 ms to minimize.
[2023-03-15 11:33:14] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:33:14] [INFO ] Deduced a trap composed of 240 places in 293 ms of which 1 ms to minimize.
[2023-03-15 11:33:15] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 11:33:15] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:33:16] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:33:16] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:33:16] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:33:17] [INFO ] Deduced a trap composed of 229 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:33:17] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:33:18] [INFO ] Deduced a trap composed of 241 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:33:18] [INFO ] Deduced a trap composed of 222 places in 303 ms of which 0 ms to minimize.
[2023-03-15 11:33:19] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:33:19] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 1 ms to minimize.
[2023-03-15 11:33:20] [INFO ] Deduced a trap composed of 240 places in 300 ms of which 1 ms to minimize.
[2023-03-15 11:33:20] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:33:20] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-15 11:33:21] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 0 ms to minimize.
[2023-03-15 11:33:21] [INFO ] Deduced a trap composed of 246 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 236 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:33:23] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:33:24] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:33:24] [INFO ] Deduced a trap composed of 229 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:33:25] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:33:26] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:33:26] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 0 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:33:27] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 0 ms to minimize.
[2023-03-15 11:33:28] [INFO ] Deduced a trap composed of 239 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:33:29] [INFO ] Deduced a trap composed of 235 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:33:30] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:33:30] [INFO ] Deduced a trap composed of 236 places in 500 ms of which 1 ms to minimize.
[2023-03-15 11:33:31] [INFO ] Deduced a trap composed of 239 places in 511 ms of which 1 ms to minimize.
[2023-03-15 11:33:32] [INFO ] Deduced a trap composed of 228 places in 476 ms of which 1 ms to minimize.
[2023-03-15 11:33:35] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-15 11:33:35] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:33:36] [INFO ] Deduced a trap composed of 224 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:33:36] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:33:36] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:33:36] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 42845 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 11:33:37] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:37] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 11:33:37] [INFO ] Implicit Places using invariants in 664 ms returned []
[2023-03-15 11:33:37] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:37] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 11:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:33:45] [INFO ] Implicit Places using invariants and state equation in 7742 ms returned []
Implicit Place search using SMT with State Equation took 8408 ms to find 0 implicit places.
[2023-03-15 11:33:45] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 11:33:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:45] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 11:33:46] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09 in 71461 ms.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:46] [INFO ] Computed 82 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 710 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-15 11:33:46] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:46] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-15 11:33:46] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-15 11:33:46] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:47] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2023-03-15 11:33:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:47] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:33:47] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:48] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2023-03-15 11:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:33:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 231 ms returned sat
[2023-03-15 11:33:49] [INFO ] Deduced a trap composed of 234 places in 294 ms of which 1 ms to minimize.
[2023-03-15 11:33:49] [INFO ] Deduced a trap composed of 231 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:33:49] [INFO ] Deduced a trap composed of 231 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:33:50] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 0 ms to minimize.
[2023-03-15 11:33:50] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 0 ms to minimize.
[2023-03-15 11:33:50] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:33:51] [INFO ] Deduced a trap composed of 229 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:33:51] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:33:51] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:33:52] [INFO ] Deduced a trap composed of 245 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:33:52] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:33:52] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 3845 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 11:33:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:52] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 11:33:53] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:33:53] [INFO ] Computed 82 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 70512 resets, run finished after 6466 ms. (steps per millisecond=154 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8982 resets, run finished after 1458 ms. (steps per millisecond=685 ) properties (out of 1) seen :3
[2023-03-15 11:34:01] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:34:01] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 11:34:01] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:34:01] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:02] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2023-03-15 11:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:02] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 11:34:02] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-15 11:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:03] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2023-03-15 11:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:34:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 219 ms returned sat
[2023-03-15 11:34:04] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:34:04] [INFO ] Deduced a trap composed of 231 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:34:04] [INFO ] Deduced a trap composed of 231 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:34:05] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 0 ms to minimize.
[2023-03-15 11:34:05] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 0 ms to minimize.
[2023-03-15 11:34:05] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:34:06] [INFO ] Deduced a trap composed of 229 places in 306 ms of which 0 ms to minimize.
[2023-03-15 11:34:06] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 1 ms to minimize.
[2023-03-15 11:34:06] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:34:07] [INFO ] Deduced a trap composed of 245 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:34:07] [INFO ] Deduced a trap composed of 241 places in 313 ms of which 1 ms to minimize.
[2023-03-15 11:34:08] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-15 11:34:08] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:34:08] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:34:09] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:34:09] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 1 ms to minimize.
[2023-03-15 11:34:09] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:34:10] [INFO ] Deduced a trap composed of 235 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:34:10] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:34:10] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-15 11:34:11] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:34:11] [INFO ] Deduced a trap composed of 240 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:34:12] [INFO ] Deduced a trap composed of 237 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:34:12] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:34:12] [INFO ] Deduced a trap composed of 237 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:34:13] [INFO ] Deduced a trap composed of 236 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:34:13] [INFO ] Deduced a trap composed of 235 places in 381 ms of which 0 ms to minimize.
[2023-03-15 11:34:13] [INFO ] Deduced a trap composed of 242 places in 373 ms of which 0 ms to minimize.
[2023-03-15 11:34:14] [INFO ] Deduced a trap composed of 228 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:34:14] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:34:15] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:34:15] [INFO ] Deduced a trap composed of 233 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:34:15] [INFO ] Deduced a trap composed of 234 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:34:16] [INFO ] Deduced a trap composed of 228 places in 303 ms of which 0 ms to minimize.
[2023-03-15 11:34:16] [INFO ] Deduced a trap composed of 238 places in 282 ms of which 2 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 243 places in 300 ms of which 1 ms to minimize.
[2023-03-15 11:34:17] [INFO ] Deduced a trap composed of 228 places in 456 ms of which 1 ms to minimize.
[2023-03-15 11:34:18] [INFO ] Deduced a trap composed of 222 places in 455 ms of which 1 ms to minimize.
[2023-03-15 11:34:18] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:34:19] [INFO ] Deduced a trap composed of 240 places in 283 ms of which 0 ms to minimize.
[2023-03-15 11:34:19] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:34:19] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:34:20] [INFO ] Deduced a trap composed of 236 places in 308 ms of which 3 ms to minimize.
[2023-03-15 11:34:20] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:34:21] [INFO ] Deduced a trap composed of 238 places in 290 ms of which 0 ms to minimize.
[2023-03-15 11:34:21] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:34:21] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:34:22] [INFO ] Deduced a trap composed of 239 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:34:22] [INFO ] Deduced a trap composed of 222 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 236 places in 464 ms of which 1 ms to minimize.
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 246 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 232 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 242 places in 301 ms of which 0 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 1 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 0 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Deduced a trap composed of 246 places in 277 ms of which 0 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Deduced a trap composed of 238 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:34:28] [INFO ] Deduced a trap composed of 238 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:34:28] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:34:28] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2023-03-15 11:34:29] [INFO ] Deduced a trap composed of 233 places in 297 ms of which 2 ms to minimize.
[2023-03-15 11:34:29] [INFO ] Deduced a trap composed of 233 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:34:31] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 0 ms to minimize.
[2023-03-15 11:34:31] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 0 ms to minimize.
[2023-03-15 11:34:32] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 0 ms to minimize.
[2023-03-15 11:34:32] [INFO ] Deduced a trap composed of 222 places in 289 ms of which 1 ms to minimize.
[2023-03-15 11:34:33] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:34:34] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:34:36] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:34:37] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:34:37] [INFO ] Deduced a trap composed of 230 places in 423 ms of which 0 ms to minimize.
[2023-03-15 11:34:38] [INFO ] Deduced a trap composed of 238 places in 472 ms of which 0 ms to minimize.
[2023-03-15 11:34:38] [INFO ] Deduced a trap composed of 232 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:34:39] [INFO ] Deduced a trap composed of 222 places in 297 ms of which 0 ms to minimize.
[2023-03-15 11:34:40] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-15 11:34:42] [INFO ] Deduced a trap composed of 233 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:34:43] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2023-03-15 11:34:44] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:34:44] [INFO ] Deduced a trap composed of 244 places in 387 ms of which 1 ms to minimize.
[2023-03-15 11:34:45] [INFO ] Deduced a trap composed of 230 places in 387 ms of which 1 ms to minimize.
[2023-03-15 11:34:45] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-15 11:34:47] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:34:47] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 43907 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-15 11:34:47] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:34:47] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-15 11:34:48] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-15 11:34:48] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:34:48] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 11:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:34:56] [INFO ] Implicit Places using invariants and state equation in 8176 ms returned []
Implicit Place search using SMT with State Equation took 8862 ms to find 0 implicit places.
[2023-03-15 11:34:56] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-15 11:34:56] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 11:34:56] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-15 11:34:57] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14 in 71124 ms.
[2023-03-15 11:34:57] [INFO ] Flatten gal took : 223 ms
[2023-03-15 11:34:57] [INFO ] Applying decomposition
[2023-03-15 11:34:57] [INFO ] Flatten gal took : 108 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5934155170320933358.txt' '-o' '/tmp/graph5934155170320933358.bin' '-w' '/tmp/graph5934155170320933358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5934155170320933358.bin' '-l' '-1' '-v' '-w' '/tmp/graph5934155170320933358.weights' '-q' '0' '-e' '0.001'
[2023-03-15 11:34:58] [INFO ] Decomposing Gal with order
[2023-03-15 11:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:34:58] [INFO ] Removed a total of 3067 redundant transitions.
[2023-03-15 11:34:58] [INFO ] Flatten gal took : 324 ms
[2023-03-15 11:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 128 ms.
[2023-03-15 11:34:58] [INFO ] Time to serialize gal into /tmp/UpperBounds5736144012165596692.gal : 25 ms
[2023-03-15 11:34:58] [INFO ] Time to serialize properties into /tmp/UpperBounds7471994497477349478.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5736144012165596692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7471994497477349478.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7471994497477349478.prop.
Detected timeout of ITS tools.
[2023-03-15 11:57:29] [INFO ] Flatten gal took : 607 ms
[2023-03-15 11:57:30] [INFO ] Time to serialize gal into /tmp/UpperBounds4680242138422073443.gal : 191 ms
[2023-03-15 11:57:30] [INFO ] Time to serialize properties into /tmp/UpperBounds4184397734698159915.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4680242138422073443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4184397734698159915.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

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

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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