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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.4K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 16K 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-0005-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717217909099

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-0005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:30] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-06-01 04:58:30] [INFO ] Transformed 26 places.
[2024-06-01 04:58:30] [INFO ] Transformed 41 transitions.
[2024-06-01 04:58:30] [INFO ] Parsed PT model containing 26 places and 41 transitions and 117 arcs in 142 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-0005-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 5, 2, 2, 5, 0, 0, 2, 0, 0, 0, 0, 0, 5, 5] 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, 5, 2, 2, 5, 0, 0, 2, 0, 0, 0, 0, 0, 5, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 41 rows 25 cols
[2024-06-01 04:58:30] [INFO ] Computed 5 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 5, 2, 2, 5, 0, 0, 2, 0, 0, 0, 0, 0, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 10000 steps (7 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 150011 steps (30 resets) in 127 ms. (1171 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 5, 7, 7, 5, 6, 6, 7, 6, 7, 7, 6, 7, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 04:58:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 04:58:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 04:58:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:58:30] [INFO ] [Nat]Added 5 Read/Feed constraints in 35 ms returned sat
[2024-06-01 04:58:30] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:30] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:58:31] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 04:58:31] [INFO ] Added : 17 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 8 ms to minimize.
[2024-06-01 04:58:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 04:58:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:58:31] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 04:58:31] [INFO ] Added : 17 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 30 ms returned sat
[2024-06-01 04:58:31] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:31] [INFO ] Added : 21 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:31] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 04:58:31] [INFO ] Added : 18 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 04:58:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:31] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:32] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 39 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:32] [INFO ] Added : 20 causal constraints over 5 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 04:58:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:58:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Minimization took 6 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2024-06-01 04:58:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:58:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:32] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 36 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:32] [INFO ] Added : 14 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 35 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 04:58:32] [INFO ] Added : 19 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 18 ms returned sat
[2024-06-01 04:58:32] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 04:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-06-01 04:58:32] [INFO ] Added : 21 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 5, 7, 7, 5, 6, 6, 7, 6, 7, 7, 6, 7, 5, 5] Max Struct:[8, 8, 7, 7, 8, 8, 8, 8, 8, 7, 7, 8, 8, 8, 8]
FORMULA JoinFreeModules-PT-0005-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 7, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 11 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 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 25 transition count 40
Applied a total of 1 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 40/41 (removed 1) transitions.
Running 30 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:58:33] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 04:58:33] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 1124ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1160 ms. Remains : 25/25 places, 40/41 transitions.
[2024-06-01 04:58:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 7, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 1000000 steps (910 resets) in 1173 ms. (851 steps per ms)
BEST_FIRST walk for 11000009 steps (22 resets) in 4995 ms. (2201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 7, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2024-06-01 04:58:40] [INFO ] Invariant cache hit.
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:58:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:58:40] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 04:58:40] [INFO ] Added : 10 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 04:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:40] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:40] [INFO ] Added : 18 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2024-06-01 04:58:40] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:40] [INFO ] Added : 21 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:41] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:41] [INFO ] Added : 9 causal constraints over 2 iterations in 57 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:41] [INFO ] Added : 12 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 28 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:41] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 04:58:41] [INFO ] Added : 20 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:58:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 04:58:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 04:58:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:58:41] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 04:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-06-01 04:58:41] [INFO ] Added : 29 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 04:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:58:42] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:42] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 7, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 7, 8, 8]
FORMULA JoinFreeModules-PT-0005-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 40/40 transitions.
[2024-06-01 04:58:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 1000001 steps (923 resets) in 1013 ms. (986 steps per ms)
BEST_FIRST walk for 10000008 steps (20 resets) in 4475 ms. (2234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2024-06-01 04:58:47] [INFO ] Invariant cache hit.
[2024-06-01 04:58:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:58:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:58:47] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:47] [INFO ] Added : 10 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:58:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:47] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:47] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:48] [INFO ] Added : 21 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 13 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:48] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 04:58:48] [INFO ] Added : 9 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:58:48] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:48] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:58:48] [INFO ] Added : 20 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2024-06-01 04:58:48] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 04:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-06-01 04:58:48] [INFO ] Added : 29 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:58:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:58:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:58:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:58:49] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:58:49] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:58:49] [INFO ] Added : 17 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 5, 5, 6, 6, 7, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 04:58:49] [INFO ] Invariant cache hit.
[2024-06-01 04:58:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 04:58:49] [INFO ] Invariant cache hit.
[2024-06-01 04:58:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:58:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 04:58:49] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 04:58:49] [INFO ] Invariant cache hit.
[2024-06-01 04:58:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 04:58:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:58:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 04:58:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 04:58:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:58:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 902ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 974 ms. Remains : 25/25 places, 40/40 transitions.
RANDOM walk for 40001 steps (34 resets) in 841 ms. (47 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 226550 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 20
Probabilistic random walk after 226550 steps, saw 132001 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 04:58:53] [INFO ] Invariant cache hit.
[2024-06-01 04:58:53] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
Problem MAX2 is UNSAT
Problem MAX5 is UNSAT
Problem MIN5 is UNSAT
Problem MAX8 is UNSAT
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/11 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/36 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/41 constraints. Problems are: Problem set: 8 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 41 constraints, problems are : Problem set: 8 solved, 12 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/11 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/36 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/41 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 12/53 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 53 constraints, problems are : Problem set: 8 solved, 12 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 12/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 519ms problems are : Problem set: 8 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5724 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Running 30 sub problems to find dead transitions.
[2024-06-01 04:58:59] [INFO ] Invariant cache hit.
[2024-06-01 04:58:59] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 04:58:59] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 04:58:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:58:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 04:58:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:59:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 25/25 places, 40/40 transitions.
RANDOM walk for 40001 steps (31 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 318391 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 12
Probabilistic random walk after 318391 steps, saw 142973 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 04:59:04] [INFO ] Invariant cache hit.
[2024-06-01 04:59:04] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 12 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 04:59:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 49 constraints, problems are : Problem set: 0 solved, 12 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 7929 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 04:59:12] [INFO ] Invariant cache hit.
[2024-06-01 04:59:12] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 04:59:12] [INFO ] Invariant cache hit.
[2024-06-01 04:59:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:12] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 04:59:12] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 04:59:12] [INFO ] Invariant cache hit.
[2024-06-01 04:59:12] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 4 ms to minimize.
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 924 ms. Remains : 25/25 places, 40/40 transitions.
FORMULA JoinFreeModules-PT-0005-UpperBounds-07 7 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0005-UpperBounds-00 7 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[5, 5, 6, 6, 6, 6, 5, 5] Max Struct:[8, 8, 8, 8, 8, 8, 8, 8]
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 10000 steps (9 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
[2024-06-01 04:59:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:13] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:59:13] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:13] [INFO ] Added : 18 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 4 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:13] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:13] [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:13] [INFO ] Deduced a trap composed of 3 places in 16 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 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]
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 72 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 154ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (4507 resets) in 389 ms. (2564 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:[5] Max Struct:[8]
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:14] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:59:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 04:59:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:59:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:14] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
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 0 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:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 04:59:14] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [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:14] [INFO ] Deduced a trap composed of 3 places in 18 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 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 152ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (195 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 6 ms. (steps per millisecond=61 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 3 ms. (steps per millisecond=123 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-01 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-0005-UpperBounds-01 in 1194 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[5] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:14] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 10001 steps (9 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:14] [INFO ] Invariant cache hit.
[2024-06-01 04:59:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:59:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:59:14] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:14] [INFO ] Added : 21 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:15] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:15] [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:15] [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 83 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 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]
After SMT, in 169ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (4530 resets) in 376 ms. (2652 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:[8]
[2024-06-01 04:59:15] [INFO ] Invariant cache hit.
[2024-06-01 04:59:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:15] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:59:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:15] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:15] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
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 0 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:15] [INFO ] Invariant cache hit.
[2024-06-01 04:59:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 04:59:15] [INFO ] Invariant cache hit.
[2024-06-01 04:59:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 04:59:15] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:15] [INFO ] Invariant cache hit.
[2024-06-01 04:59:15] [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:15] [INFO ] Deduced a trap composed of 3 places in 17 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 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 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]
After SMT, in 151ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (173 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 2 ms. (steps per millisecond=185 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-04 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-0005-UpperBounds-04 in 1172 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-05
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:16] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (8 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:16] [INFO ] Invariant cache hit.
[2024-06-01 04:59:16] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:59:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2024-06-01 04:59:16] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:16] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:16] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:16] [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:16] [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 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 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]
After SMT, in 160ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (4429 resets) in 381 ms. (2617 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 211 ms. (4716 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:16] [INFO ] Invariant cache hit.
[2024-06-01 04:59:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:16] [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:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
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:17] [INFO ] Invariant cache hit.
[2024-06-01 04:59:17] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 04:59:17] [INFO ] Invariant cache hit.
[2024-06-01 04:59:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 04:59:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:17] [INFO ] Invariant cache hit.
[2024-06-01 04:59:17] [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:17] [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 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 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]
After SMT, in 152ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40003 steps (186 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 2 ms. (steps per millisecond=185 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-05 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-0005-UpperBounds-05 in 1225 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:17] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (8 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:17] [INFO ] Invariant cache hit.
[2024-06-01 04:59:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:59:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2024-06-01 04:59:17] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:17] [INFO ] Added : 9 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:17] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:17] [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:17] [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 70 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 148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (4504 resets) in 381 ms. (2617 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 216 ms. (4608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:18] [INFO ] Invariant cache hit.
[2024-06-01 04:59:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:18] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:18] [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:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
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:18] [INFO ] Invariant cache hit.
[2024-06-01 04:59:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 04:59:18] [INFO ] Invariant cache hit.
[2024-06-01 04:59:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 04:59:18] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:18] [INFO ] Invariant cache hit.
[2024-06-01 04:59:18] [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:18] [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 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 70 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 142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (184 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 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 : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 2 ms. (steps per millisecond=185 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-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-0005-UpperBounds-06 in 1218 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:18] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (8 resets) in 11 ms. (833 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:[6] Max Struct:[8]
[2024-06-01 04:59:18] [INFO ] Invariant cache hit.
[2024-06-01 04:59:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:59:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 20 ms returned sat
[2024-06-01 04:59:18] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:18] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:18] [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:18] [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 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 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]
After SMT, in 151ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (4398 resets) in 383 ms. (2604 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 217 ms. (4587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:19] [INFO ] Invariant cache hit.
[2024-06-01 04:59:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:19] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:19] [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:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
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 0 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:19] [INFO ] Invariant cache hit.
[2024-06-01 04:59:19] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 04:59:19] [INFO ] Invariant cache hit.
[2024-06-01 04:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 04:59:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:19] [INFO ] Invariant cache hit.
[2024-06-01 04:59:19] [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:19] [INFO ] Deduced a trap composed of 3 places in 12 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 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 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 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 188 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (189 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 1 ms. (steps per millisecond=371 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-08 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-0005-UpperBounds-08 in 1222 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-11
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:19] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (10 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:19] [INFO ] Invariant cache hit.
[2024-06-01 04:59:19] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:59:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:59:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:59:19] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:19] [INFO ] Added : 20 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:19] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:19] [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:19] [INFO ] Deduced a trap composed of 3 places in 18 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 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]
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 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]
After SMT, in 158ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (4504 resets) in 387 ms. (2577 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 216 ms. (4608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2024-06-01 04:59:20] [INFO ] Invariant cache hit.
[2024-06-01 04:59:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:20] [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:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
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:20] [INFO ] Invariant cache hit.
[2024-06-01 04:59:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 04:59:20] [INFO ] Invariant cache hit.
[2024-06-01 04:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 04:59:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:20] [INFO ] Invariant cache hit.
[2024-06-01 04:59:20] [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:20] [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 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 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]
After SMT, in 152ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40002 steps (168 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 1 ms. (steps per millisecond=371 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-11 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-0005-UpperBounds-11 in 1263 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[5] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:20] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 10000 steps (8 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:20] [INFO ] Invariant cache hit.
[2024-06-01 04:59:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 04:59:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:59:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2024-06-01 04:59:21] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:59:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 04:59:21] [INFO ] Added : 29 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 04:59:21] [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:21] [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 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 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 157ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (4412 resets) in 394 ms. (2531 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 155 ms. (6410 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:21] [INFO ] Invariant cache hit.
[2024-06-01 04:59:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 04:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:21] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 04:59:21] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
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 0 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:21] [INFO ] Invariant cache hit.
[2024-06-01 04:59:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 04:59:21] [INFO ] Invariant cache hit.
[2024-06-01 04:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 04:59:21] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:21] [INFO ] Invariant cache hit.
[2024-06-01 04:59:21] [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:22] [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 72 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 83 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 157ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (185 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 25 ms. (1538 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 2 ms. (steps per millisecond=185 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-UpperBounds-13 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-0005-UpperBounds-13 in 1231 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[5] Max Struct:[8]
// Phase 1: matrix 40 rows 25 cols
[2024-06-01 04:59:22] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 10000 steps (8 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2024-06-01 04:59:22] [INFO ] Invariant cache hit.
[2024-06-01 04:59:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:59:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 04:59:22] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2024-06-01 04:59:22] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:59:22] [INFO ] Added : 17 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 04:59:22] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 04:59:22] [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:22] [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 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 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 155ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 5/25 places, 8/40 transitions.
[2024-06-01 04:59:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (4385 resets) in 384 ms. (2597 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:[8]
[2024-06-01 04:59:23] [INFO ] Invariant cache hit.
[2024-06-01 04:59:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 04:59:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:23] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:59:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 04:59:23] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 04:59:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:59:23] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:59:23] [INFO ] Added : 5 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
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:23] [INFO ] Invariant cache hit.
[2024-06-01 04:59:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 04:59:23] [INFO ] Invariant cache hit.
[2024-06-01 04:59:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:59:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 04:59:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 04:59:23] [INFO ] Invariant cache hit.
[2024-06-01 04:59:23] [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:23] [INFO ] Deduced a trap composed of 3 places in 18 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 88 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 168ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (198 resets) in 63 ms. (625 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
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
Probably explored full state space saw : 103 states, properties seen :0
Probabilistic random walk after 371 steps, saw 103 distinct states, run finished after 4 ms. (steps per millisecond=92 ) properties seen :0
Explored full state space saw : 103 states, properties seen :0
Exhaustive walk after 371 steps, saw 103 distinct states, run finished after 2 ms. (steps per millisecond=185 ) properties seen :0
FORMULA JoinFreeModules-PT-0005-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-0005-UpperBounds-14 in 1177 ms.
[2024-06-01 04:59:23] [INFO ] Flatten gal took : 121 ms
Total runtime 53266 ms.
ITS solved all properties within timeout

BK_STOP 1717217963546

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0005"
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-0005, 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-171649611900021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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