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.r571-tall-171734910300146.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 gold2023
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 r571-tall-171734910300146
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 23:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:04:54] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-02 23:04:54] [INFO ] Transformed 130 places.
[2024-06-02 23:04:54] [INFO ] Transformed 408 transitions.
[2024-06-02 23:04:54] [INFO ] Found NUPN structural information;
[2024-06-02 23:04:54] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Normalized transition count is 320 out of 352 initially.
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 23:04:54] [INFO ] Computed 8 invariants in 21 ms
Incomplete random walk after 10000 steps, including 573 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :6
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 146 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :1
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
[2024-06-02 23:04:54] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 23:04:54] [INFO ] Computed 8 invariants in 10 ms
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 23:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 23:04:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:04:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-02 23:04:55] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 32 ms.
[2024-06-02 23:04:55] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Minimization took 24 ms.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 23:04:55] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 31 ms.
[2024-06-02 23:04:55] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 30 ms.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 36 ms returned sat
[2024-06-02 23:04:56] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 33 ms.
[2024-06-02 23:04:56] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 5 ms to minimize.
[2024-06-02 23:04:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:04:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-06-02 23:04:56] [INFO ] Added : 17 causal constraints over 5 iterations in 286 ms. Result :sat
Minimization took 33 ms.
[2024-06-02 23:04:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:56] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 23:04:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:56] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 23:04:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:04:56] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 31 ms.
[2024-06-02 23:04:56] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:04:57] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-06-02 23:04:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2024-06-02 23:04:57] [INFO ] Added : 24 causal constraints over 7 iterations in 376 ms. Result :sat
Minimization took 36 ms.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 23:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:04:57] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 20 ms.
[2024-06-02 23:04:57] [INFO ] Added : 11 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 35 ms.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:57] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:04:57] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 22 ms.
[2024-06-02 23:04:57] [INFO ] Added : 10 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 39 ms.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:57] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 23:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 23:04:58] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 23 ms.
[2024-06-02 23:04:58] [INFO ] Added : 23 causal constraints over 5 iterations in 141 ms. Result :sat
Minimization took 41 ms.
[2024-06-02 23:04:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:58] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 23:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:58] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:04:58] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 19 ms.
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:04:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-06-02 23:04:58] [INFO ] Added : 21 causal constraints over 5 iterations in 272 ms. Result :sat
Minimization took 43 ms.
[2024-06-02 23:04:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:04:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:04:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 23:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:04:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:04:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-02 23:04:59] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 18 ms.
[2024-06-02 23:04:59] [INFO ] Added : 18 causal constraints over 7 iterations in 163 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions 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 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 125 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 123 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 122 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 121 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 120 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 119 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 118 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 116 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 115 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 114 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 114 transition count 309
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 44 place count 111 transition count 315
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 111 transition count 309
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 59 place count 111 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 111 transition count 302
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 110 transition count 300
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 110 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 109 transition count 297
Applied a total of 66 rules in 144 ms. Remains 109 /130 variables (removed 21) and now considering 297/352 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 109/130 places, 297/352 transitions.
Normalized transition count is 268 out of 297 initially.
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 23:04:59] [INFO ] Computed 8 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 58081 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14170 resets, run finished after 440 ms. (steps per millisecond=2272 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14190 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 2) seen :0
[2024-06-02 23:05:01] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 23:05:01] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 23:05:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:01] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 23:05:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 23:05:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 23:05:01] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 15 ms.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2024-06-02 23:05:02] [INFO ] Added : 20 causal constraints over 6 iterations in 275 ms. Result :sat
Minimization took 25 ms.
[2024-06-02 23:05:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 23:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:02] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 23:05:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 23:05:02] [INFO ] Computed and/alt/rep : 120/482/120 causal constraints (skipped 146 transitions) in 18 ms.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 23:05:02] [INFO ] Added : 42 causal constraints over 9 iterations in 259 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 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 12 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 12 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 6 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 23:05:02] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:05:02] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 23:05:03] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 685 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 15 ms. Remains 105 /107 variables (removed 2) and now considering 295/297 (removed 2) transitions.
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 23:05:03] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 23:05:03] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 297 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 1003 ms. Remains : 105/109 places, 295/297 transitions.
Successfully produced net in file /tmp/petri1000_6778029108752603016.dot
Successfully produced net in file /tmp/petri1001_15243549912437760078.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Normalized transition count is 264 out of 293 initially.
// Phase 1: matrix 264 rows 105 cols
[2024-06-02 23:05:03] [INFO ] Computed 8 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 57886 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 13659 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 13943 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 2) seen :0
[2024-06-02 23:05:05] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
// Phase 1: matrix 264 rows 105 cols
[2024-06-02 23:05:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:05:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:05] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 23:05:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 23:05:05] [INFO ] Computed and/alt/rep : 116/470/116 causal constraints (skipped 146 transitions) in 20 ms.
[2024-06-02 23:05:05] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 29 ms.
[2024-06-02 23:05:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:06] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:05:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:05:06] [INFO ] Computed and/alt/rep : 116/470/116 causal constraints (skipped 146 transitions) in 12 ms.
[2024-06-02 23:05:06] [INFO ] Added : 12 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-02 23:05:06] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
[2024-06-02 23:05:06] [INFO ] Invariant cache hit.
[2024-06-02 23:05:06] [INFO ] Implicit Places using invariants in 53 ms returned [12, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/105 places, 293/293 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 291
Applied a total of 4 rules in 11 ms. Remains 101 /103 variables (removed 2) and now considering 291/293 (removed 2) transitions.
[2024-06-02 23:05:06] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:06] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 23:05:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:05:06] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:06] [INFO ] Invariant cache hit.
[2024-06-02 23:05:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:06] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/105 places, 291/293 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 376 ms. Remains : 101/105 places, 291/293 transitions.
Normalized transition count is 262 out of 291 initially.
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:06] [INFO ] Computed 6 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 57914 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14032 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 13930 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 2) seen :0
[2024-06-02 23:05:08] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:08] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 23:05:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 23:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:08] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 23:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:08] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 23:05:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 23:05:08] [INFO ] Computed and/alt/rep : 112/446/112 causal constraints (skipped 148 transitions) in 16 ms.
[2024-06-02 23:05:08] [INFO ] Added : 32 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 36 ms.
[2024-06-02 23:05:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:08] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 23:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:09] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 23:05:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:05:09] [INFO ] Computed and/alt/rep : 112/446/112 causal constraints (skipped 148 transitions) in 15 ms.
[2024-06-02 23:05:09] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-02 23:05:09] [INFO ] Added : 45 causal constraints over 10 iterations in 258 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 23:05:09] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:09] [INFO ] Invariant cache hit.
[2024-06-02 23:05:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:05:09] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:09] [INFO ] Invariant cache hit.
[2024-06-02 23:05:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:09] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 23:05:09] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 23:05:09] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:09] [INFO ] Invariant cache hit.
[2024-06-02 23:05:09] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 101/101 places, 291/291 transitions.
Starting property specific reduction for FireWire-PT-09-UpperBounds-03
Normalized transition count is 262 out of 291 initially.
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:09] [INFO ] Computed 6 invariants in 4 ms
Incomplete random walk after 10000 steps, including 543 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 139 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-06-02 23:05:09] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:09] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 23:05:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 23:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:09] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 23:05:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:10] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:05:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 23:05:10] [INFO ] Computed and/alt/rep : 112/446/112 causal constraints (skipped 148 transitions) in 13 ms.
[2024-06-02 23:05:10] [INFO ] Added : 32 causal constraints over 8 iterations in 139 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 100 transition count 290
Applied a total of 2 rules in 7 ms. Remains 100 /101 variables (removed 1) and now considering 290/291 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/101 places, 290/291 transitions.
Normalized transition count is 261 out of 290 initially.
// Phase 1: matrix 261 rows 100 cols
[2024-06-02 23:05:10] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 57798 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 13984 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 1) seen :0
[2024-06-02 23:05:11] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 100 cols
[2024-06-02 23:05:11] [INFO ] Computed 6 invariants in 10 ms
[2024-06-02 23:05:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:11] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 23:05:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:11] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 23:05:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 23:05:11] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 23:05:11] [INFO ] Computed and/alt/rep : 111/445/111 causal constraints (skipped 148 transitions) in 14 ms.
[2024-06-02 23:05:12] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2024-06-02 23:05:12] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2024-06-02 23:05:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 23:05:12] [INFO ] Added : 48 causal constraints over 12 iterations in 350 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 290/290 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 100/100 places, 290/290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 290/290 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:12] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 23:05:12] [INFO ] Redundant transitions in 7 ms returned []
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2024-06-02 23:05:12] [INFO ] Invariant cache hit.
[2024-06-02 23:05:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 100/100 places, 290/290 transitions.
Ending property specific reduction for FireWire-PT-09-UpperBounds-03 in 2859 ms.
Starting property specific reduction for FireWire-PT-09-UpperBounds-05
Normalized transition count is 262 out of 291 initially.
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:12] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 10000 steps, including 558 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-06-02 23:05:12] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:12] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 23:05:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 23:05:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:12] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 23:05:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:05:12] [INFO ] Computed and/alt/rep : 112/446/112 causal constraints (skipped 148 transitions) in 17 ms.
[2024-06-02 23:05:13] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-06-02 23:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 23:05:13] [INFO ] Added : 45 causal constraints over 10 iterations in 258 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 291/291 transitions.
Normalized transition count is 262 out of 291 initially.
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:13] [INFO ] Computed 6 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 58084 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14045 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties (out of 1) seen :0
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 101 cols
[2024-06-02 23:05:14] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 23:05:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:14] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 23:05:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:05:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 23:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:05:14] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 23:05:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:05:14] [INFO ] Computed and/alt/rep : 112/446/112 causal constraints (skipped 148 transitions) in 16 ms.
[2024-06-02 23:05:15] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-06-02 23:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-02 23:05:15] [INFO ] Added : 45 causal constraints over 10 iterations in 270 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 291/291 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 23:05:15] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:15] [INFO ] Invariant cache hit.
[2024-06-02 23:05:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:05:15] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:15] [INFO ] Invariant cache hit.
[2024-06-02 23:05:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:05:15] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 23:05:15] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:05:15] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2024-06-02 23:05:15] [INFO ] Invariant cache hit.
[2024-06-02 23:05:15] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 101/101 places, 291/291 transitions.
Ending property specific reduction for FireWire-PT-09-UpperBounds-05 in 2900 ms.
[2024-06-02 23:05:15] [INFO ] Flatten gal took : 50 ms
[2024-06-02 23:05:15] [INFO ] Applying decomposition
[2024-06-02 23:05:15] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2519524759359414734.txt' '-o' '/tmp/graph2519524759359414734.bin' '-w' '/tmp/graph2519524759359414734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2519524759359414734.bin' '-l' '-1' '-v' '-w' '/tmp/graph2519524759359414734.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:05:15] [INFO ] Decomposing Gal with order
[2024-06-02 23:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:05:15] [INFO ] Removed a total of 426 redundant transitions.
[2024-06-02 23:05:15] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:05:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 8 ms.
[2024-06-02 23:05:16] [INFO ] Time to serialize gal into /tmp/UpperBounds4753191782873962255.gal : 5 ms
[2024-06-02 23:05:16] [INFO ] Time to serialize properties into /tmp/UpperBounds18283858578465709187.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4753191782873962255.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18283858578465709187.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds18283858578465709187.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.93614e+06,22.259,476844,1532,279,372214,15555,575,4.04246e+06,143,169274,0
Total reachable state count : 1936145

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-09-UpperBounds-03 :0 <= i3.u14.p67 <= 1
FORMULA FireWire-PT-09-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-09-UpperBounds-03,0,22.3391,476844,1,0,372214,15555,720,4.04246e+06,166,169274,1650
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-09-UpperBounds-05 :0 <= i4.u16.p72 <= 1
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-09-UpperBounds-05,0,22.3398,476844,1,0,372214,15555,747,4.04246e+06,171,169274,1713
Total runtime 44050 ms.

BK_STOP 1717369539498

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
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 r571-tall-171734910300146"
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 ;