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.r245-tall-171654350600757.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 greatspnxred
Input is PGCD-PT-D02N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350600757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 11 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.6K May 18 16:43 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 PGCD-PT-D02N100-UpperBounds-00
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-01
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-02
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-03
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-04
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-05
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-06
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-07
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-08
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-09
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-10
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-11
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-12
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-13
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-14
FORMULA_NAME PGCD-PT-D02N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716706032079

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 06:47:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 06:47:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 06:47:13] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-26 06:47:13] [INFO ] Transformed 9 places.
[2024-05-26 06:47:13] [INFO ] Transformed 9 transitions.
[2024-05-26 06:47:13] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 7
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 100, 1, 100, 100] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 100, 1, 100, 100] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 06:47:13] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 100, 1, 100, 100] Max Struct:[303, 303, 303, 303, 303, 303, 303]
RANDOM walk for 10010 steps (2 resets) in 12 ms. (770 steps per ms)
BEST_FIRST walk for 70005 steps (14 resets) in 65 ms. (1060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[123, 107, 123, 201, 119, 201, 201] Max Struct:[303, 303, 303, 303, 303, 303, 303]
[2024-05-26 06:47:13] [INFO ] Invariant cache hit.
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 06:47:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2024-05-26 06:47:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:47:13] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 06:47:13] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 15 ms.
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:47:13] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 06:47:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 7 ms to minimize.
[2024-05-26 06:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-26 06:47:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 14 ms.
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:14] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:47:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 11 ms.
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 06:47:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-26 06:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-26 06:47:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[123, 107, 123, 201, 119, 201, 201] Max Struct:[303, 303, 303, 303, 303, 303, 303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 301, 297, 295, 300, 297, 297] Max Struct:[303, 303, 303, 303, 303, 303, 303]
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:14] [INFO ] Invariant cache hit.
[2024-05-26 06:47:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 06:47:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297, 301, 297, 295, 300, 297, 297] Max Struct:[303, 303, 303, 303, 303, 303, 303]
RANDOM walk for 1000072 steps (2 resets) in 161 ms. (6173 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 1689 ms. (4142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297, 301, 297, 295, 300, 297, 297] Max Struct:[303, 303, 303, 303, 303, 303, 303]
[2024-05-26 06:47:16] [INFO ] Invariant cache hit.
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 06:47:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:47:16] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:16] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:16] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:16] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:16] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-26 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-26 06:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-26 06:47:17] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:17] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:17] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:17] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297, 301, 297, 295, 300, 297, 297] Max Struct:[303, 301, 303, 303, 303, 303, 303]
FORMULA PGCD-PT-D02N100-UpperBounds-03 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-05 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-07 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-09 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-01 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[300, 300, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 06:47:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[300, 300, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
RANDOM walk for 1000071 steps (2 resets) in 128 ms. (7752 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 1340 ms. (4474 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[300, 300, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
[2024-05-26 06:47:18] [INFO ] Invariant cache hit.
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 06:47:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:18] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 06:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:18] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 06:47:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:18] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:18] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2024-05-26 06:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-26 06:47:19] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:19] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:19] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:19] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[300, 300, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[301, 301, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:19] [INFO ] Invariant cache hit.
[2024-05-26 06:47:19] [INFO ] Implicit Places using invariants in 29 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 7/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35 ms. Remains : 7/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-26 06:47:19] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[301, 301, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
RANDOM walk for 1000037 steps (2 resets) in 108 ms. (9174 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 1209 ms. (4958 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[301, 301, 299, 300, 299, 297] Max Struct:[303, 303, 303, 303, 303, 303]
[2024-05-26 06:47:20] [INFO ] Invariant cache hit.
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned unsat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:20] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:20] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:20] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 06:47:20] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:20] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[301, 301, 299, 300, 299, 297] Max Struct:[301, 301, 303, 303, 303, 303]
FORMULA PGCD-PT-D02N100-UpperBounds-15 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-02 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-04 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N100-UpperBounds-00 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299, 301, 299, 297] Max Struct:[303, 303, 303, 303]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 7/7 places, 9/9 transitions.
[2024-05-26 06:47:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299, 301, 299, 297] Max Struct:[303, 303, 303, 303]
RANDOM walk for 1000072 steps (2 resets) in 112 ms. (8850 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 758 ms. (5270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299, 301, 299, 297] Max Struct:[303, 303, 303, 303]
[2024-05-26 06:47:21] [INFO ] Invariant cache hit.
[2024-05-26 06:47:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:21] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned unsat
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 06:47:22] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:22] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299, 301, 299, 297] Max Struct:[303, 301, 303, 303]
FORMULA PGCD-PT-D02N100-UpperBounds-08 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299, 299, 297] Max Struct:[303, 303, 303]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 7/7 places, 9/9 transitions.
[2024-05-26 06:47:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299, 299, 297] Max Struct:[303, 303, 303]
RANDOM walk for 1000013 steps (2 resets) in 105 ms. (9434 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 568 ms. (5272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299, 299, 297] Max Struct:[303, 303, 303]
[2024-05-26 06:47:22] [INFO ] Invariant cache hit.
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-26 06:47:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:47:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:22] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-26 06:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-26 06:47:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:22] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:23] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299, 299, 297] Max Struct:[303, 303, 303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 7/7 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:23] [INFO ] Invariant cache hit.
[2024-05-26 06:47:23] [INFO ] Implicit Places using invariants in 22 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6/7 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25 ms. Remains : 6/7 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-05-26 06:47:23] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
RANDOM walk for 1000064 steps (2 resets) in 96 ms. (10309 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 546 ms. (5484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
[2024-05-26 06:47:23] [INFO ] Invariant cache hit.
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:23] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-26 06:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-26 06:47:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 06:47:23] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:23] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:23] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:23] [INFO ] Invariant cache hit.
[2024-05-26 06:47:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 06:47:24] [INFO ] Invariant cache hit.
[2024-05-26 06:47:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:24] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-26 06:47:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:24] [INFO ] Invariant cache hit.
[2024-05-26 06:47:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40105 steps (8 resets) in 126 ms. (315 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 508342 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 6
Probabilistic random walk after 508342 steps, saw 267974 distinct states, run finished after 3004 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-26 06:47:27] [INFO ] Invariant cache hit.
[2024-05-26 06:47:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 06:47:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 3 solved, 3 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 14 constraints, problems are : Problem set: 3 solved, 3 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 126ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 1418 ms.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:29] [INFO ] Invariant cache hit.
[2024-05-26 06:47:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40209 steps (8 resets) in 46 ms. (855 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 895966 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 3
Probabilistic random walk after 895966 steps, saw 458409 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2024-05-26 06:47:32] [INFO ] Invariant cache hit.
[2024-05-26 06:47:32] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 06:47:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 14 constraints, problems are : Problem set: 0 solved, 3 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1167 ms.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
[2024-05-26 06:47:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
[2024-05-26 06:47:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-26 06:47:33] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
[2024-05-26 06:47:33] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 6/6 places, 9/9 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299, 299, 299] Max Struct:[303, 303, 303]
Starting property specific reduction for PGCD-PT-D02N100-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10041 steps (2 resets) in 2 ms. (3347 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[303]
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
[2024-05-26 06:47:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:33] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:33] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:33] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
[2024-05-26 06:47:33] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 6/6 places, 9/9 transitions.
[2024-05-26 06:47:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299] Max Struct:[303]
RANDOM walk for 1000065 steps (2 resets) in 102 ms. (9709 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[303]
[2024-05-26 06:47:34] [INFO ] Invariant cache hit.
[2024-05-26 06:47:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 06:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:34] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:34] [INFO ] Invariant cache hit.
[2024-05-26 06:47:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 06:47:34] [INFO ] Invariant cache hit.
[2024-05-26 06:47:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-26 06:47:34] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:34] [INFO ] Invariant cache hit.
[2024-05-26 06:47:34] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40264 steps (8 resets) in 16 ms. (2368 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1189463 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 2
Probabilistic random walk after 1189463 steps, saw 607530 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-05-26 06:47:37] [INFO ] Invariant cache hit.
[2024-05-26 06:47:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 06:47:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 1 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:37] [INFO ] Invariant cache hit.
[2024-05-26 06:47:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40245 steps (8 resets) in 13 ms. (2874 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3812193 steps, run timeout after 3001 ms. (steps per millisecond=1270 ) properties seen :0 out of 1
Probabilistic random walk after 3812193 steps, saw 1850835 distinct states, run finished after 3003 ms. (steps per millisecond=1269 ) properties seen :0
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 06:47:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 0 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-26 06:47:40] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 6/6 places, 9/9 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299] Max Struct:[303]
Ending property specific reduction for PGCD-PT-D02N100-UpperBounds-06 in 7094 ms.
Starting property specific reduction for PGCD-PT-D02N100-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10090 steps (2 resets) in 2 ms. (3363 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[303]
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:40] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 06:47:40] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
[2024-05-26 06:47:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 6/6 places, 9/9 transitions.
[2024-05-26 06:47:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297] Max Struct:[303]
RANDOM walk for 1000069 steps (2 resets) in 136 ms. (7299 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 171 ms. (5813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297] Max Struct:[303]
[2024-05-26 06:47:41] [INFO ] Invariant cache hit.
[2024-05-26 06:47:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 06:47:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 06:47:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:41] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-26 06:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-26 06:47:41] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:41] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:41] [INFO ] Invariant cache hit.
[2024-05-26 06:47:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 06:47:41] [INFO ] Invariant cache hit.
[2024-05-26 06:47:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:41] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-26 06:47:41] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:41] [INFO ] Invariant cache hit.
[2024-05-26 06:47:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40223 steps (8 resets) in 14 ms. (2681 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3687909 steps, run timeout after 3001 ms. (steps per millisecond=1228 ) properties seen :1 out of 2
Probabilistic random walk after 3687909 steps, saw 1792141 distinct states, run finished after 3001 ms. (steps per millisecond=1228 ) properties seen :1
[2024-05-26 06:47:44] [INFO ] Invariant cache hit.
[2024-05-26 06:47:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 06:47:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 6/15 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[297] Max Struct:[303]
Ending property specific reduction for PGCD-PT-D02N100-UpperBounds-11 in 3757 ms.
Starting property specific reduction for PGCD-PT-D02N100-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
[2024-05-26 06:47:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10095 steps (2 resets) in 2 ms. (3365 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[303]
[2024-05-26 06:47:44] [INFO ] Invariant cache hit.
[2024-05-26 06:47:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-26 06:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:44] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-26 06:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2024-05-26 06:47:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:44] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:44] [INFO ] Invariant cache hit.
[2024-05-26 06:47:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 6/6 places, 9/9 transitions.
[2024-05-26 06:47:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299] Max Struct:[303]
RANDOM walk for 1000014 steps (2 resets) in 98 ms. (10101 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 195 ms. (5102 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[303]
[2024-05-26 06:47:45] [INFO ] Invariant cache hit.
[2024-05-26 06:47:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 06:47:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 06:47:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-26 06:47:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 06:47:45] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 06:47:45] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:45] [INFO ] Invariant cache hit.
[2024-05-26 06:47:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 06:47:45] [INFO ] Invariant cache hit.
[2024-05-26 06:47:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-26 06:47:45] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:45] [INFO ] Invariant cache hit.
[2024-05-26 06:47:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40203 steps (8 resets) in 13 ms. (2871 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1037889 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 2
Probabilistic random walk after 1037889 steps, saw 531331 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-05-26 06:47:48] [INFO ] Invariant cache hit.
[2024-05-26 06:47:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 06:47:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 1 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:48] [INFO ] Invariant cache hit.
[2024-05-26 06:47:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40164 steps (8 resets) in 11 ms. (3347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4128091 steps, run timeout after 3001 ms. (steps per millisecond=1375 ) properties seen :0 out of 1
Probabilistic random walk after 4128091 steps, saw 2001478 distinct states, run finished after 3003 ms. (steps per millisecond=1374 ) properties seen :0
[2024-05-26 06:47:51] [INFO ] Invariant cache hit.
[2024-05-26 06:47:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 06:47:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 06:47:51] [INFO ] Invariant cache hit.
[2024-05-26 06:47:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 06:47:51] [INFO ] Invariant cache hit.
[2024-05-26 06:47:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 06:47:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-26 06:47:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 06:47:51] [INFO ] Invariant cache hit.
[2024-05-26 06:47:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 6/6 places, 9/9 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299] Max Struct:[303]
Ending property specific reduction for PGCD-PT-D02N100-UpperBounds-12 in 7109 ms.
[2024-05-26 06:47:51] [INFO ] Flatten gal took : 13 ms
[2024-05-26 06:47:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-26 06:47:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6 places, 9 transitions and 30 arcs took 3 ms.
Total runtime 38661 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PGCD-PT-D02N100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 6
TRANSITIONS: 9
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1070
MODEL NAME: /home/mcc/execution/407/model
6 places, 9 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PGCD-PT-D02N100-UpperBounds-06 299 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PGCD-PT-D02N100-UpperBounds-11 299 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PGCD-PT-D02N100-UpperBounds-12 299 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716706081272

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-PT-D02N100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PGCD-PT-D02N100, 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 r245-tall-171654350600757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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