About the Execution of ITS-Tools for Murphy-PT-D3N050
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.r246-tall-171654351300317.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 itstools
Input is Murphy-PT-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351300317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.9K Apr 11 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 23:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 11 23:12 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15K 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 Murphy-PT-D3N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716661266253
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-25 18:21:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 18:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:21:07] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-05-25 18:21:07] [INFO ] Transformed 24 places.
[2024-05-25 18:21:07] [INFO ] Transformed 28 transitions.
[2024-05-25 18:21:07] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 28 rows 24 cols
[2024-05-25 18:21:07] [INFO ] Computed 5 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 10042 steps (2 resets) in 22 ms. (436 steps per ms)
BEST_FIRST walk for 160014 steps (32 resets) in 118 ms. (1344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 107, 75, 75, 1, 99, 3, 99, 3, 91, 97, 1, 67] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 18:21:07] [INFO ] Invariant cache hit.
[2024-05-25 18:21:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 18:21:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 18:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-25 18:21:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-25 18:21:08] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 7 ms to minimize.
[2024-05-25 18:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 18:21:08] [INFO ] Added : 3 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:08] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:08] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:08] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 18:21:08] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:08] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 41 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:08] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 42 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:08] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 18:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 44 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:09] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 39 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:09] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 37 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 23 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:09] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 18:21:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-25 18:21:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 107, 75, 75, 1, 99, 3, 99, 3, 91, 97, 1, 67] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 187, 201, 201, 1, 199, 3, 197, 3, 126, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:10] [INFO ] Invariant cache hit.
[2024-05-25 18:21:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :[2, 3, 3, 2, 50, 56, 56, 1, 78, 3, 53, 3, 54, 83, 1, 90]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 187, 201, 201, 1, 199, 3, 197, 3, 126, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 18:21:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 187, 201, 201, 1, 199, 3, 197, 3, 126, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 1000000 steps (2 resets) in 454 ms. (2197 steps per ms)
BEST_FIRST walk for 16000014 steps (32 resets) in 6119 ms. (2614 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 187, 201, 201, 1, 201, 3, 197, 3, 126, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 18:21:17] [INFO ] Invariant cache hit.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:21:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-25 18:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 18:21:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:17] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:17] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:17] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:17] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:17] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:18] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:18] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:18] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 19 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:18] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 18:21:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:18] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 31 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:18] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 187, 201, 201, 1, 201, 3, 197, 3, 126, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 201, 201, +inf, 201, +inf, 204, +inf, 204, 201, +inf, 201]
FORMULA Murphy-PT-D3N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 126, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :[2, 3, 3, 2, 51, 1, 3, 57, 3, 61, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 126, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 126, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000060 steps (2 resets) in 406 ms. (2457 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 4106 ms. (2678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 126, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:23] [INFO ] Invariant cache hit.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-25 18:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2024-05-25 18:21:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:23] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:23] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:23] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:23] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:23] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:24] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:24] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:24] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:24] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 18:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:24] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 26 ms.
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:24] [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:[2, 3, 3, 2, 197, 1, 3, 197, 3, 126, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 128, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:21:24] [INFO ] Invariant cache hit.
[2024-05-25 18:21:24] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41 ms. Remains : 20/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :[2, 3, 3, 2, 55, 1, 3, 53, 3, 53, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 128, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:21:24] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 128, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000039 steps (2 resets) in 381 ms. (2617 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 3617 ms. (3040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 128, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:28] [INFO ] Invariant cache hit.
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:21:28] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:28] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:28] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:28] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:28] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:28] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 23 ms.
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:29] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 128, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 151, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:21:29] [INFO ] Invariant cache hit.
[2024-05-25 18:21:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 18:21:29] [INFO ] Invariant cache hit.
[2024-05-25 18:21:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 18:21:29] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:29] [INFO ] Invariant cache hit.
[2024-05-25 18:21:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :[2, 3, 3, 2, 54, 1, 3, 55, 3, 52, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 151, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 151, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000000 steps (2 resets) in 385 ms. (2590 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 3624 ms. (3034 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 151, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:33] [INFO ] Invariant cache hit.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:21:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:34] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:34] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 18:21:34] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:34] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:34] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 18:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 23 ms.
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:34] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 197, 3, 151, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:21:34] [INFO ] Invariant cache hit.
[2024-05-25 18:21:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 18:21:35] [INFO ] Invariant cache hit.
[2024-05-25 18:21:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 18:21:35] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:35] [INFO ] Invariant cache hit.
[2024-05-25 18:21:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :[2, 3, 3, 2, 60, 1, 3, 51, 3, 56, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000052 steps (2 resets) in 380 ms. (2624 steps per ms)
BEST_FIRST walk for 11000009 steps (22 resets) in 3614 ms. (3042 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 18:21:39] [INFO ] Invariant cache hit.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:21:39] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 14 ms.
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:40] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:21:40] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:21:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:21:40] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:40] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 18:21:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:21:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:21:40] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:21:40] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:21:40] [INFO ] Invariant cache hit.
[2024-05-25 18:21:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 18:21:40] [INFO ] Invariant cache hit.
[2024-05-25 18:21:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 18:21:40] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:40] [INFO ] Invariant cache hit.
[2024-05-25 18:21:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :[2, 3, 3, 2, 59, 1, 3, 51, 3, 62, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 40156 steps (8 resets) in 646 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
[2024-05-25 18:21:41] [INFO ] Flatten gal took : 23 ms
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 14/14 properties
[2024-05-25 18:21:41] [INFO ] Flatten gal took : 15 ms
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
[2024-05-25 18:21:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14556924802857052776.gal : 4 ms
[2024-05-25 18:21:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1295446057376706329.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14556924802857052776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1295446057376706329.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1295446057376706329.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :30630 after 243534
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1.78854e+09 after 5.66311e+10
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 213692 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 14
Probabilistic random walk after 213692 steps, saw 144556 distinct states, run finished after 3004 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-25 18:21:44] [INFO ] Invariant cache hit.
[2024-05-25 18:21:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-25 18:21:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem MAX4 is UNSAT
Problem MAX7 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 3 solved, 11 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 5/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/33 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 3 solved, 11 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 337ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3659 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 13 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:48] [INFO ] Invariant cache hit.
[2024-05-25 18:21:48] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40060 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
Interrupted probabilistic random walk after 238512 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 11
Probabilistic random walk after 238512 steps, saw 161074 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-25 18:21:52] [INFO ] Invariant cache hit.
[2024-05-25 18:21:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-25 18:21:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 11 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 0 solved, 11 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1210 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:21:53] [INFO ] Invariant cache hit.
[2024-05-25 18:21:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 18:21:53] [INFO ] Invariant cache hit.
[2024-05-25 18:21:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-25 18:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:21:53] [INFO ] Invariant cache hit.
[2024-05-25 18:21:53] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-25 18:21:54] [INFO ] Invariant cache hit.
[2024-05-25 18:21:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:54] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 18:21:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:21:54] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-25 18:21:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:21:54] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-25 18:21:54] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-25 18:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 18:21:54] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-05-25 18:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
TRAPS : Iteration 1
[2024-05-25 18:21:54] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-05-25 18:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
TRAPS : Iteration 2
[2024-05-25 18:21:54] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-25 18:21:54] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2024-05-25 18:21:54] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:21:54] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:21:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17249643458514667188.gal : 1 ms
[2024-05-25 18:21:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7696175166307981480.prop : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17249643458514667188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7696175166307981480.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7696175166307981480.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 39954
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :39954 after 274734
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :274734 after 2.30621e+09
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :2.30621e+09 after 5.65601e+10
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :5.65601e+10 after 1.1507e+11
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.1507e+11 after 5.38802e+11
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :5.38802e+11 after 9.9129e+11
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :9.9129e+11 after 1.58341e+12
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.58341e+12 after 8.41644e+12
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :8.06626e+11 after 1.85793e+12
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :1.85793e+12 after 5.55063e+12
Detected timeout of ITS tools.
[2024-05-25 18:22:09] [INFO ] Flatten gal took : 8 ms
[2024-05-25 18:22:09] [INFO ] Applying decomposition
[2024-05-25 18:22:09] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8908087466408602979.txt' '-o' '/tmp/graph8908087466408602979.bin' '-w' '/tmp/graph8908087466408602979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8908087466408602979.bin' '-l' '-1' '-v' '-w' '/tmp/graph8908087466408602979.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:22:09] [INFO ] Decomposing Gal with order
[2024-05-25 18:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:22:09] [INFO ] Flatten gal took : 76 ms
[2024-05-25 18:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 18:22:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3443490815704826286.gal : 1 ms
[2024-05-25 18:22:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4457115329447246693.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3443490815704826286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4457115329447246693.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4457115329447246693.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :421209 after 6.98717e+09
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :6.98717e+09 after 6.99064e+09
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :6.99064e+09 after 1.28285e+10
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.28285e+10 after 1.28286e+10
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.28286e+10 after 1.3072e+10
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.3072e+10 after 2.72456e+10
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :5.55063e+12 after 2.09715e+13
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :2.72456e+10 after 7.90271e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30737 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:22:24] [INFO ] Flatten gal took : 8 ms
[2024-05-25 18:22:24] [INFO ] Applying decomposition
[2024-05-25 18:22:24] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3785696898786059806.txt' '-o' '/tmp/graph3785696898786059806.bin' '-w' '/tmp/graph3785696898786059806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3785696898786059806.bin' '-l' '-1' '-v' '-w' '/tmp/graph3785696898786059806.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:22:24] [INFO ] Decomposing Gal with order
[2024-05-25 18:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:22:24] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:22:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3138788966163876907.gal : 1 ms
[2024-05-25 18:22:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12114799783462042169.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3138788966163876907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12114799783462042169.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12114799783462042169.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :468 after 1080
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1080 after 23868
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :23868 after 2.99527e+06
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :2.99527e+06 after 7.63934e+11
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :7.63934e+11 after 2.54944e+12
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.54944e+12 after 1.09597e+13
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.09597e+13 after 1.10142e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 197, 3, 195, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 18:23:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10042 steps (2 resets) in 5 ms. (1673 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:14] [INFO ] Invariant cache hit.
[2024-05-25 18:23:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:15] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 18:23:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:15] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:23:15] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 5 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:23:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 18:23:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 66 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 283 ms. (3521 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 372 ms. (2680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:15] [INFO ] Invariant cache hit.
[2024-05-25 18:23:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:23:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:15] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:23:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:23:15] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:23:16] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:23:16] [INFO ] Invariant cache hit.
[2024-05-25 18:23:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 18:23:16] [INFO ] Invariant cache hit.
[2024-05-25 18:23:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 18:23:16] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:23:16] [INFO ] Invariant cache hit.
[2024-05-25 18:23:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:16] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:16] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40000 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-05-25 18:23:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5768959715095429380.gal : 7 ms
[2024-05-25 18:23:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14311457448539290217.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5768959715095429380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14311457448539290217.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14311457448539290217.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001869,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002019,3808,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
ITS runner timed out or was interrupted.
FORMULA Murphy-PT-D3N050-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-00 in 1210 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:23:16] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10012 steps (2 resets) in 5 ms. (1668 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:16] [INFO ] Invariant cache hit.
[2024-05-25 18:23:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:16] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-25 18:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:23:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 18:23:16] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:23:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 18:23:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 780 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 820ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 821 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 221 ms. (4504 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 177 ms. (5617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
[2024-05-25 18:23:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:17] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:17] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:23:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:23:17] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:23:17] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
[2024-05-25 18:23:17] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
[2024-05-25 18:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-25 18:23:17] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
[2024-05-25 18:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:17] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:23:17] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18215319278720281799.gal : 1 ms
[2024-05-25 18:23:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality844652443998235814.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18215319278720281799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality844652443998235814.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40001 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality844652443998235814.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003748,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.004177,3808,1,0,5,44,7,0,25,26,0
ITS runner timed out or was interrupted.
FORMULA Murphy-PT-D3N050-UpperBounds-01 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-01 in 1638 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:23:17] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10011 steps (2 resets) in 5 ms. (1668 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:17] [INFO ] Invariant cache hit.
[2024-05-25 18:23:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:23:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:17] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:23:17] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:23:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 113 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 217 ms. (4587 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
[2024-05-25 18:23:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 18:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:18] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 18:23:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:23:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:23:18] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
[2024-05-25 18:23:18] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
[2024-05-25 18:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:18] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 18:23:18] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
[2024-05-25 18:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:23:18] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:23:18] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2261507469693398504.gal : 1 ms
[2024-05-25 18:23:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5413061464451739938.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2261507469693398504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5413061464451739938.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40002 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5413061464451739938.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.00181,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.001965,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40000 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-02 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-02 in 984 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:23:18] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:18] [INFO ] Invariant cache hit.
[2024-05-25 18:23:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:23:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:23:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:23:18] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:23:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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 : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 220 ms. (4524 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 167 ms. (5952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 18:23:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:23:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:23:19] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:23:19] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:23:19] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-25 18:23:19] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 57 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:23:19] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:19] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13855688260035828923.gal : 1 ms
[2024-05-25 18:23:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8795574651970830549.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13855688260035828923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8795574651970830549.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8795574651970830549.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001617,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.001759,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40001 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
ITS runner timed out or was interrupted.
FORMULA Murphy-PT-D3N050-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-03 in 808 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:23:19] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10013 steps (2 resets) in 4 ms. (2002 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[83] Max Struct:[204]
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:23:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:23:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-25 18:23:19] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[83] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[185] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:23:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[185] Max Struct:[204]
RANDOM walk for 1000038 steps (2 resets) in 337 ms. (2958 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 317 ms. (3144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[185] Max Struct:[204]
[2024-05-25 18:23:20] [INFO ] Invariant cache hit.
[2024-05-25 18:23:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:23:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 18:23:20] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:23:20] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[185] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:23:20] [INFO ] Invariant cache hit.
[2024-05-25 18:23:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 18:23:20] [INFO ] Invariant cache hit.
[2024-05-25 18:23:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 18:23:20] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:23:20] [INFO ] Invariant cache hit.
[2024-05-25 18:23:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:23:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[204]
RANDOM walk for 1000052 steps (2 resets) in 334 ms. (2985 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 320 ms. (3115 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[204]
[2024-05-25 18:23:21] [INFO ] Invariant cache hit.
[2024-05-25 18:23:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:23:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:23:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:23:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-25 18:23:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:23:22] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:23:22] [INFO ] Invariant cache hit.
[2024-05-25 18:23:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 18:23:22] [INFO ] Invariant cache hit.
[2024-05-25 18:23:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 18:23:22] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:23:22] [INFO ] Invariant cache hit.
[2024-05-25 18:23:22] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40093 steps (8 resets) in 38 ms. (1028 steps per ms) remains 2/2 properties
[2024-05-25 18:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:23:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1648914369354025989.gal : 1 ms
[2024-05-25 18:23:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5504792758412069973.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1648914369354025989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5504792758412069973.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5504792758412069973.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 192
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.78854e+09 after 5.66311e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 498204 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 2
Probabilistic random walk after 498204 steps, saw 338716 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-25 18:23:25] [INFO ] Invariant cache hit.
[2024-05-25 18:23:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 18:23:25] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 28 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 458ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:23:26] [INFO ] Invariant cache hit.
[2024-05-25 18:23:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40090 steps (8 resets) in 22 ms. (1743 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2337132 steps, run timeout after 3001 ms. (steps per millisecond=778 ) properties seen :0 out of 1
Probabilistic random walk after 2337132 steps, saw 1590226 distinct states, run finished after 3003 ms. (steps per millisecond=778 ) properties seen :0
[2024-05-25 18:23:29] [INFO ] Invariant cache hit.
[2024-05-25 18:23:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:23:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:23:30] [INFO ] Invariant cache hit.
[2024-05-25 18:23:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 18:23:30] [INFO ] Invariant cache hit.
[2024-05-25 18:23:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:23:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-25 18:23:30] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:23:30] [INFO ] Invariant cache hit.
[2024-05-25 18:23:30] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 18:23:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 18:23:30] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-25 18:23:30] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:23:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:23:30] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 18:23:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 18:23:30] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 18:23:30] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:23:30] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:23:30] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:30] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3544263500673914000.gal : 5 ms
[2024-05-25 18:23:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7944196828527525733.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3544263500673914000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7944196828527525733.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7944196828527525733.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
Detected timeout of ITS tools.
[2024-05-25 18:23:45] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:45] [INFO ] Applying decomposition
[2024-05-25 18:23:45] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3786462740534964835.txt' '-o' '/tmp/graph3786462740534964835.bin' '-w' '/tmp/graph3786462740534964835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3786462740534964835.bin' '-l' '-1' '-v' '-w' '/tmp/graph3786462740534964835.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:23:45] [INFO ] Decomposing Gal with order
[2024-05-25 18:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:23:45] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15970608227842888772.gal : 1 ms
[2024-05-25 18:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8079595059107238453.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15970608227842888772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8079595059107238453.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8079595059107238453.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.01288e+10 after 1.01291e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01291e+10 after 1.01291e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.01291e+10 after 1.04634e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.06626e+11 after 1.85793e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.85793e+12 after 5.55063e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.85481e+10 after 5.90581e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.55063e+12 after 2.09715e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30277 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:24:01] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:24:01] [INFO ] Applying decomposition
[2024-05-25 18:24:01] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5715358048750270849.txt' '-o' '/tmp/graph5715358048750270849.bin' '-w' '/tmp/graph5715358048750270849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5715358048750270849.bin' '-l' '-1' '-v' '-w' '/tmp/graph5715358048750270849.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:24:01] [INFO ] Decomposing Gal with order
[2024-05-25 18:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:24:01] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:24:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7696607440914806553.gal : 1 ms
[2024-05-25 18:24:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4420667449826319796.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7696607440914806553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4420667449826319796.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4420667449826319796.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :468 after 1080
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1080 after 23868
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23868 after 2.99527e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.99527e+06 after 7.64225e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.64225e+11 after 2.54944e+12
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[197] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-04 in 91474 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:24:51] [INFO ] Computed 1 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10054 steps (2 resets) in 4 ms. (2010 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:51] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:24:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 251 ms. (3968 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 172 ms. (5780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:24:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:51] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:24:51] [INFO ] Added : 3 causal constraints over 2 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:24:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 18:24:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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 111 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:24:51] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:24:51] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:24:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10788221373265894114.gal : 0 ms
[2024-05-25 18:24:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8110066321983211505.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10788221373265894114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8110066321983211505.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8110066321983211505.prop.
RANDOM walk for 40000 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.00211,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002291,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-07 in 833 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:24:51] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10028 steps (2 resets) in 5 ms. (1671 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:24:51] [INFO ] Invariant cache hit.
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:24:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:24:51] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:51] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:24:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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 : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 215 ms. (4629 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 185 ms. (5376 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:24:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:24:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:24:52] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:52] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:24:52] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-25 18:24:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:24:52] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:24:52] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:24:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15192047014448302148.gal : 3 ms
[2024-05-25 18:24:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2221410197180877495.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15192047014448302148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2221410197180877495.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2221410197180877495.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001535,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.001674,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-09 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-09 in 858 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:24:52] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10010 steps (2 resets) in 4 ms. (2002 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[87] Max Struct:[204]
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:24:52] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:52] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[87] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:24:52] [INFO ] Invariant cache hit.
[2024-05-25 18:24:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:24:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[181] Max Struct:[204]
RANDOM walk for 1000000 steps (2 resets) in 342 ms. (2915 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[204]
[2024-05-25 18:24:54] [INFO ] Invariant cache hit.
[2024-05-25 18:24:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:24:54] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:54] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:24:54] [INFO ] Invariant cache hit.
[2024-05-25 18:24:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 18:24:54] [INFO ] Invariant cache hit.
[2024-05-25 18:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-25 18:24:54] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:24:54] [INFO ] Invariant cache hit.
[2024-05-25 18:24:54] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:24:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000000 steps (2 resets) in 336 ms. (2967 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 313 ms. (3184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2024-05-25 18:24:55] [INFO ] Invariant cache hit.
[2024-05-25 18:24:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:24:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:24:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:24:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:24:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:24:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:24:55] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:24:55] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:24:55] [INFO ] Invariant cache hit.
[2024-05-25 18:24:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 18:24:55] [INFO ] Invariant cache hit.
[2024-05-25 18:24:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:24:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-25 18:24:55] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:24:55] [INFO ] Invariant cache hit.
[2024-05-25 18:24:55] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:24:55] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:24:55] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:24:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10711562915218256573.gal : 0 ms
[2024-05-25 18:24:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13964819078778550648.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10711562915218256573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13964819078778550648.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13964819078778550648.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 192
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 30630
RANDOM walk for 40127 steps (8 resets) in 48 ms. (818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.78854e+09 after 5.66311e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 691446 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691446 steps, saw 469281 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-25 18:24:58] [INFO ] Invariant cache hit.
[2024-05-25 18:24:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 18:24:58] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 121ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:24:58] [INFO ] Invariant cache hit.
[2024-05-25 18:24:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2717 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 2987ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 2987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2988 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40104 steps (8 resets) in 17 ms. (2228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
Interrupted probabilistic random walk after 2196419 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :0 out of 1
Probabilistic random walk after 2196419 steps, saw 1493966 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
[2024-05-25 18:25:04] [INFO ] Invariant cache hit.
[2024-05-25 18:25:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:25:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:25:05] [INFO ] Invariant cache hit.
[2024-05-25 18:25:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 18:25:05] [INFO ] Invariant cache hit.
[2024-05-25 18:25:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:25:05] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-25 18:25:05] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:25:05] [INFO ] Invariant cache hit.
[2024-05-25 18:25:05] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 18:25:05] [INFO ] Computed 1 invariants in 0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
[2024-05-25 18:25:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
SDD size :4.52978e+11 after 8.06626e+11
[2024-05-25 18:25:05] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:25:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:25:05] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 18:25:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 18:25:05] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 18:25:05] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:25:05] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:25:05] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:25:05] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:25:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13332784897178241908.gal : 1 ms
[2024-05-25 18:25:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11880563375976049438.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13332784897178241908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11880563375976049438.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11880563375976049438.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.06626e+11 after 1.85793e+12
Detected timeout of ITS tools.
[2024-05-25 18:25:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:25:20] [INFO ] Applying decomposition
[2024-05-25 18:25:20] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph694268559886439962.txt' '-o' '/tmp/graph694268559886439962.bin' '-w' '/tmp/graph694268559886439962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph694268559886439962.bin' '-l' '-1' '-v' '-w' '/tmp/graph694268559886439962.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:25:20] [INFO ] Decomposing Gal with order
[2024-05-25 18:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:25:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:25:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8918205177099363973.gal : 1 ms
[2024-05-25 18:25:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3683141394725519582.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8918205177099363973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3683141394725519582.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3683141394725519582.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.02927e+10 after 1.0306e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.0306e+10 after 1.04632e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.85793e+12 after 5.55063e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.70011e+10 after 2.72802e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.55063e+12 after 2.09715e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30141 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:25:35] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:25:35] [INFO ] Applying decomposition
[2024-05-25 18:25:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11676789971663355049.txt' '-o' '/tmp/graph11676789971663355049.bin' '-w' '/tmp/graph11676789971663355049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11676789971663355049.bin' '-l' '-1' '-v' '-w' '/tmp/graph11676789971663355049.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:25:35] [INFO ] Decomposing Gal with order
[2024-05-25 18:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:25:35] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:25:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:25:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14277473973439313020.gal : 3 ms
[2024-05-25 18:25:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13698777516585922901.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14277473973439313020.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13698777516585922901.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13698777516585922901.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :72 after 252
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :252 after 576
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :576 after 1188
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1188 after 29376
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29376 after 7.48818e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.48818e+06 after 9.9963e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.9963e+11 after 2.54944e+12
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-10 in 92927 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:26:25] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10010 steps (2 resets) in 4 ms. (2002 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:26:25] [INFO ] Invariant cache hit.
[2024-05-25 18:26:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:26:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:26:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:26:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:26:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:26:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:26:25] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:26:25] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:26:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms 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 : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:26:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 270 ms. (3690 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 200 ms. (4975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:26:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:26:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:26:26] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:26:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:26:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:26:26] [INFO ] Added : 3 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:26:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-25 18:26:26] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:26:26] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:26:26] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:26:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2718038725146894823.gal : 0 ms
[2024-05-25 18:26:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality761012252635524549.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2718038725146894823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality761012252635524549.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40002 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality761012252635524549.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002219,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
BEST_FIRST walk for 40001 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.00238,3808,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-11 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-11 in 907 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:26:26] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10003 steps (2 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[103] Max Struct:[204]
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:26:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:26:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:26:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:26:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:26:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:26:26] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:26:26] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[103] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:26:26] [INFO ] Invariant cache hit.
[2024-05-25 18:26:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:26:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[204]
RANDOM walk for 1000014 steps (2 resets) in 341 ms. (2924 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[204]
[2024-05-25 18:26:27] [INFO ] Invariant cache hit.
[2024-05-25 18:26:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:26:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 18:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:26:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:26:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:26:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:26:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:26:27] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:26:27] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:26:27] [INFO ] Invariant cache hit.
[2024-05-25 18:26:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 18:26:27] [INFO ] Invariant cache hit.
[2024-05-25 18:26:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:26:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 18:26:27] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:26:27] [INFO ] Invariant cache hit.
[2024-05-25 18:26:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 18:26:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:26:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:26:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7336242220188425740.gal : 1 ms
[2024-05-25 18:26:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1615249119628620435.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7336242220188425740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1615249119628620435.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1615249119628620435.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 192
RANDOM walk for 40057 steps (8 resets) in 41 ms. (953 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30630 after 243534
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243534 after 1.78854e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.78854e+09 after 5.66311e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.66311e+10 after 1.14813e+11
Interrupted probabilistic random walk after 797825 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 2
Probabilistic random walk after 797825 steps, saw 542222 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2024-05-25 18:26:31] [INFO ] Invariant cache hit.
[2024-05-25 18:26:31] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 18:26:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 571ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 18:26:32] [INFO ] Invariant cache hit.
[2024-05-25 18:26:32] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40125 steps (8 resets) in 35 ms. (1114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2529096 steps, run timeout after 3001 ms. (steps per millisecond=842 ) properties seen :0 out of 1
Probabilistic random walk after 2529096 steps, saw 1721963 distinct states, run finished after 3001 ms. (steps per millisecond=842 ) properties seen :0
[2024-05-25 18:26:35] [INFO ] Invariant cache hit.
[2024-05-25 18:26:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:26:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 18:26:35] [INFO ] Invariant cache hit.
[2024-05-25 18:26:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 18:26:35] [INFO ] Invariant cache hit.
[2024-05-25 18:26:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:26:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-25 18:26:35] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 18:26:35] [INFO ] Invariant cache hit.
[2024-05-25 18:26:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 18:26:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 18:26:36] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2024-05-25 18:26:36] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:26:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:26:36] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 18:26:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 18:26:36] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 18:26:36] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:26:36] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:26:36] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:26:36] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:26:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2884004311025106742.gal : 1 ms
[2024-05-25 18:26:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17689903272417441937.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2884004311025106742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17689903272417441937.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17689903272417441937.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14813e+11 after 4.52978e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.52978e+11 after 8.06626e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
Detected timeout of ITS tools.
[2024-05-25 18:26:51] [INFO ] Flatten gal took : 6 ms
[2024-05-25 18:26:51] [INFO ] Applying decomposition
[2024-05-25 18:26:51] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8844403879600827198.txt' '-o' '/tmp/graph8844403879600827198.bin' '-w' '/tmp/graph8844403879600827198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8844403879600827198.bin' '-l' '-1' '-v' '-w' '/tmp/graph8844403879600827198.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:26:51] [INFO ] Decomposing Gal with order
[2024-05-25 18:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:26:51] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:26:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8644623932041301919.gal : 0 ms
[2024-05-25 18:26:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12779443572411625758.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8644623932041301919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12779443572411625758.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12779443572411625758.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 6.22169e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.04712e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.04712e+10 after 1.04783e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.04783e+10 after 1.04783e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.04783e+10 after 1.04786e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.82226e+10 after 1.82747e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.06626e+11 after 1.85793e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.68471e+10 after 3.72645e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.85793e+12 after 5.55063e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.55063e+12 after 2.09715e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30478 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:27:06] [INFO ] Applying decomposition
[2024-05-25 18:27:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10313846451202080597.txt' '-o' '/tmp/graph10313846451202080597.bin' '-w' '/tmp/graph10313846451202080597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10313846451202080597.bin' '-l' '-1' '-v' '-w' '/tmp/graph10313846451202080597.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:27:06] [INFO ] Decomposing Gal with order
[2024-05-25 18:27:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:27:06] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:27:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7269734995452328966.gal : 1 ms
[2024-05-25 18:27:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4562647780843564676.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7269734995452328966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4562647780843564676.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4562647780843564676.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :468 after 1080
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1080 after 23868
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23868 after 2.99527e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.99527e+06 after 7.63934e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.63934e+11 after 2.54944e+12
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[197] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-12 in 89905 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 18:27:56] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10018 steps (2 resets) in 4 ms. (2003 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:27:56] [INFO ] Invariant cache hit.
[2024-05-25 18:27:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:27:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:27:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:27:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:27:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 18:27:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:27:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:27:56] [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:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:27:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:27:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 234 ms. (4255 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 172 ms. (5780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:27:57] [INFO ] Invariant cache hit.
[2024-05-25 18:27:57] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:27:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:27:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:27:57] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:27:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:27:57] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:27:57] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:27:57] [INFO ] Invariant cache hit.
[2024-05-25 18:27:57] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-25 18:27:57] [INFO ] Invariant cache hit.
[2024-05-25 18:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:27:57] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 18:27:57] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:27:57] [INFO ] Invariant cache hit.
[2024-05-25 18:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:27:57] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:27:57] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:27:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14309115523203740618.gal : 11 ms
[2024-05-25 18:27:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12366719548959744856.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14309115523203740618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12366719548959744856.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40001 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12366719548959744856.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001604,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.001755,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-14 in 874 ms.
[2024-05-25 18:27:57] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:27:57] [INFO ] Applying decomposition
[2024-05-25 18:27:57] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10992366041542738943.txt' '-o' '/tmp/graph10992366041542738943.bin' '-w' '/tmp/graph10992366041542738943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10992366041542738943.bin' '-l' '-1' '-v' '-w' '/tmp/graph10992366041542738943.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:27:57] [INFO ] Decomposing Gal with order
[2024-05-25 18:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:27:57] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:27:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:27:57] [INFO ] Time to serialize gal into /tmp/UpperBounds12232089212745426177.gal : 2 ms
[2024-05-25 18:27:57] [INFO ] Time to serialize properties into /tmp/UpperBounds18006509543577677762.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12232089212745426177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18006509543577677762.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds18006509543577677762.prop.
Detected timeout of ITS tools.
[2024-05-25 18:50:13] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:50:13] [INFO ] Time to serialize gal into /tmp/UpperBounds9884448428764173806.gal : 1 ms
[2024-05-25 18:50:13] [INFO ] Time to serialize properties into /tmp/UpperBounds16546248628256033794.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9884448428764173806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16546248628256033794.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds16546248628256033794.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.4071e+14,50.8464,716068,2,7445,5,2.50568e+06,6,0,139,2.74917e+06,0
Total reachable state count : 540710084330928
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-04 :0 <= p1_4 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-04 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-04,0,50.8487,716068,1,0,7,2.50568e+06,9,1,370,2.74917e+06,4
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-10 :0 <= p1_3 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-10 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-10,0,50.907,716068,1,0,8,2.50568e+06,10,1,589,2.74917e+06,5
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-12 :0 <= p1_2 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-12 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-12,0,51.0628,716068,1,0,9,2.50568e+06,11,1,818,2.74917e+06,6
Total runtime 1797483 ms.
BK_STOP 1716663064887
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D3N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Murphy-PT-D3N050, 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 r246-tall-171654351300317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 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 '
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 ;