Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 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 FireWire-PT-16-UpperBounds-00
FORMULA_NAME FireWire-PT-16-UpperBounds-01
FORMULA_NAME FireWire-PT-16-UpperBounds-02
FORMULA_NAME FireWire-PT-16-UpperBounds-03
FORMULA_NAME FireWire-PT-16-UpperBounds-04
FORMULA_NAME FireWire-PT-16-UpperBounds-05
FORMULA_NAME FireWire-PT-16-UpperBounds-06
FORMULA_NAME FireWire-PT-16-UpperBounds-07
FORMULA_NAME FireWire-PT-16-UpperBounds-08
FORMULA_NAME FireWire-PT-16-UpperBounds-09
FORMULA_NAME FireWire-PT-16-UpperBounds-10
FORMULA_NAME FireWire-PT-16-UpperBounds-11
FORMULA_NAME FireWire-PT-16-UpperBounds-12
FORMULA_NAME FireWire-PT-16-UpperBounds-13
FORMULA_NAME FireWire-PT-16-UpperBounds-14
FORMULA_NAME FireWire-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717357041088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:37:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:37:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:37:22] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 19:37:22] [INFO ] Transformed 254 places.
[2024-06-02 19:37:22] [INFO ] Transformed 368 transitions.
[2024-06-02 19:37:22] [INFO ] Found NUPN structural information;
[2024-06-02 19:37:22] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 368 rows 254 cols
[2024-06-02 19:37:22] [INFO ] Computed 5 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (26 resets) in 111 ms. (714 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:37:22] [INFO ] Invariant cache hit.
[2024-06-02 19:37:22] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-06-02 19:37:23] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-02 19:37:23] [INFO ] Deduced a trap composed of 138 places in 280 ms of which 21 ms to minimize.
[2024-06-02 19:37:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:23] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 19:37:23] [INFO ] Deduced a trap composed of 138 places in 105 ms of which 11 ms to minimize.
[2024-06-02 19:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-06-02 19:37:23] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 28 ms.
[2024-06-02 19:37:25] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-06-02 19:37:25] [INFO ] Added : 297 causal constraints over 61 iterations in 2036 ms. Result :sat
Minimization took 221 ms.
[2024-06-02 19:37:26] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 19:37:26] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-02 19:37:26] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 23 ms.
[2024-06-02 19:37:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:26] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-06-02 19:37:26] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 22 ms.
[2024-06-02 19:37:28] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:37:28] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:37:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2024-06-02 19:37:28] [INFO ] Added : 300 causal constraints over 63 iterations in 2105 ms. Result :sat
Minimization took 190 ms.
[2024-06-02 19:37:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 19:37:29] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-02 19:37:29] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:29] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-02 19:37:29] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 22 ms.
[2024-06-02 19:37:31] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:37:31] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:37:31] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:37:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2024-06-02 19:37:31] [INFO ] Added : 311 causal constraints over 63 iterations in 2369 ms. Result :sat
Minimization took 222 ms.
[2024-06-02 19:37:32] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:32] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 19:37:32] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 22 ms.
[2024-06-02 19:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:32] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 19:37:32] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 23 ms.
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-06-02 19:37:34] [INFO ] Added : 314 causal constraints over 63 iterations in 1991 ms. Result :sat
Minimization took 175 ms.
[2024-06-02 19:37:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:34] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 19:37:35] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 19:37:35] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 22 ms.
[2024-06-02 19:37:37] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:37:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 19:37:37] [INFO ] Added : 316 causal constraints over 64 iterations in 2018 ms. Result :sat
Minimization took 210 ms.
[2024-06-02 19:37:37] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:37] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-02 19:37:37] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 21 ms.
[2024-06-02 19:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:37] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 19:37:37] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 17 ms.
[2024-06-02 19:37:39] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-06-02 19:37:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-06-02 19:37:39] [INFO ] Added : 285 causal constraints over 58 iterations in 1803 ms. Result :sat
Minimization took 196 ms.
[2024-06-02 19:37:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 19:37:39] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 19:37:40] [INFO ] Deduced a trap composed of 109 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:37:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-02 19:37:40] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 19:37:40] [INFO ] Computed and/alt/rep : 328/806/328 causal constraints (skipped 39 transitions) in 19 ms.
[2024-06-02 19:37:42] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 19:37:42] [INFO ] Added : 279 causal constraints over 56 iterations in 1842 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 368/368 transitions.
Graph (trivial) has 208 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 235 transition count 276
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 164 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 162 transition count 273
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 150 place count 162 transition count 269
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 158 transition count 269
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 186 place count 130 transition count 240
Iterating global reduction 3 with 28 rules applied. Total rules applied 214 place count 130 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 130 transition count 239
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 215 place count 130 transition count 233
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 227 place count 124 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 231 place count 120 transition count 210
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 120 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 120 transition count 209
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 272 place count 102 transition count 191
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 304 place count 86 transition count 240
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 306 place count 86 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 320 place count 86 transition count 224
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 334 place count 86 transition count 210
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 350 place count 72 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 375 place count 72 transition count 183
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 376 place count 72 transition count 183
Applied a total of 376 rules in 121 ms. Remains 72 /254 variables (removed 182) and now considering 183/368 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 72/254 places, 183/368 transitions.
[2024-06-02 19:37:44] [INFO ] Flow matrix only has 166 transitions (discarded 17 similar events)
// Phase 1: matrix 166 rows 72 cols
[2024-06-02 19:37:44] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (99729 resets) in 781 ms. (1278 steps per ms)
FORMULA FireWire-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000002 steps (220048 resets) in 1793 ms. (3344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 19:37:47] [INFO ] Flow matrix only has 166 transitions (discarded 17 similar events)
[2024-06-02 19:37:47] [INFO ] Invariant cache hit.
[2024-06-02 19:37:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-02 19:37:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:37:47] [INFO ] [Real]Added 25 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Nat]Added 25 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:37:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 19:37:47] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 14 ms.
[2024-06-02 19:37:47] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 19:37:47] [INFO ] Added : 25 causal constraints over 7 iterations in 170 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 19:37:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Real]Added 25 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:37:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 19:37:47] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2024-06-02 19:37:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:37:47] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:37:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-06-02 19:37:47] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 10 ms.
[2024-06-02 19:37:48] [INFO ] Added : 15 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Real]Added 25 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:37:48] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 10 ms.
[2024-06-02 19:37:48] [INFO ] Added : 54 causal constraints over 11 iterations in 138 ms. Result :sat
Minimization took 60 ms.
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:37:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:37:48] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:37:48] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:37:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-06-02 19:37:48] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 9 ms.
[2024-06-02 19:37:48] [INFO ] Added : 61 causal constraints over 13 iterations in 170 ms. Result :sat
Minimization took 71 ms.
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Real]Added 25 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:37:49] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-02 19:37:49] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 10 ms.
[2024-06-02 19:37:49] [INFO ] Added : 52 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 19:37:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:49] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:37:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 19:37:49] [INFO ] Computed and/alt/rep : 109/602/109 causal constraints (skipped 55 transitions) in 9 ms.
[2024-06-02 19:37:49] [INFO ] Added : 56 causal constraints over 12 iterations in 157 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 183/183 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 72 transition count 181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 181
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 70 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 69 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 69 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 69 transition count 174
Applied a total of 9 rules in 16 ms. Remains 69 /72 variables (removed 3) and now considering 174/183 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 69/72 places, 174/183 transitions.
[2024-06-02 19:37:49] [INFO ] Flow matrix only has 157 transitions (discarded 17 similar events)
// Phase 1: matrix 157 rows 69 cols
[2024-06-02 19:37:49] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (99653 resets) in 630 ms. (1584 steps per ms)
BEST_FIRST walk for 3000003 steps (109918 resets) in 892 ms. (3359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 19:37:51] [INFO ] Flow matrix only has 157 transitions (discarded 17 similar events)
[2024-06-02 19:37:51] [INFO ] Invariant cache hit.
[2024-06-02 19:37:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 19:37:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 19:37:51] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:51] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:51] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:37:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:37:51] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:37:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-06-02 19:37:51] [INFO ] Computed and/alt/rep : 102/572/102 causal constraints (skipped 53 transitions) in 8 ms.
[2024-06-02 19:37:51] [INFO ] Added : 54 causal constraints over 11 iterations in 147 ms. Result :sat
Minimization took 59 ms.
[2024-06-02 19:37:51] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-06-02 19:37:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:51] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
[2024-06-02 19:37:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 19:37:52] [INFO ] Computed and/alt/rep : 102/572/102 causal constraints (skipped 53 transitions) in 13 ms.
[2024-06-02 19:37:52] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:37:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 19:37:52] [INFO ] Added : 60 causal constraints over 13 iterations in 248 ms. Result :sat
Minimization took 57 ms.
[2024-06-02 19:37:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 19:37:52] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:37:52] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:37:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 19:37:52] [INFO ] Computed and/alt/rep : 102/572/102 causal constraints (skipped 53 transitions) in 8 ms.
[2024-06-02 19:37:52] [INFO ] Added : 4 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 174/174 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 69 transition count 173
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 68 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 4 place count 67 transition count 179
Applied a total of 4 rules in 19 ms. Remains 67 /69 variables (removed 2) and now considering 179/174 (removed -5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 67/69 places, 179/174 transitions.
[2024-06-02 19:37:52] [INFO ] Flow matrix only has 162 transitions (discarded 17 similar events)
// Phase 1: matrix 162 rows 67 cols
[2024-06-02 19:37:52] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (99431 resets) in 626 ms. (1594 steps per ms)
BEST_FIRST walk for 2000002 steps (73259 resets) in 613 ms. (3257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:37:53] [INFO ] Flow matrix only has 162 transitions (discarded 17 similar events)
[2024-06-02 19:37:53] [INFO ] Invariant cache hit.
[2024-06-02 19:37:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:37:54] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-02 19:37:54] [INFO ] Computed and/alt/rep : 77/429/77 causal constraints (skipped 83 transitions) in 10 ms.
[2024-06-02 19:37:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 19:37:54] [INFO ] Added : 28 causal constraints over 7 iterations in 168 ms. Result :sat
Minimization took 40 ms.
[2024-06-02 19:37:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 19:37:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:37:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 19:37:54] [INFO ] Computed and/alt/rep : 77/429/77 causal constraints (skipped 83 transitions) in 8 ms.
[2024-06-02 19:37:54] [INFO ] Added : 25 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 179/179 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 178
Applied a total of 2 rules in 6 ms. Remains 66 /67 variables (removed 1) and now considering 178/179 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 66/67 places, 178/179 transitions.
[2024-06-02 19:37:54] [INFO ] Flow matrix only has 161 transitions (discarded 17 similar events)
// Phase 1: matrix 161 rows 66 cols
[2024-06-02 19:37:54] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (99613 resets) in 614 ms. (1626 steps per ms)
BEST_FIRST walk for 2000000 steps (73087 resets) in 571 ms. (3496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:37:55] [INFO ] Flow matrix only has 161 transitions (discarded 17 similar events)
[2024-06-02 19:37:55] [INFO ] Invariant cache hit.
[2024-06-02 19:37:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:37:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-02 19:37:55] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:37:55] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:37:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:37:56] [INFO ] Computed and/alt/rep : 76/428/76 causal constraints (skipped 83 transitions) in 8 ms.
[2024-06-02 19:37:56] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:37:56] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:37:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-06-02 19:37:56] [INFO ] Added : 36 causal constraints over 8 iterations in 230 ms. Result :sat
Minimization took 47 ms.
[2024-06-02 19:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:37:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:37:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-02 19:37:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:37:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-02 19:37:56] [INFO ] Computed and/alt/rep : 76/428/76 causal constraints (skipped 83 transitions) in 7 ms.
[2024-06-02 19:37:56] [INFO ] Added : 21 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 66/66 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-06-02 19:37:56] [INFO ] Flow matrix only has 161 transitions (discarded 17 similar events)
[2024-06-02 19:37:56] [INFO ] Invariant cache hit.
[2024-06-02 19:37:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:37:56] [INFO ] Flow matrix only has 161 transitions (discarded 17 similar events)
[2024-06-02 19:37:56] [INFO ] Invariant cache hit.
[2024-06-02 19:37:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:37:56] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 19:37:56] [INFO ] Redundant transitions in 5 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:37:56] [INFO ] Flow matrix only has 161 transitions (discarded 17 similar events)
[2024-06-02 19:37:56] [INFO ] Invariant cache hit.
[2024-06-02 19:37:56] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 4 ms to minimize.
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 161/227 variables, 66/74 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 32/106 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/106 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/106 constraints. Problems are: Problem set: 12 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 106 constraints, problems are : Problem set: 12 solved, 164 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 12 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 161/227 variables, 66/74 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 32/106 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 164/270 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/270 constraints. Problems are: Problem set: 12 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/270 constraints. Problems are: Problem set: 12 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 270 constraints, problems are : Problem set: 12 solved, 164 unsolved in 4611 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 164/176 constraints, Known Traps: 4/4 constraints]
After SMT, in 8356ms problems are : Problem set: 12 solved, 164 unsolved
Search for dead transitions found 12 dead transitions in 8368ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/66 places, 166/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2024-06-02 19:38:05] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8578 ms. Remains : 66/66 places, 166/178 transitions.
[2024-06-02 19:38:05] [INFO ] Flow matrix only has 149 transitions (discarded 17 similar events)
// Phase 1: matrix 149 rows 66 cols
[2024-06-02 19:38:05] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (99482 resets) in 668 ms. (1494 steps per ms)
BEST_FIRST walk for 2000001 steps (73122 resets) in 606 ms. (3294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:38:06] [INFO ] Flow matrix only has 149 transitions (discarded 17 similar events)
[2024-06-02 19:38:06] [INFO ] Invariant cache hit.
[2024-06-02 19:38:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 19:38:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:38:06] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:38:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 19:38:06] [INFO ] Computed and/alt/rep : 76/386/76 causal constraints (skipped 71 transitions) in 10 ms.
[2024-06-02 19:38:06] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 19:38:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 19:38:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 19:38:07] [INFO ] Computed and/alt/rep : 76/386/76 causal constraints (skipped 71 transitions) in 10 ms.
[2024-06-02 19:38:07] [INFO ] Added : 36 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 166/166 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 66/66 places, 166/166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 166/166 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2024-06-02 19:38:07] [INFO ] Flow matrix only has 149 transitions (discarded 17 similar events)
[2024-06-02 19:38:07] [INFO ] Invariant cache hit.
[2024-06-02 19:38:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:38:07] [INFO ] Flow matrix only has 149 transitions (discarded 17 similar events)
[2024-06-02 19:38:07] [INFO ] Invariant cache hit.
[2024-06-02 19:38:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 19:38:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-02 19:38:07] [INFO ] Redundant transitions in 5 ms returned []
Running 164 sub problems to find dead transitions.
[2024-06-02 19:38:07] [INFO ] Flow matrix only has 149 transitions (discarded 17 similar events)
[2024-06-02 19:38:07] [INFO ] Invariant cache hit.
[2024-06-02 19:38:07] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-02 19:38:07] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 132 unsolved
[2024-06-02 19:38:08] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 149/215 variables, 66/76 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 32/108 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/108 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/108 constraints. Problems are: Problem set: 32 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 108 constraints, problems are : Problem set: 32 solved, 132 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 32 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/10 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 149/215 variables, 66/76 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 32/108 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 132/240 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/240 constraints. Problems are: Problem set: 32 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/240 constraints. Problems are: Problem set: 32 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 240 constraints, problems are : Problem set: 32 solved, 132 unsolved in 4128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 132/164 constraints, Known Traps: 6/6 constraints]
After SMT, in 7133ms problems are : Problem set: 32 solved, 132 unsolved
Search for dead transitions found 32 dead transitions in 7135ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/66 places, 134/166 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 19:38:14] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7318 ms. Remains : 66/66 places, 134/166 transitions.
[2024-06-02 19:38:14] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
// Phase 1: matrix 117 rows 66 cols
[2024-06-02 19:38:14] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (99542 resets) in 613 ms. (1628 steps per ms)
BEST_FIRST walk for 2000001 steps (73294 resets) in 577 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:38:15] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
[2024-06-02 19:38:15] [INFO ] Invariant cache hit.
[2024-06-02 19:38:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:38:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-02 19:38:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:38:15] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-02 19:38:15] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-02 19:38:15] [INFO ] Computed and/alt/rep : 71/362/71 causal constraints (skipped 44 transitions) in 7 ms.
[2024-06-02 19:38:15] [INFO ] Added : 43 causal constraints over 9 iterations in 88 ms. Result :sat
Minimization took 42 ms.
[2024-06-02 19:38:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-02 19:38:16] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:16] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 19:38:16] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:16] [INFO ] Computed and/alt/rep : 71/362/71 causal constraints (skipped 44 transitions) in 7 ms.
[2024-06-02 19:38:16] [INFO ] Added : 50 causal constraints over 10 iterations in 108 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 66/66 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 19:38:16] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
[2024-06-02 19:38:16] [INFO ] Invariant cache hit.
[2024-06-02 19:38:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 19:38:16] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
[2024-06-02 19:38:16] [INFO ] Invariant cache hit.
[2024-06-02 19:38:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:38:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-02 19:38:16] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-02 19:38:16] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
[2024-06-02 19:38:16] [INFO ] Invariant cache hit.
[2024-06-02 19:38:16] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 19:38:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:38:17] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:38:17] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:38:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:38:17] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 117/183 variables, 66/75 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 25/100 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 100 constraints, problems are : Problem set: 2 solved, 130 unsolved in 2325 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 117/183 variables, 66/75 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 25/100 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 130/230 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 230 constraints, problems are : Problem set: 2 solved, 130 unsolved in 3249 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 130/132 constraints, Known Traps: 5/5 constraints]
After SMT, in 5625ms problems are : Problem set: 2 solved, 130 unsolved
Search for dead transitions found 2 dead transitions in 5627ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/66 places, 132/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-02 19:38:22] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5803 ms. Remains : 66/66 places, 132/134 transitions.
[2024-06-02 19:38:22] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
// Phase 1: matrix 115 rows 66 cols
[2024-06-02 19:38:22] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (99731 resets) in 612 ms. (1631 steps per ms)
BEST_FIRST walk for 2000001 steps (73124 resets) in 563 ms. (3546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:38:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2024-06-02 19:38:23] [INFO ] Invariant cache hit.
[2024-06-02 19:38:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-02 19:38:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:38:23] [INFO ] [Real]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:38:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2024-06-02 19:38:23] [INFO ] Computed and/alt/rep : 69/351/69 causal constraints (skipped 44 transitions) in 5 ms.
[2024-06-02 19:38:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 19:38:23] [INFO ] Added : 21 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 34 ms.
[2024-06-02 19:38:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:38:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:38:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 19:38:23] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2024-06-02 19:38:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 19:38:23] [INFO ] Computed and/alt/rep : 69/351/69 causal constraints (skipped 44 transitions) in 7 ms.
[2024-06-02 19:38:23] [INFO ] Added : 8 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 132/132 transitions.
Applied a total of 0 rules in 11 ms. Remains 66 /66 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-02 19:38:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2024-06-02 19:38:23] [INFO ] Invariant cache hit.
[2024-06-02 19:38:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 19:38:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2024-06-02 19:38:23] [INFO ] Invariant cache hit.
[2024-06-02 19:38:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 19:38:23] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-02 19:38:23] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-02 19:38:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2024-06-02 19:38:23] [INFO ] Invariant cache hit.
[2024-06-02 19:38:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 19:38:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:38:24] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:38:24] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 115/181 variables, 66/73 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 98 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 115/181 variables, 66/73 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 228 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
After SMT, in 5665ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 5667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5819 ms. Remains : 66/66 places, 132/132 transitions.
RANDOM walk for 40000 steps (3966 resets) in 822 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1459 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1446 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1445 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1462 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1052 steps, run visited all 4 properties in 22 ms. (steps per millisecond=47 )
Probabilistic random walk after 1052 steps, saw 417 distinct states, run finished after 26 ms. (steps per millisecond=40 ) properties seen :4
FORMULA FireWire-PT-16-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-16-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 67910 ms.
ITS solved all properties within timeout

BK_STOP 1717357110198

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FireWire-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-16, 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 r553-tall-171734901300293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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