Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717217881220

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:02] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-06-01 04:58:02] [INFO ] Transformed 21 places.
[2024-06-01 04:58:02] [INFO ] Transformed 33 transitions.
[2024-06-01 04:58:02] [INFO ] Parsed PT model containing 21 places and 33 transitions and 94 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 2, 0, 2, 4, 0, 0, 1, 0, 1, 4, 4, 2, 1, 0] Max Struct:[+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, 2, 0, 2, 4, 0, 0, 1, 0, 1, 4, 4, 2, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 33 rows 20 cols
[2024-06-01 04:58:02] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0, 2, 4, 0, 0, 1, 0, 1, 4, 4, 2, 1, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 10000 steps (36 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 150011 steps (51 resets) in 142 ms. (1049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 6, 6, 4, 6, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
[2024-06-01 04:58:02] [INFO ] Invariant cache hit.
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 04:58:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:58:03] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:03] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 7 ms to minimize.
[2024-06-01 04:58:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 13 ms returned sat
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 04:58:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:58:03] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:58:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 51 ms
Minimization took 6 ms.
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:58:03] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:03] [INFO ] Added : 5 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:03] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:58:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-06-01 04:58:04] [INFO ] Added : 18 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 04:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 04:58:04] [INFO ] Added : 15 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Added : 17 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 04:58:04] [INFO ] Added : 16 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:04] [INFO ] Added : 6 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:58:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 04:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 04:58:04] [INFO ] Added : 15 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 6, 6, 4, 6, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 6, 6, 6, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7]
FORMULA JoinFreeModules-PT-0004-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 4, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 33/33 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 1 place count 20 transition count 32
Applied a total of 1 rules in 27 ms. Remains 20 /20 variables (removed 0) and now considering 32/33 (removed 1) transitions.
Running 24 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:58:05] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 04:58:05] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:58:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 04:58:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 04:58:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 04:58:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 20/20 places, 32/33 transitions.
[2024-06-01 04:58:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 4, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 1000000 steps (3683 resets) in 885 ms. (1128 steps per ms)
BEST_FIRST walk for 11000007 steps (2195 resets) in 3530 ms. (3115 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 4, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
[2024-06-01 04:58:10] [INFO ] Invariant cache hit.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:58:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:58:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:10] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:58:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:10] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:58:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:58:10] [INFO ] Added : 17 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:58:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 04:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-06-01 04:58:10] [INFO ] Added : 23 causal constraints over 6 iterations in 81 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:58:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:58:10] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:11] [INFO ] Added : 10 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:58:11] [INFO ] Added : 17 causal constraints over 5 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-06-01 04:58:11] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:11] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:11] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:58:11] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 67 ms
[2024-06-01 04:58:11] [INFO ] Added : 23 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 4, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 4, 6, 5, 6, 5, 4, 4, 6, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 04:58:11] [INFO ] Invariant cache hit.
[2024-06-01 04:58:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 04:58:11] [INFO ] Invariant cache hit.
[2024-06-01 04:58:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:58:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 04:58:11] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 04:58:11] [INFO ] Invariant cache hit.
[2024-06-01 04:58:11] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
[2024-06-01 04:58:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 826 ms. Remains : 20/20 places, 32/32 transitions.
RANDOM walk for 40000 steps (121 resets) in 1340 ms. (29 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 439645 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 22
Probabilistic random walk after 439645 steps, saw 126963 distinct states, run finished after 3005 ms. (steps per millisecond=146 ) properties seen :0
[2024-06-01 04:58:16] [INFO ] Invariant cache hit.
[2024-06-01 04:58:16] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 04:58:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
[2024-06-01 04:58:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem MAX3 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MIN8 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 2/3 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/20 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 16 unsolved
[2024-06-01 04:58:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 04:58:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX6 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 9 solved, 13 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 9 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 11/20 variables, 4/5 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 3/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 13/45 constraints. Problems are: Problem set: 9 solved, 13 unsolved
[2024-06-01 04:58:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX5 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 1/46 constraints. Problems are: Problem set: 10 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/46 constraints. Problems are: Problem set: 10 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/46 constraints. Problems are: Problem set: 10 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 46 constraints, problems are : Problem set: 10 solved, 12 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/22 constraints, Known Traps: 5/5 constraints]
After SMT, in 1445ms problems are : Problem set: 10 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 33172 ms.
Support contains 9 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Running 24 sub problems to find dead transitions.
[2024-06-01 04:58:50] [INFO ] Invariant cache hit.
[2024-06-01 04:58:50] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 758ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 20/20 places, 32/32 transitions.
RANDOM walk for 40001 steps (145 resets) in 209 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (24 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (19 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (27 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (27 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (22 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 436315 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 12
Probabilistic random walk after 436315 steps, saw 125475 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2024-06-01 04:58:55] [INFO ] Invariant cache hit.
[2024-06-01 04:58:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 04:58:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 0 solved, 12 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 04:58:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 32/52 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 12 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 5419 ms.
Support contains 9 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 04:59:00] [INFO ] Invariant cache hit.
[2024-06-01 04:59:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 04:59:00] [INFO ] Invariant cache hit.
[2024-06-01 04:59:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 04:59:00] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 04:59:00] [INFO ] Invariant cache hit.
[2024-06-01 04:59:00] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 783ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 20/20 places, 32/32 transitions.
FORMULA JoinFreeModules-PT-0004-UpperBounds-13 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-00 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[4, 6, 5, 6, 5, 4, 4, 5, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7]
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 10000 steps (45 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:01] [INFO ] Invariant cache hit.
[2024-06-01 04:59:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:59:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:59:01] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:01] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 7 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:01] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (14190 resets) in 335 ms. (2976 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
[2024-06-01 04:59:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:02] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:02] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:02] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
[2024-06-01 04:59:02] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
[2024-06-01 04:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 04:59:02] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
[2024-06-01 04:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (603 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 7 ms. (steps per millisecond=29 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 1 ms. (steps per millisecond=207 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-04 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-04 in 1127 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-06
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:02] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10001 steps (37 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (5 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-06-01 04:59:02] [INFO ] Invariant cache hit.
[2024-06-01 04:59:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:02] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2024-06-01 04:59:02] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:02] [INFO ] Added : 17 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:02] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 164ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (14094 resets) in 318 ms. (3134 steps per ms)
BEST_FIRST walk for 1000001 steps (142857 resets) in 162 ms. (6134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
[2024-06-01 04:59:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:03] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
[2024-06-01 04:59:03] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
[2024-06-01 04:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:03] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 04:59:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
[2024-06-01 04:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (535 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 4 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 2 ms. (steps per millisecond=103 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-06 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-06 in 1103 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:03] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 10000 steps (34 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:03] [INFO ] Invariant cache hit.
[2024-06-01 04:59:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 04:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-06-01 04:59:04] [INFO ] Added : 23 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:04] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (14309 resets) in 324 ms. (3076 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 04:59:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:04] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 04:59:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (593 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 5 ms. (steps per millisecond=41 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 2 ms. (steps per millisecond=103 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-08 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08 in 1135 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-09
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:05] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (38 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
[2024-06-01 04:59:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:59:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:59:05] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:05] [INFO ] Added : 9 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:05] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (14082 resets) in 319 ms. (3125 steps per ms)
BEST_FIRST walk for 1000001 steps (142857 resets) in 169 ms. (5882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
[2024-06-01 04:59:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:05] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
[2024-06-01 04:59:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
[2024-06-01 04:59:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 04:59:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:05] [INFO ] Invariant cache hit.
[2024-06-01 04:59:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (604 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 4 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 1 ms. (steps per millisecond=207 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-09 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-09 in 1069 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:06] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 10000 steps (40 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:06] [INFO ] Invariant cache hit.
[2024-06-01 04:59:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:06] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:06] [INFO ] Added : 10 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:06] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (14122 resets) in 320 ms. (3115 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:06] [INFO ] Invariant cache hit.
[2024-06-01 04:59:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:06] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:59:06] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:06] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:06] [INFO ] Invariant cache hit.
[2024-06-01 04:59:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
[2024-06-01 04:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 04:59:07] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
[2024-06-01 04:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (587 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 4 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 2 ms. (steps per millisecond=103 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-10 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-10 in 1086 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[4] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:07] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 10000 steps (30 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
[2024-06-01 04:59:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:59:07] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:07] [INFO ] Added : 17 causal constraints over 5 iterations in 19 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:07] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (13940 resets) in 329 ms. (3030 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 156 ms. (6369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
[2024-06-01 04:59:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:59:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:08] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
[2024-06-01 04:59:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
[2024-06-01 04:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 04:59:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
[2024-06-01 04:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (576 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 5 ms. (steps per millisecond=41 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 2 ms. (steps per millisecond=103 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-11 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-11 in 1069 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[4] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:08] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 10000 steps (34 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
[2024-06-01 04:59:08] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:59:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 11 ms returned sat
[2024-06-01 04:59:08] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2024-06-01 04:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 04:59:08] [INFO ] Added : 17 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (14286 resets) in 320 ms. (3115 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 154 ms. (6451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
[2024-06-01 04:59:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:09] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:09] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
[2024-06-01 04:59:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 04:59:09] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (617 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 5 ms. (steps per millisecond=41 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 1 ms. (steps per millisecond=207 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-12 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-12 in 1063 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:09] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 10000 steps (36 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
[2024-06-01 04:59:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:09] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:09] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:09] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:09] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (14078 resets) in 315 ms. (3164 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 142 ms. (6993 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:10] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:10] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 04:59:10] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (524 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 3 ms. (steps per millisecond=69 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 1 ms. (steps per millisecond=207 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-14 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-14 in 995 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 32 rows 20 cols
[2024-06-01 04:59:10] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (36 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (6 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 04:59:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:59:10] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 7 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 82 ms
[2024-06-01 04:59:10] [INFO ] Added : 23 causal constraints over 6 iterations in 109 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:10] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 150ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 5/20 places, 8/32 transitions.
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (14067 resets) in 317 ms. (3144 steps per ms)
BEST_FIRST walk for 1000001 steps (142857 resets) in 161 ms. (6172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:11] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:11] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-06-01 04:59:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (602 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Probably explored full state space saw : 62 states, properties seen :0
Probabilistic random walk after 207 steps, saw 62 distinct states, run finished after 3 ms. (steps per millisecond=69 ) properties seen :0
Explored full state space saw : 62 states, properties seen :0
Exhaustive walk after 207 steps, saw 62 distinct states, run finished after 2 ms. (steps per millisecond=103 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-15 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15 in 1165 ms.
[2024-06-01 04:59:11] [INFO ] Flatten gal took : 111 ms
Total runtime 69227 ms.
ITS solved all properties within timeout

BK_STOP 1717217951721

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0004, 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 r504-tall-171649611800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;