Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015800006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FunctionPointer-PT-a064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 34K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748758489915

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 06:14:52] [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]
[2025-06-01 06:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 06:14:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-06-01 06:14:52] [INFO ] Transformed 40 places.
[2025-06-01 06:14:52] [INFO ] Transformed 70 transitions.
[2025-06-01 06:14:52] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:14:52] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2025-06-01 06:14:52] [INFO ] Computed 4 invariants in 13 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, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 10000 steps (24 resets) in 54 ms. (181 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (186 resets) in 166 ms. (538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 13, 9, 36, 10, 9, 21, 19, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:14:53] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-06-01 06:14:53] [INFO ] Invariant cache hit.
[2025-06-01 06:14:53] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-01 06:14:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 06:14:53] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 06:14:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:14:53] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-01 06:14:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:14:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 06:14:53] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 06:14:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:14:53] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 39 ms to minimize.
[2025-06-01 06:14:53] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 4 ms to minimize.
[2025-06-01 06:14:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2025-06-01 06:14:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 17 ms.
[2025-06-01 06:14:54] [INFO ] Added : 19 causal constraints over 5 iterations in 115 ms. Result :sat
Minimization took 35 ms.
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 14 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2025-06-01 06:14:54] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2025-06-01 06:14:54] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-01 06:14:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2025-06-01 06:14:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 13 ms.
[2025-06-01 06:14:54] [INFO ] Added : 19 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-01 06:14:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 11 ms.
[2025-06-01 06:14:54] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:14:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:14:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 6 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2025-06-01 06:14:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2025-06-01 06:14:55] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2025-06-01 06:14:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2025-06-01 06:14:55] [INFO ] Added : 6 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 18 ms.
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-01 06:14:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 8 ms.
[2025-06-01 06:14:55] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:14:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2025-06-01 06:14:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2025-06-01 06:14:55] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:14:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:14:56] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 15 ms.
[2025-06-01 06:14:56] [INFO ] Added : 18 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 06:14:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:14:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:14:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:14:56] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2025-06-01 06:14:56] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2025-06-01 06:14:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2025-06-01 06:14:56] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2025-06-01 06:14:56] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 13, 9, 36, 10, 9, 21, 19, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 13, 9, 64, 10, 9, 107, 5292, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 63
Applied a total of 4 rules in 31 ms. Remains 32 /34 variables (removed 2) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 32/34 places, 63/66 transitions.
[2025-06-01 06:14:57] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :[5, 6, 23, 10, 17, 6, 152, 12, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 13, 23, 64, 17, 9, 152, 5292, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:14:57] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 32 cols
[2025-06-01 06:14:57] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8, 13, 23, 64, 17, 9, 152, 5292, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 645 ms. (1547 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 3812 ms. (2360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5742, 5697, 3251, 75, 2027, 1025, 6466, 6966, 1008] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:15:01] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:01] [INFO ] Invariant cache hit.
[2025-06-01 06:15:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:15:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:15:01] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 06:15:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:15:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:01] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 8 ms.
[2025-06-01 06:15:01] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2025-06-01 06:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-01 06:15:01] [INFO ] Added : 4 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 06:15:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:15:01] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:02] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-01 06:15:02] [INFO ] Added : 4 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-01 06:15:02] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 14 ms.
[2025-06-01 06:15:02] [INFO ] Added : 15 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:15:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 189 ms
[2025-06-01 06:15:02] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 8 ms.
[2025-06-01 06:15:02] [INFO ] Added : 20 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:15:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2025-06-01 06:15:03] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2025-06-01 06:15:03] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2025-06-01 06:15:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2025-06-01 06:15:03] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:15:03] [INFO ] Added : 18 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:03] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-06-01 06:15:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-01 06:15:03] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2025-06-01 06:15:03] [INFO ] Added : 15 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:15:03] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2025-06-01 06:15:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 06:15:03] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:15:03] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-01 06:15:03] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 8 ms.
[2025-06-01 06:15:03] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2025-06-01 06:15:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-01 06:15:03] [INFO ] Added : 4 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:04] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:15:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 06:15:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2025-06-01 06:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-01 06:15:04] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:15:04] [INFO ] Added : 15 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5742, 5697, 3251, 75, 2027, 1025, 6466, 6966, 1008] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5742, 5697, 3251, 75, 2027, 81629, 565835, 7008, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 32/32 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-06-01 06:15:45] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:45] [INFO ] Invariant cache hit.
[2025-06-01 06:15:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-01 06:15:45] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:45] [INFO ] Invariant cache hit.
[2025-06-01 06:15:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:15:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2025-06-01 06:15:45] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-01 06:15:45] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:45] [INFO ] Invariant cache hit.
[2025-06-01 06:15:45] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/76 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 57/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 104 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 2934ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3122 ms. Remains : 32/32 places, 63/63 transitions.
[2025-06-01 06:15:48] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :[6, 5, 12, 10, 20, 6, 154, 8, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[5742, 5697, 3251, 75, 2027, 81629, 565835, 7008, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:15:48] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5742, 5697, 3251, 75, 2027, 81629, 565835, 7008, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000045 steps (2 resets) in 785 ms. (1272 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 4098 ms. (2195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5759, 5712, 3251, 77, 2027, 81629, 565835, 7008, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:15:53] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:15:53] [INFO ] Invariant cache hit.
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 06:15:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:15:53] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 5 ms.
[2025-06-01 06:15:53] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2025-06-01 06:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-06-01 06:15:53] [INFO ] Added : 4 causal constraints over 2 iterations in 64 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 8 ms.
[2025-06-01 06:15:53] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2025-06-01 06:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-01 06:15:53] [INFO ] Added : 4 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:53] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-06-01 06:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-01 06:15:53] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:15:53] [INFO ] Added : 15 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:15:53] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 191 ms
[2025-06-01 06:15:54] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:15:54] [INFO ] Added : 20 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:15:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2025-06-01 06:15:54] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:15:54] [INFO ] Added : 18 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-01 06:15:54] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:15:54] [INFO ] Added : 15 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 13 ms.
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:15:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2025-06-01 06:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-01 06:15:54] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 5 ms.
[2025-06-01 06:15:55] [INFO ] Added : 13 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 06:15:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:15:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:15:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2025-06-01 06:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-01 06:15:55] [INFO ] Added : 4 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 06:15:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:15:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:15:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:15:55] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-01 06:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-01 06:15:55] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:15:55] [INFO ] Added : 15 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5759, 5712, 3251, 77, 2027, 81629, 565835, 7008, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5759, 5712, 3251, 77, 2027, 81629, 757591, 565837, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-06-01 06:17:17] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:17:17] [INFO ] Invariant cache hit.
[2025-06-01 06:17:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 06:17:17] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:17:17] [INFO ] Invariant cache hit.
[2025-06-01 06:17:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:17:17] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2025-06-01 06:17:17] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-01 06:17:17] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:17:17] [INFO ] Invariant cache hit.
[2025-06-01 06:17:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/76 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 57/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 104 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 2598ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2773 ms. Remains : 32/32 places, 63/63 transitions.
[2025-06-01 06:17:20] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :[6, 6, 18, 12, 13, 7, 153, 7, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5759, 5712, 3251, 77, 2027, 81629, 757591, 565837, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:17:20] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:17:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5759, 5712, 3251, 77, 2027, 81629, 757591, 565837, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 750 ms. (1331 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 3651 ms. (2464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5759, 5743, 3251, 77, 2027, 81629, 757591, 565837, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:17:24] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:17:24] [INFO ] Invariant cache hit.
[2025-06-01 06:17:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 06:17:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:17:24] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-01 06:17:24] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2025-06-01 06:17:24] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2025-06-01 06:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-01 06:17:24] [INFO ] Added : 4 causal constraints over 2 iterations in 57 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 06:17:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:17:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 06:17:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 06:17:24] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2025-06-01 06:17:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2025-06-01 06:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-01 06:17:24] [INFO ] Added : 4 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-01 06:17:25] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2025-06-01 06:17:25] [INFO ] Added : 15 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 177 ms
[2025-06-01 06:17:25] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2025-06-01 06:17:25] [INFO ] Added : 20 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2025-06-01 06:17:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2025-06-01 06:17:25] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 5 ms.
[2025-06-01 06:17:25] [INFO ] Added : 18 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:17:25] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-01 06:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-01 06:17:26] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:17:26] [INFO ] Added : 15 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:26] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
[2025-06-01 06:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-01 06:17:26] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:17:26] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 06:17:26] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2025-06-01 06:17:26] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2025-06-01 06:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-01 06:17:26] [INFO ] Added : 4 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:17:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:17:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:17:26] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-01 06:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-01 06:17:26] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 5 ms.
[2025-06-01 06:17:26] [INFO ] Added : 15 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5759, 5743, 3251, 77, 2027, 81629, 757591, 565837, 1015] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5759, 5743, 3251, 77, 2027, 81629, 778567, 757594, 1545] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 32/32 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-06-01 06:19:16] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:19:16] [INFO ] Invariant cache hit.
[2025-06-01 06:19:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-01 06:19:16] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:19:16] [INFO ] Invariant cache hit.
[2025-06-01 06:19:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:19:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2025-06-01 06:19:16] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-01 06:19:16] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:19:16] [INFO ] Invariant cache hit.
[2025-06-01 06:19:16] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/76 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 57/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 104 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 3186ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3328 ms. Remains : 32/32 places, 63/63 transitions.
[2025-06-01 06:19:19] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :[2147483647, 2147483647, 2147483647, 9, 2147483647, 7, 2147483647, 2147483647, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, 77, +inf, 81629, +inf, +inf, 1545] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:19:19] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:19:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, 77, +inf, 81629, +inf, +inf, 1545] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000058 steps (2 resets) in 890 ms. (1122 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 1591 ms. (1884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77, 81629, 1545] Max Struct:[+inf, +inf, +inf]
[2025-06-01 06:19:22] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-06-01 06:19:22] [INFO ] Invariant cache hit.
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 06:19:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:19:22] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 134 ms
[2025-06-01 06:19:22] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2025-06-01 06:19:22] [INFO ] Added : 20 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-01 06:19:22] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:19:22] [INFO ] Added : 15 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:19:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:19:22] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-01 06:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-01 06:19:22] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-06-01 06:19:22] [INFO ] Added : 15 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77, 81629, 1545] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77, 81629, 1557] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Graph (complete) has 113 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 59
Applied a total of 5 rules in 12 ms. Remains 30 /32 variables (removed 2) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 30/32 places, 59/63 transitions.
[2025-06-01 06:19:55] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :[14, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[77, +inf, +inf] Max Struct:[+inf, +inf, +inf]
[2025-06-01 06:19:55] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2025-06-01 06:19:55] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[77, +inf, +inf] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000021 steps (2 resets) in 654 ms. (1526 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[+inf]
[2025-06-01 06:19:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:56] [INFO ] Invariant cache hit.
[2025-06-01 06:19:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:19:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 06:19:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:19:56] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:19:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:19:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:56] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 06:19:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:19:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-01 06:19:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2025-06-01 06:19:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2025-06-01 06:19:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2025-06-01 06:19:56] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2025-06-01 06:19:56] [INFO ] Added : 22 causal constraints over 6 iterations in 40 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
[2025-06-01 06:19:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[77] Max Struct:[+inf]
[2025-06-01 06:19:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[77] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[+inf]
[2025-06-01 06:19:58] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:58] [INFO ] Invariant cache hit.
[2025-06-01 06:19:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:19:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:19:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:19:58] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:19:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:19:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:19:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:19:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:19:58] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-06-01 06:19:58] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-06-01 06:19:58] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2025-06-01 06:19:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2025-06-01 06:19:58] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 7 ms.
[2025-06-01 06:19:58] [INFO ] Added : 22 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-06-01 06:19:58] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:58] [INFO ] Invariant cache hit.
[2025-06-01 06:19:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 06:19:58] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:58] [INFO ] Invariant cache hit.
[2025-06-01 06:19:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:19:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2025-06-01 06:19:58] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-01 06:19:58] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:19:58] [INFO ] Invariant cache hit.
[2025-06-01 06:19:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2411 ms. Remains : 30/30 places, 59/59 transitions.
[2025-06-01 06:20:01] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[14]
Current structural bounds on expressions (after cover walk) : Max Seen:[77] Max Struct:[+inf]
RANDOM walk for 40068 steps (8 resets) in 291 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
[2025-06-01 06:20:01] [INFO ] Flatten gal took : 44 ms
[2025-06-01 06:20:01] [INFO ] Flatten gal took : 22 ms
[2025-06-01 06:20:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9190133406684274564.gal : 10 ms
[2025-06-01 06:20:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4809280399454209615.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9190133406684274564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4809280399454209615.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4809280399454209615.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 132
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5312 after 485149
Interrupted probabilistic random walk after 2169112 steps, run timeout after 3001 ms. (steps per millisecond=722 ) properties seen :0 out of 1
Probabilistic random walk after 2169112 steps, saw 1459651 distinct states, run finished after 3009 ms. (steps per millisecond=720 ) properties seen :0
[2025-06-01 06:20:04] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:04] [INFO ] Invariant cache hit.
[2025-06-01 06:20:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 454 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=151 )
Parikh walk visited 1 properties in 11 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[77] Max Struct:[+inf]
Starting property specific reduction for FunctionPointer-PT-a064-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 06:20:04] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[+inf]
[2025-06-01 06:20:04] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:04] [INFO ] Invariant cache hit.
[2025-06-01 06:20:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:20:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:20:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:20:04] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:20:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:20:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:20:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:20:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:20:04] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2025-06-01 06:20:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
[2025-06-01 06:20:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-01 06:20:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2025-06-01 06:20:04] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 6 ms.
[2025-06-01 06:20:04] [INFO ] Added : 22 causal constraints over 6 iterations in 61 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[75] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[75] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 59/59 transitions.
[2025-06-01 06:20:04] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[10]
Current structural bounds on expressions (after cover walk) : Max Seen:[75] Max Struct:[+inf]
[2025-06-01 06:20:05] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[75] Max Struct:[+inf]
RANDOM walk for 1000044 steps (2 resets) in 509 ms. (1960 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 528 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[+inf]
[2025-06-01 06:20:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:06] [INFO ] Invariant cache hit.
[2025-06-01 06:20:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:20:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 06:20:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:20:06] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:20:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:20:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:20:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 06:20:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:20:06] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-01 06:20:06] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2025-06-01 06:20:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2025-06-01 06:20:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2025-06-01 06:20:06] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 5 ms.
[2025-06-01 06:20:06] [INFO ] Added : 22 causal constraints over 6 iterations in 42 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[75] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[75] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-06-01 06:20:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:06] [INFO ] Invariant cache hit.
[2025-06-01 06:20:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-01 06:20:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:06] [INFO ] Invariant cache hit.
[2025-06-01 06:20:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:20:06] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2025-06-01 06:20:06] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-01 06:20:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:06] [INFO ] Invariant cache hit.
[2025-06-01 06:20:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 2237ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2363 ms. Remains : 30/30 places, 59/59 transitions.
[2025-06-01 06:20:08] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[75] Max Struct:[+inf]
RANDOM walk for 40143 steps (8 resets) in 92 ms. (431 steps per ms) remains 1/1 properties
[2025-06-01 06:20:08] [INFO ] Flatten gal took : 56 ms
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2025-06-01 06:20:08] [INFO ] Flatten gal took : 20 ms
[2025-06-01 06:20:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3706791423982450885.gal : 5 ms
[2025-06-01 06:20:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5624278119781927941.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3706791423982450885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5624278119781927941.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5624278119781927941.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 132
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5312 after 485149
Interrupted probabilistic random walk after 2482139 steps, run timeout after 3001 ms. (steps per millisecond=827 ) properties seen :0 out of 1
Probabilistic random walk after 2482139 steps, saw 1674527 distinct states, run finished after 3001 ms. (steps per millisecond=827 ) properties seen :0
[2025-06-01 06:20:11] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-06-01 06:20:11] [INFO ] Invariant cache hit.
[2025-06-01 06:20:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 444 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=222 )
Parikh walk visited 1 properties in 1 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[75] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a064-UpperBounds-08 in 7548 ms.
[2025-06-01 06:20:12] [INFO ] Flatten gal took : 11 ms
[2025-06-01 06:20:12] [INFO ] Applying decomposition
[2025-06-01 06:20:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15908265349504776732.txt' '-o' '/tmp/graph15908265349504776732.bin' '-w' '/tmp/graph15908265349504776732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15908265349504776732.bin' '-l' '-1' '-v' '-w' '/tmp/graph15908265349504776732.weights' '-q' '0' '-e' '0.001'
[2025-06-01 06:20:12] [INFO ] Decomposing Gal with order
[2025-06-01 06:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 06:20:12] [INFO ] Removed a total of 91 redundant transitions.
[2025-06-01 06:20:12] [INFO ] Flatten gal took : 54 ms
[2025-06-01 06:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 9 ms.
[2025-06-01 06:20:12] [INFO ] Time to serialize gal into /tmp/UpperBounds5910317492410509937.gal : 5 ms
[2025-06-01 06:20:12] [INFO ] Time to serialize properties into /tmp/UpperBounds16547959668376772443.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5910317492410509937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16547959668376772443.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16547959668376772443.prop.
Detected timeout of ITS tools.
[2025-06-01 06:41:58] [INFO ] Flatten gal took : 6 ms
[2025-06-01 06:41:58] [INFO ] Time to serialize gal into /tmp/UpperBounds18083109115538655027.gal : 2 ms
[2025-06-01 06:41:58] [INFO ] Time to serialize properties into /tmp/UpperBounds17135074927233735164.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18083109115538655027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17135074927233735164.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17135074927233735164.prop.
ITS-tools command line returned an error code 137
[2025-06-01 07:03:18] [INFO ] Flatten gal took : 7 ms
[2025-06-01 07:03:18] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-01 07:03:18] [INFO ] Transformed 30 places.
[2025-06-01 07:03:18] [INFO ] Transformed 59 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 07:03:18] [INFO ] Time to serialize gal into /tmp/UpperBounds8129912170700807081.gal : 12 ms
[2025-06-01 07:03:18] [INFO ] Time to serialize properties into /tmp/UpperBounds13152609559877846983.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8129912170700807081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13152609559877846983.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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="FunctionPointer-PT-a064"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FunctionPointer-PT-a064, 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 r111-smll-174867015800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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