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.r224-tall-171649612000093.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 JoinFreeModules-PT-5000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612000093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716547861196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 10:51:02] [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-24 10:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:51:03] [INFO ] Load time of PNML (sax parser for PT used): 858 ms
[2024-05-24 10:51:03] [INFO ] Transformed 25001 places.
[2024-05-24 10:51:03] [INFO ] Transformed 40001 transitions.
[2024-05-24 10:51:03] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1097 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 40001 rows 25000 cols
[2024-05-24 10:51:03] [INFO ] Computed 5000 invariants in 255 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 12505 steps (2 resets) in 2658 ms. (4 steps per ms)
BEST_FIRST walk for 160016 steps (0 resets) in 41500 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 10:51:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 80 are kept as prefixes of interest. Removing 24920 places using SCC suffix rule.32 ms
Discarding 24920 places :
Also discarding 39872 output transitions
Drop transitions (Output transitions of discarded places.) removed 39872 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 80 transition count 128
Applied a total of 2 rules in 145 ms. Remains 80 /25000 variables (removed 24920) and now considering 128/40001 (removed 39873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2024-05-24 10:52:38] [INFO ] Computed 16 invariants in 0 ms
[2024-05-24 10:52:38] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3112 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 5007ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5024ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5184 ms. Remains : 80/25000 places, 128/40001 transitions.
[2024-05-24 10:52:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 1, 5000, 0, 2, 2, 2, 2, 0, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001255 steps (2 resets) in 917 ms. (1090 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 19580 ms. (817 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4770, 4532, 4625, 4397, 4889, 5001, 5000, 4750, 4626, 3751, 3951, 4452, 5000, 5000, 5001, 3907] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 10:53:03] [INFO ] Invariant cache hit.
[2024-05-24 10:53:03] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-24 10:53:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 10:53:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 10:53:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 10:53:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2024-05-24 10:53:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:53:04] [INFO ] Added : 59 causal constraints over 13 iterations in 150 ms. Result :sat
Minimization took 136 ms.
[2024-05-24 10:53:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:04] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-24 10:53:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:04] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-24 10:53:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 10:53:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 10:53:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 7 ms to minimize.
[2024-05-24 10:53:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2024-05-24 10:53:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 6 ms to minimize.
[2024-05-24 10:53:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-24 10:53:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 171 ms
[2024-05-24 10:53:04] [INFO ] Added : 77 causal constraints over 17 iterations in 418 ms. Result :sat
Minimization took 169 ms.
[2024-05-24 10:53:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 10:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-05-24 10:53:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-24 10:53:05] [INFO ] Added : 63 causal constraints over 13 iterations in 126 ms. Result :sat
Minimization took 153 ms.
[2024-05-24 10:53:05] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 10:53:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:53:05] [INFO ] Added : 59 causal constraints over 13 iterations in 141 ms. Result :sat
Minimization took 177 ms.
[2024-05-24 10:53:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:05] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-24 10:53:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 10:53:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-24 10:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 10:53:06] [INFO ] Added : 72 causal constraints over 16 iterations in 229 ms. Result :sat
Minimization took 108 ms.
[2024-05-24 10:53:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2024-05-24 10:53:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 10:53:06] [INFO ] Added : 39 causal constraints over 8 iterations in 134 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 10:53:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 10:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 10:53:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-24 10:53:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-24 10:53:07] [INFO ] Added : 62 causal constraints over 14 iterations in 126 ms. Result :sat
Minimization took 35 ms.
[2024-05-24 10:53:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2024-05-24 10:53:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:53:07] [INFO ] Added : 66 causal constraints over 14 iterations in 145 ms. Result :sat
Minimization took 144 ms.
[2024-05-24 10:53:07] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 10:53:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 10:53:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2024-05-24 10:53:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 10:53:07] [INFO ] Added : 68 causal constraints over 15 iterations in 139 ms. Result :sat
Minimization took 152 ms.
[2024-05-24 10:53:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 10:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 10:53:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:53:08] [INFO ] Added : 64 causal constraints over 14 iterations in 124 ms. Result :sat
Minimization took 195 ms.
[2024-05-24 10:53:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 10:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-24 10:53:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 24 ms returned sat
[2024-05-24 10:53:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 10:53:08] [INFO ] Added : 61 causal constraints over 15 iterations in 150 ms. Result :sat
Minimization took 41 ms.
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 10:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2024-05-24 10:53:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 10:53:09] [INFO ] Added : 62 causal constraints over 14 iterations in 175 ms. Result :sat
Minimization took 156 ms.
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 26 ms returned sat
[2024-05-24 10:53:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:53:09] [INFO ] Added : 48 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 58 ms returned sat
[2024-05-24 10:53:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:53:10] [INFO ] Added : 57 causal constraints over 12 iterations in 154 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 10:53:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 10:53:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:53:10] [INFO ] Added : 70 causal constraints over 16 iterations in 218 ms. Result :sat
Minimization took 39 ms.
[2024-05-24 10:53:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:53:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:53:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-24 10:53:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 10:53:10] [INFO ] Added : 68 causal constraints over 14 iterations in 183 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4770, 4532, 4625, 4397, 4889, 5001, 5000, 4750, 4626, 3751, 3951, 4452, 5000, 5000, 5001, 3907] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5000, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-24 10:57:43] [INFO ] Invariant cache hit.
[2024-05-24 10:57:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 10:57:43] [INFO ] Invariant cache hit.
[2024-05-24 10:57:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 10:57:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-24 10:57:43] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-24 10:57:43] [INFO ] Invariant cache hit.
[2024-05-24 10:57:43] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4039ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4156 ms. Remains : 80/80 places, 128/128 transitions.
[2024-05-24 10:57:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5000, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001374 steps (2 resets) in 1013 ms. (987 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 20855 ms. (767 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5000, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 10:58:09] [INFO ] Invariant cache hit.
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 10:58:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:58:09] [INFO ] Added : 67 causal constraints over 14 iterations in 122 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 10:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2024-05-24 10:58:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:58:09] [INFO ] Added : 73 causal constraints over 17 iterations in 171 ms. Result :sat
Minimization took 59 ms.
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-24 10:58:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:58:10] [INFO ] Added : 71 causal constraints over 16 iterations in 149 ms. Result :sat
Minimization took 35 ms.
[2024-05-24 10:58:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2024-05-24 10:58:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:58:10] [INFO ] Added : 51 causal constraints over 13 iterations in 152 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 10:58:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-24 10:58:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 10:58:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 10:58:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 10:58:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-24 10:58:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2024-05-24 10:58:10] [INFO ] Added : 74 causal constraints over 16 iterations in 240 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 10:58:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2024-05-24 10:58:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-24 10:58:11] [INFO ] Added : 39 causal constraints over 8 iterations in 137 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 10:58:11] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-24 10:58:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:58:11] [INFO ] Added : 62 causal constraints over 14 iterations in 125 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 10:58:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-24 10:58:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-24 10:58:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:58:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 4 ms to minimize.
[2024-05-24 10:58:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 10:58:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2024-05-24 10:58:12] [INFO ] Added : 68 causal constraints over 15 iterations in 234 ms. Result :sat
Minimization took 36 ms.
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2024-05-24 10:58:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 10:58:12] [INFO ] Added : 73 causal constraints over 17 iterations in 148 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 57 ms returned sat
[2024-05-24 10:58:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 10:58:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 10:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:58:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2024-05-24 10:58:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 10:58:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-24 10:58:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
Minimization took 19 ms.
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-24 10:58:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 10:58:13] [INFO ] Added : 73 causal constraints over 15 iterations in 126 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 25 ms returned sat
[2024-05-24 10:58:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 10:58:13] [INFO ] Added : 48 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 10:58:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2024-05-24 10:58:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 10:58:14] [INFO ] Added : 57 causal constraints over 12 iterations in 141 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 10:58:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 10:58:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 10:58:14] [INFO ] Added : 70 causal constraints over 16 iterations in 221 ms. Result :sat
Minimization took 37 ms.
[2024-05-24 10:58:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:58:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 10:58:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2024-05-24 10:58:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 10:58:14] [INFO ] Added : 61 causal constraints over 14 iterations in 140 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5000, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5002, 5002, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-10 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-09 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 9 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2024-05-24 11:02:03] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000433 steps (2 resets) in 817 ms. (1223 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 15057 ms. (929 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 11:02:19] [INFO ] Invariant cache hit.
[2024-05-24 11:02:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 11:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:19] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-24 11:02:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 11:02:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 24 ms returned sat
[2024-05-24 11:02:19] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 11:02:19] [INFO ] Added : 26 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 11:02:19] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 66 ms returned sat
[2024-05-24 11:02:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-24 11:02:20] [INFO ] Added : 35 causal constraints over 7 iterations in 60 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 11:02:20] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 11:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 38 ms returned sat
[2024-05-24 11:02:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:02:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-05-24 11:02:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 11:02:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-24 11:02:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2024-05-24 11:02:20] [INFO ] Added : 51 causal constraints over 12 iterations in 204 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 11:02:20] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 11:02:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 26 ms returned sat
[2024-05-24 11:02:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 11:02:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 11:02:20] [INFO ] Added : 24 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:02:21] [INFO ] Added : 42 causal constraints over 10 iterations in 69 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:02:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:02:21] [INFO ] Added : 39 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 34 ms.
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 11:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 25 ms returned sat
[2024-05-24 11:02:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:02:21] [INFO ] Added : 49 causal constraints over 10 iterations in 105 ms. Result :sat
Minimization took 37 ms.
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 11:02:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-24 11:02:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:02:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 11:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 11:02:21] [INFO ] Added : 36 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 34 ms.
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:02:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 23 ms returned sat
[2024-05-24 11:02:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 11:02:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 51 ms returned sat
[2024-05-24 11:02:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-24 11:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 11:02:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 66 ms returned sat
[2024-05-24 11:02:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:02:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 11:02:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-24 11:02:22] [INFO ] Added : 39 causal constraints over 9 iterations in 137 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 11:02:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:02:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 67 ms returned sat
[2024-05-24 11:02:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 11:02:22] [INFO ] Added : 25 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 11:02:23] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:02:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:02:23] [INFO ] Added : 41 causal constraints over 9 iterations in 68 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 11:02:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 11:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:02:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-24 11:02:23] [INFO ] [Nat]Added 14 Read/Feed constraints in 26 ms returned sat
[2024-05-24 11:02:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:02:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5002, 5001, 5000, 5001, 5002, 5002, 5000, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5002, 5002, 5003, 5003, 5003, 5002]
FORMULA JoinFreeModules-PT-5000-UpperBounds-15 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-11 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-08 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5000, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 55 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 55 /70 variables (removed 15) and now considering 88/112 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 55/70 places, 88/112 transitions.
// Phase 1: matrix 88 rows 55 cols
[2024-05-24 11:04:32] [INFO ] Computed 11 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5000, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001375 steps (2 resets) in 605 ms. (1652 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 9608 ms. (1144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 11:04:42] [INFO ] Invariant cache hit.
[2024-05-24 11:04:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:42] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-24 11:04:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-24 11:04:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2024-05-24 11:04:42] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-24 11:04:42] [INFO ] Added : 35 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 11:04:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:04:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:04:43] [INFO ] Added : 51 causal constraints over 11 iterations in 139 ms. Result :sat
Minimization took 38 ms.
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:04:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 212 ms returned sat
[2024-05-24 11:04:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:04:43] [INFO ] Added : 53 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:04:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 28 ms returned sat
[2024-05-24 11:04:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:04:43] [INFO ] Added : 31 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 11:04:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:04:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 25 ms returned sat
[2024-05-24 11:04:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:04:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-24 11:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 13 ms.
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:04:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 27 ms returned sat
[2024-05-24 11:04:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:04:44] [INFO ] Added : 28 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 11:04:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 145 ms returned sat
[2024-05-24 11:04:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:04:44] [INFO ] Added : 37 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:04:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 11:04:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 26 ms returned sat
[2024-05-24 11:04:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:04:44] [INFO ] Added : 35 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 30 ms.
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2024-05-24 11:04:45] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:04:45] [INFO ] Added : 31 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 79 ms returned sat
[2024-05-24 11:04:45] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:04:45] [INFO ] Added : 39 causal constraints over 10 iterations in 58 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 11:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 11:04:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:04:45] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:04:45] [INFO ] Added : 57 causal constraints over 12 iterations in 83 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5002, 5001, 5002, 5001, 5000, 5001, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5002, 5003, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-04 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 50 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /55 variables (removed 5) and now considering 80/88 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/55 places, 80/88 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-05-24 11:06:10] [INFO ] Computed 10 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000008 steps (2 resets) in 573 ms. (1742 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 7859 ms. (1272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 11:06:18] [INFO ] Invariant cache hit.
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:06:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:06:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 37 ms returned sat
[2024-05-24 11:06:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:06:18] [INFO ] Added : 29 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:06:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:06:18] [INFO ] Added : 39 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 11:06:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2024-05-24 11:06:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:06:19] [INFO ] Added : 17 causal constraints over 5 iterations in 64 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-24 11:06:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:06:19] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 86 ms returned sat
[2024-05-24 11:06:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:06:19] [INFO ] Added : 34 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:06:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:06:19] [INFO ] Added : 46 causal constraints over 10 iterations in 113 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 11:06:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 108 ms returned sat
[2024-05-24 11:06:20] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 11:06:20] [INFO ] Added : 42 causal constraints over 10 iterations in 95 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 11:06:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 66 ms returned sat
[2024-05-24 11:06:20] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 11:06:20] [INFO ] Added : 28 causal constraints over 7 iterations in 109 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 11:06:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:06:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-24 11:06:20] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:06:20] [INFO ] Added : 29 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5002, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5002, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-02 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 45 /50 variables (removed 5) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 45/50 places, 72/80 transitions.
// Phase 1: matrix 72 rows 45 cols
[2024-05-24 11:07:22] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5002, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001124 steps (2 resets) in 533 ms. (1874 steps per ms)
FORMULA JoinFreeModules-PT-5000-UpperBounds-12 5003 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000007 steps (16 resets) in 5984 ms. (1336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 11:07:29] [INFO ] Invariant cache hit.
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 11:07:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 11:07:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:07:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:07:29] [INFO ] Added : 36 causal constraints over 9 iterations in 50 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:07:29] [INFO ] Added : 41 causal constraints over 10 iterations in 52 ms. Result :sat
Minimization took 22 ms.
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:07:29] [INFO ] Added : 37 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 60 ms returned sat
[2024-05-24 11:07:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:07:29] [INFO ] Added : 23 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 68 ms returned sat
[2024-05-24 11:07:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:07:30] [INFO ] Added : 33 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-24 11:07:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:07:30] [INFO ] Added : 39 causal constraints over 9 iterations in 55 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 106 ms returned sat
[2024-05-24 11:07:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 11:07:30] [INFO ] Added : 38 causal constraints over 9 iterations in 52 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 11:07:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 16 ms returned sat
[2024-05-24 11:07:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:07:30] [INFO ] Added : 37 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /45 variables (removed 5) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 40/45 places, 64/72 transitions.
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:08:15] [INFO ] Computed 8 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001392 steps (2 resets) in 458 ms. (2181 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4985 ms. (1604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2024-05-24 11:08:21] [INFO ] Invariant cache hit.
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 11:08:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:08:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:08:21] [INFO ] Added : 34 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:08:21] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:08:21] [INFO ] Added : 33 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:08:21] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:08:21] [INFO ] Added : 32 causal constraints over 10 iterations in 43 ms. Result :sat
Minimization took 20 ms.
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:08:21] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:08:21] [INFO ] Added : 36 causal constraints over 9 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-24 11:08:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 11:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 11:08:22] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 11:08:22] [INFO ] Added : 36 causal constraints over 10 iterations in 55 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:08:22] [INFO ] Added : 42 causal constraints over 11 iterations in 136 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 11:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-24 11:08:22] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:08:22] [INFO ] Added : 36 causal constraints over 9 iterations in 48 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 11:08:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:08:22] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:08:22] [INFO ] Added : 36 causal constraints over 10 iterations in 62 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-24 11:08:59] [INFO ] Invariant cache hit.
[2024-05-24 11:08:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 11:08:59] [INFO ] Invariant cache hit.
[2024-05-24 11:08:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:08:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 11:08:59] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 11:08:59] [INFO ] Invariant cache hit.
[2024-05-24 11:08:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1665 ms. Remains : 40/40 places, 64/64 transitions.
RANDOM walk for 45647 steps (8 resets) in 44 ms. (1014 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
[2024-05-24 11:09:01] [INFO ] Flatten gal took : 55 ms
[2024-05-24 11:09:01] [INFO ] Flatten gal took : 17 ms
[2024-05-24 11:09:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6398742165726221689.gal : 5 ms
[2024-05-24 11:09:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8410141242414640712.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/ReachabilityCardinality6398742165726221689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8410141242414640712.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/ReachabilityCardinality8410141242414640712.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 135365 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 16
Probabilistic random walk after 135365 steps, saw 124582 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-24 11:09:04] [INFO ] Invariant cache hit.
[2024-05-24 11:09:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 11:09:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 8/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 64/104 variables, 40/56 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/64 constraints. Problems are: Problem set: 8 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 64 constraints, problems are : Problem set: 8 solved, 8 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 8/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 64/104 variables, 40/56 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/64 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 8/72 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/72 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/72 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 72 constraints, problems are : Problem set: 8 solved, 8 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 8/8 constraints]
After SMT, in 652ms problems are : Problem set: 8 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :11747 after 45500
Parikh walk visited 2 properties in 30000 ms.
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /40 variables (removed 10) and now considering 48/64 (removed 16) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-05-24 11:09:35] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 11:09:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1083 ms. Remains : 30/40 places, 48/64 transitions.
RANDOM walk for 42516 steps (6 resets) in 23 ms. (1771 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 528735 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 6
Probabilistic random walk after 528735 steps, saw 459156 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-24 11:09:39] [INFO ] Invariant cache hit.
[2024-05-24 11:09:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 11:09:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 11:09:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/78 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 50 constraints, problems are : Problem set: 0 solved, 6 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2024-05-24 11:09:51] [INFO ] Flatten gal took : 7 ms
[2024-05-24 11:09:51] [INFO ] Applying decomposition
[2024-05-24 11:09:51] [INFO ] Flatten gal took : 28 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/graph18058867511718483789.txt' '-o' '/tmp/graph18058867511718483789.bin' '-w' '/tmp/graph18058867511718483789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18058867511718483789.bin' '-l' '-1' '-v' '-w' '/tmp/graph18058867511718483789.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:09:51] [INFO ] Decomposing Gal with order
[2024-05-24 11:09:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:09:51] [INFO ] Flatten gal took : 18 ms
[2024-05-24 11:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:09:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17187875765721758196.gal : 2 ms
[2024-05-24 11:09:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6744271483004174809.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/ReachabilityCardinality17187875765721758196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6744271483004174809.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/ReachabilityCardinality6744271483004174809.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :11747 after 45500
Parikh walk visited 2 properties in 30000 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 20 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 20 /30 variables (removed 10) and now considering 32/48 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/30 places, 32/48 transitions.
RANDOM walk for 47814 steps (7 resets) in 75 ms. (629 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 262342 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 4
Probabilistic random walk after 262342 steps, saw 218612 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 32 rows 20 cols
[2024-05-24 11:10:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 11:10:12] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 28 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 11:10:12] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 11:10:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 11:10:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 35 constraints, problems are : Problem set: 0 solved, 4 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13002 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-24 11:10:26] [INFO ] Invariant cache hit.
[2024-05-24 11:10:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 11:10:26] [INFO ] Invariant cache hit.
[2024-05-24 11:10:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 11:10:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 11:10:26] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-24 11:10:26] [INFO ] Invariant cache hit.
[2024-05-24 11:10:26] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 28 constraints, problems are : Problem set: 0 solved, 24 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 52 constraints, problems are : Problem set: 0 solved, 24 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 20/20 places, 32/32 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001, 5001, 5001, 5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Starting property specific reduction for JoinFreeModules-PT-5000-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:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:10:26] [INFO ] Computed 8 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 9 ms. (1000 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:[2500] Max Struct:[5003]
[2024-05-24 11:10:26] [INFO ] Invariant cache hit.
[2024-05-24 11:10:26] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:10:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 11:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:10:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:10:26] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:10:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:10:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:10:26] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 11:10:26] [INFO ] Added : 34 causal constraints over 9 iterations in 46 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2500] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5002] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:10:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:10:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5002] Max Struct:[5003]
RANDOM walk for 1000250 steps (2 resets) in 102 ms. (9711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5002] Max Struct:[5003]
[2024-05-24 11:10:32] [INFO ] Invariant cache hit.
[2024-05-24 11:10:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:10:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:10:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:10:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:10:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 11:10:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-24 11:10:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5002] Max Struct:[5002]
FORMULA JoinFreeModules-PT-5000-UpperBounds-00 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-24 11:10:32] [INFO ] Flatten gal took : 1 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 11:10:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:10:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2886367753013745117.gal : 1 ms
[2024-05-24 11:10:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7522645836220327839.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/ReachabilityCardinality2886367753013745117.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7522645836220327839.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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/ReachabilityCardinality7522645836220327839.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-00 in 5719 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01
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:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:10:32] [INFO ] Computed 8 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 12505 steps (2 resets) in 7 ms. (1563 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[168] Max Struct:[5003]
[2024-05-24 11:10:32] [INFO ] Invariant cache hit.
[2024-05-24 11:10:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:10:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 11:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:10:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:10:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:10:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:10:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:10:32] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:10:32] [INFO ] Added : 29 causal constraints over 7 iterations in 33 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[168] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:10:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:10:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000337 steps (2 resets) in 105 ms. (9437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 139 ms. (7142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:10:38] [INFO ] Invariant cache hit.
[2024-05-24 11:10:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:10:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:10:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:10:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:10:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:10:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 11:10:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:10:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 11:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-24 11:10:38] [INFO ] Added : 5 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:10:38] [INFO ] Invariant cache hit.
[2024-05-24 11:10:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:10:38] [INFO ] Invariant cache hit.
[2024-05-24 11:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:10:38] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-24 11:10:38] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:10:38] [INFO ] Invariant cache hit.
[2024-05-24 11:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 49442 steps (8 resets) in 12 ms. (3803 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
[2024-05-24 11:10:39] [INFO ] Flatten gal took : 14 ms
[2024-05-24 11:10:39] [INFO ] Flatten gal took : 0 ms
[2024-05-24 11:10:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11589340939781743207.gal : 2 ms
[2024-05-24 11:10:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2527445520850719783.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/ReachabilityCardinality11589340939781743207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2527445520850719783.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 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 ...329
Loading property file /tmp/ReachabilityCardinality2527445520850719783.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 882221 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 882221 steps, saw 394306 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2024-05-24 11:10:42] [INFO ] Invariant cache hit.
[2024-05-24 11:10:42] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:10:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 268 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:10:42] [INFO ] Invariant cache hit.
[2024-05-24 11:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40852 steps (7 resets) in 10 ms. (3713 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3597432 steps, run timeout after 3001 ms. (steps per millisecond=1198 ) properties seen :0 out of 1
Probabilistic random walk after 3597432 steps, saw 1369659 distinct states, run finished after 3001 ms. (steps per millisecond=1198 ) properties seen :0
[2024-05-24 11:10:45] [INFO ] Invariant cache hit.
[2024-05-24 11:10:45] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 338 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:10:45] [INFO ] Invariant cache hit.
[2024-05-24 11:10:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 11:10:45] [INFO ] Invariant cache hit.
[2024-05-24 11:10:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:10:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-24 11:10:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:10:45] [INFO ] Invariant cache hit.
[2024-05-24 11:10:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:10:46] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:10:46] [INFO ] Applying decomposition
[2024-05-24 11:10:46] [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/graph17147709357246741134.txt' '-o' '/tmp/graph17147709357246741134.bin' '-w' '/tmp/graph17147709357246741134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17147709357246741134.bin' '-l' '-1' '-v' '-w' '/tmp/graph17147709357246741134.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:10:46] [INFO ] Decomposing Gal with order
[2024-05-24 11:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:10:46] [INFO ] Flatten gal took : 24 ms
[2024-05-24 11:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 11:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8593241788635403160.gal : 1 ms
[2024-05-24 11:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12974624325366275302.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/ReachabilityCardinality8593241788635403160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12974624325366275302.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/ReachabilityCardinality12974624325366275302.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01 in 63890 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-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:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:11:36] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 10004 steps (1 resets) in 12 ms. (769 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:[2500] Max Struct:[5003]
[2024-05-24 11:11:36] [INFO ] Invariant cache hit.
[2024-05-24 11:11:36] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:11:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:11:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:11:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:11:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:11:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:11:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:11:36] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:11:36] [INFO ] Added : 35 causal constraints over 9 iterations in 40 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2500] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:11:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 11:11:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:11:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000093 steps (2 resets) in 124 ms. (8000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 134 ms. (7407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:11:41] [INFO ] Invariant cache hit.
[2024-05-24 11:11:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:11:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:11:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:11:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 11:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:11:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:11:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:11:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-24 11:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-24 11:11:42] [INFO ] Added : 5 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:11:42] [INFO ] Invariant cache hit.
[2024-05-24 11:11:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 11:11:42] [INFO ] Invariant cache hit.
[2024-05-24 11:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:11:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 11:11:42] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:11:42] [INFO ] Invariant cache hit.
[2024-05-24 11:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:11:42] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 46942 steps (8 resets) in 12 ms. (3610 steps per ms) remains 2/2 properties
[2024-05-24 11:11:42] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:11:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6439636844465610103.gal : 1 ms
[2024-05-24 11:11:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3788164867600877066.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/ReachabilityCardinality6439636844465610103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3788164867600877066.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 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/ReachabilityCardinality3788164867600877066.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 941255 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 2
Probabilistic random walk after 941255 steps, saw 416870 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-05-24 11:11:45] [INFO ] Invariant cache hit.
[2024-05-24 11:11:45] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:11:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 75ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:11:46] [INFO ] Invariant cache hit.
[2024-05-24 11:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 44480 steps (6 resets) in 12 ms. (3421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4204433 steps, run timeout after 3001 ms. (steps per millisecond=1401 ) properties seen :0 out of 1
Probabilistic random walk after 4204433 steps, saw 1582251 distinct states, run finished after 3001 ms. (steps per millisecond=1401 ) properties seen :0
[2024-05-24 11:11:49] [INFO ] Invariant cache hit.
[2024-05-24 11:11:49] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 251 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:11:49] [INFO ] Invariant cache hit.
[2024-05-24 11:11:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 11:11:49] [INFO ] Invariant cache hit.
[2024-05-24 11:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:11:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-24 11:11:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:11:49] [INFO ] Invariant cache hit.
[2024-05-24 11:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:11:49] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:11:49] [INFO ] Applying decomposition
[2024-05-24 11:11:49] [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/graph4567842621568793801.txt' '-o' '/tmp/graph4567842621568793801.bin' '-w' '/tmp/graph4567842621568793801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4567842621568793801.bin' '-l' '-1' '-v' '-w' '/tmp/graph4567842621568793801.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:11:49] [INFO ] Decomposing Gal with order
[2024-05-24 11:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:11:49] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:11:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6726451592328902215.gal : 0 ms
[2024-05-24 11:11:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17042034035579889159.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/ReachabilityCardinality6726451592328902215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17042034035579889159.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/ReachabilityCardinality17042034035579889159.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :384607 after 988521
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-03 in 63638 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:12:39] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[187] Max Struct:[5003]
[2024-05-24 11:12:39] [INFO ] Invariant cache hit.
[2024-05-24 11:12:39] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:12:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:12:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:12:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:12:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:12:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:12:39] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:12:39] [INFO ] Added : 35 causal constraints over 9 iterations in 40 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[187] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:12:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:12:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1000363 steps (2 resets) in 104 ms. (9527 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 176 ms. (5649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:12:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:12:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:12:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:12:44] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:12:44] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 11:12:44] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1001161 steps (2 resets) in 102 ms. (9720 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:12:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:12:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 11:12:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:12:44] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 11:12:44] [INFO ] Invariant cache hit.
[2024-05-24 11:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:12:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 11:12:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:12:45] [INFO ] Invariant cache hit.
[2024-05-24 11:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 45852 steps (7 resets) in 14 ms. (3056 steps per ms) remains 2/2 properties
[2024-05-24 11:12:45] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:12:45] [INFO ] Flatten gal took : 6 ms
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
[2024-05-24 11:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality561131639885733911.gal : 5 ms
[2024-05-24 11:12:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15080777408811640665.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/ReachabilityCardinality561131639885733911.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15080777408811640665.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/ReachabilityCardinality15080777408811640665.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 934855 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :0 out of 2
Probabilistic random walk after 934855 steps, saw 414457 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
[2024-05-24 11:12:48] [INFO ] Invariant cache hit.
[2024-05-24 11:12:48] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 77ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:12:48] [INFO ] Invariant cache hit.
[2024-05-24 11:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 43191 steps (7 resets) in 12 ms. (3322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3862465 steps, run timeout after 3001 ms. (steps per millisecond=1287 ) properties seen :0 out of 1
Probabilistic random walk after 3862465 steps, saw 1462629 distinct states, run finished after 3001 ms. (steps per millisecond=1287 ) properties seen :0
[2024-05-24 11:12:51] [INFO ] Invariant cache hit.
[2024-05-24 11:12:51] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 258 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:12:51] [INFO ] Invariant cache hit.
[2024-05-24 11:12:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 11:12:51] [INFO ] Invariant cache hit.
[2024-05-24 11:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:12:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 11:12:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:12:51] [INFO ] Invariant cache hit.
[2024-05-24 11:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:12:52] [INFO ] Flatten gal took : 0 ms
[2024-05-24 11:12:52] [INFO ] Applying decomposition
[2024-05-24 11:12:52] [INFO ] Flatten gal took : 0 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/graph13343063184791872005.txt' '-o' '/tmp/graph13343063184791872005.bin' '-w' '/tmp/graph13343063184791872005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13343063184791872005.bin' '-l' '-1' '-v' '-w' '/tmp/graph13343063184791872005.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:12:52] [INFO ] Decomposing Gal with order
[2024-05-24 11:12:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:12:52] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:12:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17737752522616080167.gal : 0 ms
[2024-05-24 11:12:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11471335820454869351.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/ReachabilityCardinality17737752522616080167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11471335820454869351.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/ReachabilityCardinality11471335820454869351.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05 in 62253 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:13:42] [INFO ] Computed 8 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 12506 steps (2 resets) in 7 ms. (1563 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-05-24 11:13:42] [INFO ] Invariant cache hit.
[2024-05-24 11:13:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:13:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 11:13:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:13:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:13:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:13:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:13:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-24 11:13:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 11:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-24 11:13:42] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 11:13:42] [INFO ] Added : 36 causal constraints over 10 iterations in 51 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:13:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:13:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1000058 steps (2 resets) in 100 ms. (9901 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 170 ms. (5847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-05-24 11:13:46] [INFO ] Invariant cache hit.
[2024-05-24 11:13:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:13:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 11:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:13:46] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 11:13:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:13:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:13:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:13:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 11:13:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:13:46] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:13:46] [INFO ] Invariant cache hit.
[2024-05-24 11:13:46] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 11:13:46] [INFO ] Invariant cache hit.
[2024-05-24 11:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:13:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-24 11:13:46] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:13:46] [INFO ] Invariant cache hit.
[2024-05-24 11:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:13:46] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 45850 steps (6 resets) in 11 ms. (3820 steps per ms) remains 2/2 properties
[2024-05-24 11:13:46] [INFO ] Flatten gal took : 1 ms
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
[2024-05-24 11:13:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17967011217094969338.gal : 12 ms
[2024-05-24 11:13:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13766209191369378925.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/ReachabilityCardinality17967011217094969338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13766209191369378925.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/ReachabilityCardinality13766209191369378925.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1687710 steps, run timeout after 3004 ms. (steps per millisecond=561 ) properties seen :0 out of 2
Probabilistic random walk after 1687710 steps, saw 693951 distinct states, run finished after 3004 ms. (steps per millisecond=561 ) properties seen :0
[2024-05-24 11:13:49] [INFO ] Invariant cache hit.
[2024-05-24 11:13:49] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:13:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 78ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:13:49] [INFO ] Invariant cache hit.
[2024-05-24 11:13:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 48316 steps (8 resets) in 10 ms. (4392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3423949 steps, run timeout after 3001 ms. (steps per millisecond=1140 ) properties seen :0 out of 1
Probabilistic random walk after 3423949 steps, saw 1309785 distinct states, run finished after 3001 ms. (steps per millisecond=1140 ) properties seen :0
[2024-05-24 11:13:52] [INFO ] Invariant cache hit.
[2024-05-24 11:13:52] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:13:52] [INFO ] Invariant cache hit.
[2024-05-24 11:13:52] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 11:13:52] [INFO ] Invariant cache hit.
[2024-05-24 11:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:13:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 11:13:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:13:52] [INFO ] Invariant cache hit.
[2024-05-24 11:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:13:52] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:13:52] [INFO ] Applying decomposition
[2024-05-24 11:13:52] [INFO ] Flatten gal took : 0 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/graph312840462719058524.txt' '-o' '/tmp/graph312840462719058524.bin' '-w' '/tmp/graph312840462719058524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph312840462719058524.bin' '-l' '-1' '-v' '-w' '/tmp/graph312840462719058524.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:13:52] [INFO ] Decomposing Gal with order
[2024-05-24 11:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:13:52] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:13:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5659014849530649606.gal : 1 ms
[2024-05-24 11:13:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15028549375781090061.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/ReachabilityCardinality5659014849530649606.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15028549375781090061.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/ReachabilityCardinality15028549375781090061.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :858808 after 868783
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06 in 60920 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-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:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:14:43] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 12505 steps (2 resets) in 14 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[168] Max Struct:[5003]
[2024-05-24 11:14:43] [INFO ] Invariant cache hit.
[2024-05-24 11:14:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:14:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:14:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:14:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:14:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:14:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:14:43] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:14:43] [INFO ] Added : 41 causal constraints over 11 iterations in 48 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[168] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:14:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:14:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:14:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000791 steps (2 resets) in 105 ms. (9441 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 135 ms. (7352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:14:48] [INFO ] Invariant cache hit.
[2024-05-24 11:14:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:14:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:14:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:14:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:14:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:14:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:14:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 11:14:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:14:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-24 11:14:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-05-24 11:14:49] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:14:49] [INFO ] Invariant cache hit.
[2024-05-24 11:14:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:14:49] [INFO ] Invariant cache hit.
[2024-05-24 11:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:14:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 11:14:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:14:49] [INFO ] Invariant cache hit.
[2024-05-24 11:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46776 steps (8 resets) in 11 ms. (3898 steps per ms) remains 2/2 properties
[2024-05-24 11:14:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 11:14:49] [INFO ] Flatten gal took : 2 ms
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2024-05-24 11:14:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16381792527734649094.gal : 5 ms
[2024-05-24 11:14:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12564638469859816959.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/ReachabilityCardinality16381792527734649094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12564638469859816959.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/ReachabilityCardinality12564638469859816959.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1528837 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :0 out of 2
Probabilistic random walk after 1528837 steps, saw 636070 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
[2024-05-24 11:14:52] [INFO ] Invariant cache hit.
[2024-05-24 11:14:52] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:14:52] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 22 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 294 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:14:53] [INFO ] Invariant cache hit.
[2024-05-24 11:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46068 steps (7 resets) in 20 ms. (2193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3293388 steps, run timeout after 3001 ms. (steps per millisecond=1097 ) properties seen :0 out of 1
Probabilistic random walk after 3293388 steps, saw 1265062 distinct states, run finished after 3001 ms. (steps per millisecond=1097 ) properties seen :0
[2024-05-24 11:14:56] [INFO ] Invariant cache hit.
[2024-05-24 11:14:56] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 304 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:14:56] [INFO ] Invariant cache hit.
[2024-05-24 11:14:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:14:56] [INFO ] Invariant cache hit.
[2024-05-24 11:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:14:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 11:14:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:14:56] [INFO ] Invariant cache hit.
[2024-05-24 11:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:14:56] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:14:56] [INFO ] Applying decomposition
[2024-05-24 11:14:56] [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/graph18150391487664425005.txt' '-o' '/tmp/graph18150391487664425005.bin' '-w' '/tmp/graph18150391487664425005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18150391487664425005.bin' '-l' '-1' '-v' '-w' '/tmp/graph18150391487664425005.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:14:56] [INFO ] Decomposing Gal with order
[2024-05-24 11:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:14:56] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 11:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8246938936873372333.gal : 1 ms
[2024-05-24 11:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10842326029461865783.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/ReachabilityCardinality8246938936873372333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10842326029461865783.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/ReachabilityCardinality10842326029461865783.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-07 in 63949 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:15:46] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-05-24 11:15:46] [INFO ] Invariant cache hit.
[2024-05-24 11:15:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:15:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:15:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:15:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:15:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:15:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:15:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-24 11:15:47] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 11:15:47] [INFO ] Added : 36 causal constraints over 9 iterations in 44 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:15:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 11:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:15:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1000291 steps (2 resets) in 100 ms. (9903 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2024-05-24 11:15:50] [INFO ] Invariant cache hit.
[2024-05-24 11:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:15:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:15:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:15:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:15:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:15:50] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:15:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:15:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:15:50] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:15:50] [INFO ] Invariant cache hit.
[2024-05-24 11:15:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 11:15:50] [INFO ] Invariant cache hit.
[2024-05-24 11:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:15:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 11:15:50] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:15:50] [INFO ] Invariant cache hit.
[2024-05-24 11:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:15:51] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:15:51] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 46148 steps (7 resets) in 15 ms. (2884 steps per ms) remains 2/2 properties
[2024-05-24 11:15:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9428991382874076528.gal : 1 ms
[2024-05-24 11:15:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2998025633383792140.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/ReachabilityCardinality9428991382874076528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2998025633383792140.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/ReachabilityCardinality2998025633383792140.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 967095 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 2
Probabilistic random walk after 967095 steps, saw 426210 distinct states, run finished after 3002 ms. (steps per millisecond=322 ) properties seen :0
[2024-05-24 11:15:54] [INFO ] Invariant cache hit.
[2024-05-24 11:15:54] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:15:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:15:54] [INFO ] Invariant cache hit.
[2024-05-24 11:15:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 48403 steps (8 resets) in 12 ms. (3723 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3494126 steps, run timeout after 3001 ms. (steps per millisecond=1164 ) properties seen :0 out of 1
Probabilistic random walk after 3494126 steps, saw 1334358 distinct states, run finished after 3001 ms. (steps per millisecond=1164 ) properties seen :0
[2024-05-24 11:15:57] [INFO ] Invariant cache hit.
[2024-05-24 11:15:57] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:15:57] [INFO ] Invariant cache hit.
[2024-05-24 11:15:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:15:57] [INFO ] Invariant cache hit.
[2024-05-24 11:15:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:15:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 11:15:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:15:57] [INFO ] Invariant cache hit.
[2024-05-24 11:15:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:15:57] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:15:57] [INFO ] Applying decomposition
[2024-05-24 11:15:57] [INFO ] Flatten gal took : 0 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/graph18147824141764165389.txt' '-o' '/tmp/graph18147824141764165389.bin' '-w' '/tmp/graph18147824141764165389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18147824141764165389.bin' '-l' '-1' '-v' '-w' '/tmp/graph18147824141764165389.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:15:57] [INFO ] Decomposing Gal with order
[2024-05-24 11:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:15:57] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:15:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17571463985388584271.gal : 1 ms
[2024-05-24 11:15:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14431494544367185634.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/ReachabilityCardinality17571463985388584271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14431494544367185634.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/ReachabilityCardinality14431494544367185634.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :384607 after 988559
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13 in 60701 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 11:16:47] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[187] Max Struct:[5003]
[2024-05-24 11:16:47] [INFO ] Invariant cache hit.
[2024-05-24 11:16:47] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 11:16:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 11:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:16:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 11:16:47] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 11:16:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 11:16:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:16:47] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:16:47] [INFO ] Added : 35 causal constraints over 9 iterations in 52 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[187] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4997] Max Struct:[5003]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-24 11:16:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 11:16:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-24 11:16:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4997] Max Struct:[5003]
RANDOM walk for 1000137 steps (2 resets) in 101 ms. (9805 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
[2024-05-24 11:16:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:16:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:16:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:16:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:16:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:16:52] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:16:52] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
[2024-05-24 11:16:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
[2024-05-24 11:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:16:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 11:16:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
[2024-05-24 11:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1001684 steps (2 resets) in 103 ms. (9631 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2024-05-24 11:16:52] [INFO ] Invariant cache hit.
[2024-05-24 11:16:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 11:16:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:16:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 11:16:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:16:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 11:16:52] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:16:52] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:16:53] [INFO ] Invariant cache hit.
[2024-05-24 11:16:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:16:53] [INFO ] Invariant cache hit.
[2024-05-24 11:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:16:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-24 11:16:53] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:16:53] [INFO ] Invariant cache hit.
[2024-05-24 11:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 5/5 places, 8/8 transitions.
[2024-05-24 11:16:53] [INFO ] Flatten gal took : 0 ms
[2024-05-24 11:16:53] [INFO ] Flatten gal took : 0 ms
[2024-05-24 11:16:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14159835167287576061.gal : 0 ms
[2024-05-24 11:16:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3292837132782263485.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/ReachabilityCardinality14159835167287576061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3292837132782263485.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 45020 steps (8 resets) in 14 ms. (3001 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 ...329
Loading property file /tmp/ReachabilityCardinality3292837132782263485.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 912316 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 2
Probabilistic random walk after 912316 steps, saw 406071 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
[2024-05-24 11:16:56] [INFO ] Invariant cache hit.
[2024-05-24 11:16:56] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 11:16:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-24 11:16:56] [INFO ] Invariant cache hit.
[2024-05-24 11:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 47518 steps (7 resets) in 12 ms. (3655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3817198 steps, run timeout after 3001 ms. (steps per millisecond=1271 ) properties seen :0 out of 1
Probabilistic random walk after 3817198 steps, saw 1447250 distinct states, run finished after 3001 ms. (steps per millisecond=1271 ) properties seen :0
[2024-05-24 11:16:59] [INFO ] Invariant cache hit.
[2024-05-24 11:16:59] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-24 11:16:59] [INFO ] Invariant cache hit.
[2024-05-24 11:16:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 11:16:59] [INFO ] Invariant cache hit.
[2024-05-24 11:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:17:00] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 11:17:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 11:17:00] [INFO ] Invariant cache hit.
[2024-05-24 11:17:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 11:17:00] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:17:00] [INFO ] Applying decomposition
[2024-05-24 11:17:00] [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/graph3526846449189778256.txt' '-o' '/tmp/graph3526846449189778256.bin' '-w' '/tmp/graph3526846449189778256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3526846449189778256.bin' '-l' '-1' '-v' '-w' '/tmp/graph3526846449189778256.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:17:00] [INFO ] Decomposing Gal with order
[2024-05-24 11:17:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:17:00] [INFO ] Flatten gal took : 1 ms
[2024-05-24 11:17:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:17:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5867271253347577998.gal : 1 ms
[2024-05-24 11:17:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1222736220845902035.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/ReachabilityCardinality5867271253347577998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1222736220845902035.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/ReachabilityCardinality1222736220845902035.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 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :384607 after 858787
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14 in 62545 ms.
[2024-05-24 11:17:50] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:17:50] [INFO ] Applying decomposition
[2024-05-24 11:17:50] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13334151109670807650.txt' '-o' '/tmp/graph13334151109670807650.bin' '-w' '/tmp/graph13334151109670807650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13334151109670807650.bin' '-l' '-1' '-v' '-w' '/tmp/graph13334151109670807650.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:17:50] [INFO ] Decomposing Gal with order
[2024-05-24 11:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:17:50] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:17:50] [INFO ] Time to serialize gal into /tmp/UpperBounds1473191854177294936.gal : 1 ms
[2024-05-24 11:17:50] [INFO ] Time to serialize properties into /tmp/UpperBounds12767929715127982094.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/UpperBounds1473191854177294936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12767929715127982094.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds12767929715127982094.prop.
Detected timeout of ITS tools.
[2024-05-24 11:46:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:46:45] [INFO ] Time to serialize gal into /tmp/UpperBounds1669293647183067667.gal : 1 ms
[2024-05-24 11:46:45] [INFO ] Time to serialize properties into /tmp/UpperBounds4833292240444298045.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/UpperBounds1669293647183067667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4833292240444298045.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 ...304
Loading property file /tmp/UpperBounds4833292240444298045.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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="JoinFreeModules-PT-5000"
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 JoinFreeModules-PT-5000, 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 r224-tall-171649612000093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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