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-171734901200237.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-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.1K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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-09-UpperBounds-00
FORMULA_NAME FireWire-PT-09-UpperBounds-01
FORMULA_NAME FireWire-PT-09-UpperBounds-02
FORMULA_NAME FireWire-PT-09-UpperBounds-03
FORMULA_NAME FireWire-PT-09-UpperBounds-04
FORMULA_NAME FireWire-PT-09-UpperBounds-05
FORMULA_NAME FireWire-PT-09-UpperBounds-06
FORMULA_NAME FireWire-PT-09-UpperBounds-07
FORMULA_NAME FireWire-PT-09-UpperBounds-08
FORMULA_NAME FireWire-PT-09-UpperBounds-09
FORMULA_NAME FireWire-PT-09-UpperBounds-10
FORMULA_NAME FireWire-PT-09-UpperBounds-11
FORMULA_NAME FireWire-PT-09-UpperBounds-12
FORMULA_NAME FireWire-PT-09-UpperBounds-13
FORMULA_NAME FireWire-PT-09-UpperBounds-14
FORMULA_NAME FireWire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717354854068

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:00:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:00:55] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 19:00:55] [INFO ] Transformed 130 places.
[2024-06-02 19:00:55] [INFO ] Transformed 408 transitions.
[2024-06-02 19:00:55] [INFO ] Found NUPN structural information;
[2024-06-02 19:00:55] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
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]
[2024-06-02 19:00:55] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 19:00:55] [INFO ] Computed 8 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 (552 resets) in 41 ms. (238 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (1081 resets) in 113 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:00:55] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2024-06-02 19:00:55] [INFO ] Invariant cache hit.
[2024-06-02 19:00:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 19:00:56] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-02 19:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 19:00:56] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-06-02 19:00:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 19:00:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 38 ms returned sat
[2024-06-02 19:00:56] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 7 ms to minimize.
[2024-06-02 19:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-06-02 19:00:56] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 40 ms.
[2024-06-02 19:00:56] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Minimization took 240 ms.
[2024-06-02 19:00:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-02 19:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:00:57] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 31 ms.
[2024-06-02 19:00:57] [INFO ] Added : 19 causal constraints over 6 iterations in 170 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:00:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 19:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 19:00:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:00:57] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 35 ms.
[2024-06-02 19:00:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 19:00:58] [INFO ] Added : 30 causal constraints over 8 iterations in 316 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:00:58] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 33 ms.
[2024-06-02 19:00:58] [INFO ] Added : 10 causal constraints over 5 iterations in 141 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:00:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:00:59] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 22 ms.
[2024-06-02 19:00:59] [INFO ] Added : 17 causal constraints over 5 iterations in 148 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 19:00:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:00:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:59] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:00:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:00:59] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 19:00:59] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 24 ms.
[2024-06-02 19:00:59] [INFO ] Added : 12 causal constraints over 5 iterations in 121 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 19:00:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:00:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 19:00:59] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 19:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:01:00] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 20 ms.
[2024-06-02 19:01:00] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 19:01:00] [INFO ] Added : 14 causal constraints over 5 iterations in 194 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:01:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 19:01:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:01:00] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 19:01:00] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 22 ms.
[2024-06-02 19:01:00] [INFO ] Added : 4 causal constraints over 2 iterations in 72 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 127 transition count 343
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 127 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 127 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 126 transition count 338
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 125 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 123 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 122 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 121 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 120 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 119 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 118 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 117 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 116 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 115 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 115 transition count 312
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 112 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 47 place count 112 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 56 place count 112 transition count 303
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 112 transition count 305
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 111 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 111 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 110 transition count 300
Applied a total of 63 rules in 223 ms. Remains 110 /130 variables (removed 20) and now considering 300/352 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 110/130 places, 300/352 transitions.
[2024-06-02 19:01:01] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
// Phase 1: matrix 271 rows 110 cols
[2024-06-02 19:01:01] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (58025 resets) in 1183 ms. (844 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (70303 resets) in 2125 ms. (2351 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 19:01:04] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 19:01:04] [INFO ] Invariant cache hit.
[2024-06-02 19:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:04] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:01:04] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 19:01:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 27 ms returned sat
[2024-06-02 19:01:05] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-06-02 19:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-06-02 19:01:05] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 21 ms.
[2024-06-02 19:01:05] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 19:01:05] [INFO ] Added : 25 causal constraints over 5 iterations in 190 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 19:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 19:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:01:05] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 18 ms.
[2024-06-02 19:01:05] [INFO ] Added : 11 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 19:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-06-02 19:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 19:01:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:01:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 19:01:06] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 18 ms.
[2024-06-02 19:01:06] [INFO ] Added : 3 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 19:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:01:06] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 15 ms.
[2024-06-02 19:01:06] [INFO ] Added : 11 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 60 ms.
[2024-06-02 19:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:01:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:01:06] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 15 ms.
[2024-06-02 19:01:06] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 19:01:06] [INFO ] Added : 14 causal constraints over 5 iterations in 169 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 110/110 places, 300/300 transitions.
[2024-06-02 19:01:06] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 19:01:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57433 resets) in 1165 ms. (857 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (42596 resets) in 1208 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 19:01:09] [INFO ] Flow matrix only has 271 transitions (discarded 29 similar events)
[2024-06-02 19:01:09] [INFO ] Invariant cache hit.
[2024-06-02 19:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:09] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 19:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:09] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:01:09] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 19:01:09] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 16 ms.
[2024-06-02 19:01:09] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 19:01:09] [INFO ] Added : 25 causal constraints over 5 iterations in 169 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 19:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:09] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:01:10] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 17 ms.
[2024-06-02 19:01:10] [INFO ] Added : 11 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 65 ms.
[2024-06-02 19:01:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:01:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:01:10] [INFO ] Computed and/alt/rep : 111/399/111 causal constraints (skipped 158 transitions) in 17 ms.
[2024-06-02 19:01:10] [INFO ] Added : 11 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 58 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:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 300/300 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 297
Applied a total of 3 rules in 19 ms. Remains 109 /110 variables (removed 1) and now considering 297/300 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 109/110 places, 297/300 transitions.
[2024-06-02 19:01:10] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 19:01:10] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57754 resets) in 1111 ms. (899 steps per ms)
BEST_FIRST walk for 3000002 steps (42582 resets) in 1206 ms. (2485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 19:01:12] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 19:01:12] [INFO ] Invariant cache hit.
[2024-06-02 19:01:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:01:13] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:13] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:01:13] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 18 ms.
[2024-06-02 19:01:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:01:13] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:01:13] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:01:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2024-06-02 19:01:13] [INFO ] Added : 41 causal constraints over 9 iterations in 401 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 19:01:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:13] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 19:01:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 19:01:13] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 19:01:13] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 19:01:14] [INFO ] Added : 41 causal constraints over 10 iterations in 272 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 19:01:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:14] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 19:01:14] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:14] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:01:14] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 19:01:14] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 19:01:14] [INFO ] Added : 42 causal constraints over 9 iterations in 250 ms. Result :sat
Minimization took 68 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:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 19:01:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 19:01:14] [INFO ] Invariant cache hit.
[2024-06-02 19:01:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:01:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 19:01:14] [INFO ] Invariant cache hit.
[2024-06-02 19:01:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:14] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 248 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/109 places, 297/297 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 295
Applied a total of 4 rules in 16 ms. Remains 105 /107 variables (removed 2) and now considering 295/297 (removed 2) transitions.
[2024-06-02 19:01:15] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 19:01:15] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:01:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 19:01:15] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 19:01:15] [INFO ] Invariant cache hit.
[2024-06-02 19:01:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/109 places, 295/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 488 ms. Remains : 105/109 places, 295/297 transitions.
[2024-06-02 19:01:15] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 19:01:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57745 resets) in 1198 ms. (834 steps per ms)
BEST_FIRST walk for 3000002 steps (41889 resets) in 1272 ms. (2356 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 19:01:17] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 19:01:17] [INFO ] Invariant cache hit.
[2024-06-02 19:01:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 19:01:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:17] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 19:01:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 19:01:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:01:17] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 285 ms
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 19:01:18] [INFO ] Added : 49 causal constraints over 14 iterations in 610 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 19:01:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:18] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 19:01:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:18] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 19:01:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:01:18] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 19:01:18] [INFO ] Added : 23 causal constraints over 6 iterations in 202 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 19:01:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 19:01:19] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:01:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:19] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:01:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:01:19] [INFO ] Computed and/alt/rep : 118/476/118 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 19:01:19] [INFO ] Added : 40 causal constraints over 9 iterations in 149 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 290/290 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 5 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 102 transition count 284
Applied a total of 5 rules in 16 ms. Remains 102 /105 variables (removed 3) and now considering 284/290 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 102/105 places, 284/290 transitions.
[2024-06-02 19:01:19] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
// Phase 1: matrix 255 rows 102 cols
[2024-06-02 19:01:19] [INFO ] Computed 6 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (60850 resets) in 1151 ms. (868 steps per ms)
BEST_FIRST walk for 1000001 steps (14920 resets) in 416 ms. (2398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:01:21] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 19:01:21] [INFO ] Invariant cache hit.
[2024-06-02 19:01:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:21] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:01:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:01:21] [INFO ] [Real]Added 39 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:01:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 19:01:21] [INFO ] [Nat]Added 39 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:01:21] [INFO ] Computed and/alt/rep : 113/465/113 causal constraints (skipped 140 transitions) in 18 ms.
[2024-06-02 19:01:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 19:01:21] [INFO ] Added : 38 causal constraints over 9 iterations in 215 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 284/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 102/102 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-02 19:01:21] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 19:01:21] [INFO ] Invariant cache hit.
[2024-06-02 19:01:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:01:21] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 19:01:21] [INFO ] Invariant cache hit.
[2024-06-02 19:01:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:01:21] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 19:01:21] [INFO ] Redundant transitions in 13 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 19:01:21] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 19:01:21] [INFO ] Invariant cache hit.
[2024-06-02 19:01:21] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:01:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:01:23] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:01:23] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:01:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:01:24] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:01:24] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:01:24] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 255/356 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:01:27] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:01:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/357 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 0/357 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12528 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 255/356 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:01:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 19:01:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/357 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 15 (OVERLAPS) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 29095 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 11/11 constraints]
After SMT, in 41870ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 41883ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42113 ms. Remains : 102/102 places, 284/284 transitions.
[2024-06-02 19:02:03] [INFO ] Flow matrix only has 255 transitions (discarded 29 similar events)
[2024-06-02 19:02:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA FireWire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (60987 resets) in 1130 ms. (884 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 69714 ms.
ITS solved all properties within timeout

BK_STOP 1717354924972

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-09"
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-09, 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-171734901200237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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