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.r517-tall-167987243600237.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 460K Mar 31 16:48 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680823581716

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2023-04-06 23:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-06 23:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:26:23] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-04-06 23:26:23] [INFO ] Transformed 295 places.
[2023-04-06 23:26:23] [INFO ] Transformed 800 transitions.
[2023-04-06 23:26:23] [INFO ] Found NUPN structural information;
[2023-04-06 23:26:23] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 465 out of 800 initially.
// Phase 1: matrix 465 rows 295 cols
[2023-04-06 23:26:23] [INFO ] Computed 16 invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :6
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
[2023-04-06 23:26:23] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2023-04-06 23:26:23] [INFO ] Computed 16 invariants in 13 ms
[2023-04-06 23:26:23] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-06 23:26:23] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:24] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-04-06 23:26:24] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-04-06 23:26:24] [INFO ] [Real]Added 196 Read/Feed constraints in 23 ms returned sat
[2023-04-06 23:26:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:24] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:24] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-04-06 23:26:24] [INFO ] [Nat]Added 196 Read/Feed constraints in 30 ms returned sat
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 5 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1079 ms
[2023-04-06 23:26:25] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 46 ms.
[2023-04-06 23:26:27] [INFO ] Added : 197 causal constraints over 40 iterations in 1576 ms. Result :sat
Minimization took 124 ms.
[2023-04-06 23:26:27] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:27] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:27] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-04-06 23:26:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:27] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:27] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-04-06 23:26:27] [INFO ] [Nat]Added 196 Read/Feed constraints in 22 ms returned sat
[2023-04-06 23:26:27] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:26:27] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:26:27] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:26:27] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 23:26:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1096 ms
[2023-04-06 23:26:28] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 38 ms.
[2023-04-06 23:26:30] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-04-06 23:26:30] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:26:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-04-06 23:26:31] [INFO ] Added : 271 causal constraints over 56 iterations in 2570 ms. Result :sat
Minimization took 186 ms.
[2023-04-06 23:26:31] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:31] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:31] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-04-06 23:26:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:31] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:31] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-04-06 23:26:31] [INFO ] [Nat]Added 196 Read/Feed constraints in 21 ms returned sat
[2023-04-06 23:26:31] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-06 23:26:31] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:26:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 950 ms
[2023-04-06 23:26:32] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 38 ms.
[2023-04-06 23:26:34] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 23:26:34] [INFO ] Added : 269 causal constraints over 55 iterations in 2272 ms. Result :sat
Minimization took 186 ms.
[2023-04-06 23:26:35] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-06 23:26:35] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:35] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-04-06 23:26:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:35] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:35] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-06 23:26:35] [INFO ] [Nat]Added 196 Read/Feed constraints in 20 ms returned sat
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 821 ms
[2023-04-06 23:26:36] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 25 ms.
[2023-04-06 23:26:38] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 23:26:38] [INFO ] Added : 245 causal constraints over 49 iterations in 2112 ms. Result :sat
Minimization took 168 ms.
[2023-04-06 23:26:38] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:38] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:38] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-04-06 23:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:38] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:38] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-04-06 23:26:39] [INFO ] [Nat]Added 196 Read/Feed constraints in 22 ms returned sat
[2023-04-06 23:26:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:26:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 23:26:39] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:26:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 23:26:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 278 ms
[2023-04-06 23:26:39] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 27 ms.
[2023-04-06 23:26:41] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2023-04-06 23:26:41] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2023-04-06 23:26:41] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:26:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-04-06 23:26:41] [INFO ] Added : 280 causal constraints over 57 iterations in 2505 ms. Result :sat
Minimization took 168 ms.
[2023-04-06 23:26:42] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:42] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:42] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-04-06 23:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:42] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:42] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-04-06 23:26:42] [INFO ] [Nat]Added 196 Read/Feed constraints in 24 ms returned sat
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 659 ms
[2023-04-06 23:26:43] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 27 ms.
[2023-04-06 23:26:44] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 1 ms to minimize.
[2023-04-06 23:26:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-06 23:26:45] [INFO ] Added : 246 causal constraints over 50 iterations in 2032 ms. Result :sat
Minimization took 153 ms.
[2023-04-06 23:26:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:26:45] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:45] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-04-06 23:26:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:45] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:45] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-04-06 23:26:45] [INFO ] [Nat]Added 196 Read/Feed constraints in 23 ms returned sat
[2023-04-06 23:26:45] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:45] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2023-04-06 23:26:45] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:26:45] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:26:45] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:26:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 413 ms
[2023-04-06 23:26:45] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 25 ms.
[2023-04-06 23:26:47] [INFO ] Added : 201 causal constraints over 41 iterations in 1504 ms. Result :sat
Minimization took 149 ms.
[2023-04-06 23:26:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:47] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:47] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-04-06 23:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:47] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:47] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-04-06 23:26:47] [INFO ] [Nat]Added 196 Read/Feed constraints in 18 ms returned sat
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 763 ms
[2023-04-06 23:26:48] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 28 ms.
[2023-04-06 23:26:50] [INFO ] Added : 239 causal constraints over 48 iterations in 1807 ms. Result :sat
Minimization took 149 ms.
[2023-04-06 23:26:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:50] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:50] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-04-06 23:26:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 23:26:50] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:51] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-04-06 23:26:51] [INFO ] [Nat]Added 196 Read/Feed constraints in 22 ms returned sat
[2023-04-06 23:26:51] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:26:51] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:26:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:26:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:26:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 23:26:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 425 ms
[2023-04-06 23:26:51] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 26 ms.
[2023-04-06 23:26:53] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-04-06 23:26:53] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:26:54] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:26:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-04-06 23:26:54] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-06 23:26:54] [INFO ] Added : 320 causal constraints over 66 iterations in 3381 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 290 transition count 717
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 212 transition count 717
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 192 transition count 617
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 192 transition count 617
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 246 place count 172 transition count 597
Applied a total of 246 rules in 91 ms. Remains 172 /295 variables (removed 123) and now considering 597/800 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 172/295 places, 597/800 transitions.
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:26:55] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1218 ms. (steps per millisecond=821 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 5) seen :0
[2023-04-06 23:26:58] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:26:58] [INFO ] Computed 16 invariants in 4 ms
[2023-04-06 23:26:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:58] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:26:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-04-06 23:26:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:26:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-04-06 23:26:59] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 15 ms.
[2023-04-06 23:26:59] [INFO ] Added : 24 causal constraints over 5 iterations in 101 ms. Result :sat
Minimization took 31 ms.
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:26:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:59] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2023-04-06 23:26:59] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 16 ms.
[2023-04-06 23:26:59] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 23:26:59] [INFO ] Added : 52 causal constraints over 12 iterations in 306 ms. Result :sat
Minimization took 39 ms.
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:26:59] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 9 ms returned sat
[2023-04-06 23:27:00] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 16 ms.
[2023-04-06 23:27:00] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:27:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 23:27:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:27:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2023-04-06 23:27:00] [INFO ] Added : 87 causal constraints over 18 iterations in 538 ms. Result :sat
Minimization took 51 ms.
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-04-06 23:27:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 10 ms returned sat
[2023-04-06 23:27:00] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 17 ms.
[2023-04-06 23:27:01] [INFO ] Added : 53 causal constraints over 11 iterations in 198 ms. Result :sat
Minimization took 36 ms.
[2023-04-06 23:27:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:01] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:01] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-04-06 23:27:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:01] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:01] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-06 23:27:01] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2023-04-06 23:27:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-04-06 23:27:01] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 16 ms.
[2023-04-06 23:27:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 23:27:01] [INFO ] Added : 64 causal constraints over 13 iterations in 356 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 17 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 172/172 places, 597/597 transitions.
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:01] [INFO ] Computed 16 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 2) seen :0
[2023-04-06 23:27:03] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:03] [INFO ] Computed 16 invariants in 6 ms
[2023-04-06 23:27:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:03] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:03] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:27:03] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:03] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-04-06 23:27:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 13 ms returned sat
[2023-04-06 23:27:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:27:04] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:27:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 23:27:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2023-04-06 23:27:04] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 20 ms.
[2023-04-06 23:27:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-04-06 23:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 23:27:04] [INFO ] Added : 52 causal constraints over 12 iterations in 300 ms. Result :sat
Minimization took 39 ms.
[2023-04-06 23:27:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:04] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-04-06 23:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:04] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:04] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-04-06 23:27:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 10 ms returned sat
[2023-04-06 23:27:04] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 16 ms.
[2023-04-06 23:27:04] [INFO ] Added : 53 causal constraints over 11 iterations in 195 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 29 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:27:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:27:05] [INFO ] Invariant cache hit.
[2023-04-06 23:27:05] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-04-06 23:27:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:27:05] [INFO ] Invariant cache hit.
[2023-04-06 23:27:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:05] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-04-06 23:27:05] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 23:27:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:27:05] [INFO ] Invariant cache hit.
[2023-04-06 23:27:05] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 172/172 places, 597/597 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-04
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:05] [INFO ] Computed 16 invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-06 23:27:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:05] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:27:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:05] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 23:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:05] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-04-06 23:27:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:05] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:06] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-04-06 23:27:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:06] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2023-04-06 23:27:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-04-06 23:27:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:27:06] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:27:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2023-04-06 23:27:06] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 19 ms.
[2023-04-06 23:27:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2023-04-06 23:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 23:27:06] [INFO ] Added : 52 causal constraints over 12 iterations in 297 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 172 transition count 596
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 19 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 171/172 places, 596/597 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 23:27:06] [INFO ] Computed 16 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=2816 ) properties (out of 1) seen :0
[2023-04-06 23:27:08] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 23:27:08] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:27:08] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:08] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:08] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-04-06 23:27:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:08] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:08] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-06 23:27:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2023-04-06 23:27:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 23:27:08] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:27:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:27:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2023-04-06 23:27:08] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 15 ms.
[2023-04-06 23:27:08] [INFO ] Added : 34 causal constraints over 7 iterations in 130 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 12 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-06 23:27:08] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:08] [INFO ] Invariant cache hit.
[2023-04-06 23:27:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-04-06 23:27:08] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:08] [INFO ] Invariant cache hit.
[2023-04-06 23:27:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:09] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-04-06 23:27:09] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-06 23:27:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:09] [INFO ] Invariant cache hit.
[2023-04-06 23:27:09] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 171/171 places, 596/596 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-04 in 3611 ms.
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-08
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:09] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-06 23:27:09] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:27:09] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:27:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:09] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:09] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-04-06 23:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:09] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:09] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-04-06 23:27:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2023-04-06 23:27:09] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 16 ms.
[2023-04-06 23:27:09] [INFO ] Added : 53 causal constraints over 11 iterations in 194 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 172 transition count 596
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 23 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 171/172 places, 596/597 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 23:27:09] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :0
[2023-04-06 23:27:11] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 23:27:11] [INFO ] Computed 16 invariants in 7 ms
[2023-04-06 23:27:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:11] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-04-06 23:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:27:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:27:11] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:27:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-04-06 23:27:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2023-04-06 23:27:11] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 19 ms.
[2023-04-06 23:27:11] [INFO ] Added : 39 causal constraints over 8 iterations in 158 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-06 23:27:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:12] [INFO ] Invariant cache hit.
[2023-04-06 23:27:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-04-06 23:27:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:12] [INFO ] Invariant cache hit.
[2023-04-06 23:27:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:27:12] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-04-06 23:27:12] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 23:27:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:27:12] [INFO ] Invariant cache hit.
[2023-04-06 23:27:12] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 690 ms. Remains : 171/171 places, 596/596 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-08 in 3313 ms.
[2023-04-06 23:27:12] [INFO ] Flatten gal took : 73 ms
[2023-04-06 23:27:13] [INFO ] Applying decomposition
[2023-04-06 23:27:13] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13133627675585493290.txt' '-o' '/tmp/graph13133627675585493290.bin' '-w' '/tmp/graph13133627675585493290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13133627675585493290.bin' '-l' '-1' '-v' '-w' '/tmp/graph13133627675585493290.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:27:13] [INFO ] Decomposing Gal with order
[2023-04-06 23:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:27:13] [INFO ] Removed a total of 949 redundant transitions.
[2023-04-06 23:27:13] [INFO ] Flatten gal took : 122 ms
[2023-04-06 23:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 27 ms.
[2023-04-06 23:27:13] [INFO ] Time to serialize gal into /tmp/UpperBounds9429192947348029009.gal : 10 ms
[2023-04-06 23:27:13] [INFO ] Time to serialize properties into /tmp/UpperBounds13480909514363969234.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9429192947348029009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13480909514363969234.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13480909514363969234.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.26252e+06,146.247,2569476,65764,10618,3.63138e+06,181957,1410,8.37536e+06,284,1.51662e+06,0
Total reachable state count : 4262522

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-05-UpperBounds-04 :0 <= i10.i1.u27.p34_0_4 <= 1
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-05-UpperBounds-04,0,147.843,2569476,1,0,3.63138e+06,181957,1610,8.37536e+06,307,1.51662e+06,4040
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-05-UpperBounds-08 :0 <= i7.u13.p34_2_4 <= 1
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-05-UpperBounds-08,0,147.874,2569476,1,0,3.63138e+06,181957,1644,8.37536e+06,307,1.51662e+06,4372
Total runtime 198371 ms.

BK_STOP 1680823782461

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-05, 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 r517-tall-167987243600237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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