Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600229.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716913481761

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 16:24:43] [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-28 16:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:24:43] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-28 16:24:43] [INFO ] Transformed 614 places.
[2024-05-28 16:24:43] [INFO ] Transformed 1242 transitions.
[2024-05-28 16:24:43] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 16:24:43] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-05-28 16:24:44] [INFO ] Computed 50 invariants in 88 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[8, 8, 3, 1, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (5 resets) in 150 ms. (66 steps per ms)
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140006 steps (29 resets) in 727 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[8, 8, 3, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf]
[2024-05-28 16:24:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 16:24:44] [INFO ] Invariant cache hit.
[2024-05-28 16:24:45] [INFO ] [Real]Absence check using 16 positive place invariants in 66 ms returned unsat
[2024-05-28 16:24:46] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned unsat
[2024-05-28 16:24:46] [INFO ] [Real]Absence check using 16 positive place invariants in 68 ms returned sat
[2024-05-28 16:24:46] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 56 ms returned sat
[2024-05-28 16:24:47] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2024-05-28 16:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:24:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 16:24:47] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned sat
[2024-05-28 16:24:49] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2024-05-28 16:24:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:24:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:24:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 1071 ms returned unknown
[2024-05-28 16:24:50] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-28 16:24:50] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 77 ms returned sat
[2024-05-28 16:24:51] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-05-28 16:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:24:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 16:24:52] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 38 ms returned sat
[2024-05-28 16:24:53] [INFO ] [Nat]Absence check using state equation in 1844 ms returned unknown
[2024-05-28 16:24:53] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 41 ms returned unsat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 12 ms returned unsat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 23 ms returned unsat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 16:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-05-28 16:24:55] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 16:24:55] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 23 ms returned sat
[2024-05-28 16:24:56] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2024-05-28 16:24:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:24:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 16:24:56] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-28 16:24:57] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2024-05-28 16:24:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:24:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 593 ms returned sat
[2024-05-28 16:24:58] [INFO ] Deduced a trap composed of 19 places in 542 ms of which 46 ms to minimize.
[2024-05-28 16:24:59] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1144 ms
[2024-05-28 16:24:59] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 16:24:59] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned unsat
[2024-05-28 16:24:59] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 16:24:59] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-28 16:25:00] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2024-05-28 16:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:25:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 122 ms returned sat
[2024-05-28 16:25:01] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 226 ms returned sat
[2024-05-28 16:25:05] [INFO ] [Nat]Absence check using state equation in 4582 ms returned unknown
[2024-05-28 16:25:05] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 16:25:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[1, 1, 3, 24, 1, 2, 1, 1, 1, 1, 4, 10, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 144 place count 541 transition count 979
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 272 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 413 transition count 915
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 416 place count 413 transition count 899
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 432 place count 397 transition count 899
Applied a total of 432 rules in 335 ms. Remains 397 /614 variables (removed 217) and now considering 899/1114 (removed 215) transitions.
Running 897 sub problems to find dead transitions.
[2024-05-28 16:25:06] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
// Phase 1: matrix 883 rows 397 cols
[2024-05-28 16:25:06] [INFO ] Computed 48 invariants in 24 ms
[2024-05-28 16:25:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-05-28 16:25:15] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:25:15] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:25:15] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:25:15] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:25:15] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:25:16] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 7 ms to minimize.
[2024-05-28 16:25:16] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 5 ms to minimize.
[2024-05-28 16:25:16] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:25:17] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 4 ms to minimize.
[2024-05-28 16:25:19] [INFO ] Deduced a trap composed of 38 places in 2018 ms of which 28 ms to minimize.
[2024-05-28 16:25:19] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:25:20] [INFO ] Deduced a trap composed of 134 places in 339 ms of which 3 ms to minimize.
[2024-05-28 16:25:21] [INFO ] Deduced a trap composed of 153 places in 220 ms of which 2 ms to minimize.
[2024-05-28 16:25:22] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 3 ms to minimize.
[2024-05-28 16:25:25] [INFO ] Deduced a trap composed of 219 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:25:25] [INFO ] Deduced a trap composed of 206 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:25:26] [INFO ] Deduced a trap composed of 133 places in 268 ms of which 3 ms to minimize.
[2024-05-28 16:25:26] [INFO ] Deduced a trap composed of 125 places in 295 ms of which 3 ms to minimize.
[2024-05-28 16:25:27] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 3 ms to minimize.
[2024-05-28 16:25:29] [INFO ] Deduced a trap composed of 158 places in 274 ms of which 3 ms to minimize.
SMT process timed out in 22605ms, After SMT, problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 22654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23063 ms. Remains : 397/614 places, 899/1114 transitions.
[2024-05-28 16:25:29] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:38:47] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 16:38:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (445 resets) in 4831 ms. (206 steps per ms)
BEST_FIRST walk for 4000001 steps (751 resets) in 9177 ms. (435 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-05-28 16:39:01] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 16:39:01] [INFO ] Invariant cache hit.
[2024-05-28 16:39:01] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:39:01] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-28 16:39:01] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2024-05-28 16:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 16:39:02] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-28 16:39:02] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-05-28 16:39:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:39:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 1326 ms returned sat
[2024-05-28 16:39:04] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 114 ms.
[2024-05-28 16:39:04] [INFO ] Added : 20 causal constraints over 4 iterations in 658 ms. Result :sat
Minimization took 4505 ms.
[2024-05-28 16:39:09] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 16:39:09] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-28 16:39:09] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-05-28 16:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:39:10] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-28 16:39:16] [INFO ] [Nat]Absence check using state equation in 6585 ms returned sat
[2024-05-28 16:39:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 178 ms returned sat
[2024-05-28 16:39:16] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 15 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 983 ms
[2024-05-28 16:39:17] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 119 ms.
[2024-05-28 16:39:19] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-28 16:39:19] [INFO ] Added : 131 causal constraints over 27 iterations in 1851 ms. Result :sat
Minimization took 4504 ms.
[2024-05-28 16:39:24] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:39:24] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 13 ms returned sat
[2024-05-28 16:39:25] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2024-05-28 16:39:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 16:39:25] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-28 16:39:35] [INFO ] [Nat]Absence check using state equation in 10012 ms returned sat
[2024-05-28 16:39:35] [INFO ] [Nat]Added 96 Read/Feed constraints in 489 ms returned sat
[2024-05-28 16:39:35] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 5 ms to minimize.
[2024-05-28 16:39:36] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 3 ms to minimize.
[2024-05-28 16:39:37] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-05-28 16:39:37] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:39:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1896 ms
[2024-05-28 16:39:37] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 67 ms.
[2024-05-28 16:39:52] [INFO ] Added : 50 causal constraints over 10 iterations in 15178 ms. Result :sat
Minimization took 4158 ms.
[2024-05-28 16:39:57] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 16:39:57] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-28 16:39:57] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2024-05-28 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:39:57] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2024-05-28 16:39:59] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2024-05-28 16:40:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 315 ms returned sat
[2024-05-28 16:40:00] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 69 ms.
[2024-05-28 16:40:01] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:40:01] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:40:01] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 5 ms to minimize.
[2024-05-28 16:40:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 497 ms
[2024-05-28 16:40:02] [INFO ] Added : 87 causal constraints over 18 iterations in 2059 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 28 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 397/397 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 23 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-28 16:40:08] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 16:40:08] [INFO ] Invariant cache hit.
[2024-05-28 16:40:08] [INFO ] Implicit Places using invariants in 542 ms returned [71, 117, 189, 197, 269, 312, 335, 342]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 548 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 389/397 places, 899/899 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 383 transition count 893
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 383 transition count 893
Applied a total of 12 rules in 35 ms. Remains 383 /389 variables (removed 6) and now considering 893/899 (removed 6) transitions.
[2024-05-28 16:40:08] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 16:40:08] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 16:40:09] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-28 16:40:09] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:40:09] [INFO ] Invariant cache hit.
[2024-05-28 16:40:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:40:15] [INFO ] Implicit Places using invariants and state equation in 5893 ms returned []
Implicit Place search using SMT with State Equation took 6392 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 383/397 places, 893/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7000 ms. Remains : 383/397 places, 893/899 transitions.
[2024-05-28 16:40:15] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:40:26] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:40:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (463 resets) in 4397 ms. (227 steps per ms)
BEST_FIRST walk for 4000001 steps (719 resets) in 8163 ms. (489 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-05-28 16:40:39] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:40:39] [INFO ] Invariant cache hit.
[2024-05-28 16:40:39] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:40:39] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 16:40:39] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-05-28 16:40:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:40:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:40:39] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 16:40:47] [INFO ] [Nat]Absence check using state equation in 7412 ms returned sat
[2024-05-28 16:40:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:40:47] [INFO ] [Nat]Added 96 Read/Feed constraints in 457 ms returned sat
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 4 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 520 ms
[2024-05-28 16:40:48] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 58 ms.
[2024-05-28 16:40:49] [INFO ] Added : 71 causal constraints over 15 iterations in 966 ms. Result :sat
Minimization took 3914 ms.
[2024-05-28 16:40:53] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 16:40:53] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-28 16:40:53] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-28 16:40:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:40:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:40:53] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-28 16:40:56] [INFO ] [Nat]Absence check using state equation in 2241 ms returned sat
[2024-05-28 16:40:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 464 ms returned sat
[2024-05-28 16:40:56] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 4 ms to minimize.
[2024-05-28 16:40:57] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:40:57] [INFO ] Deduced a trap composed of 184 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:40:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 875 ms
[2024-05-28 16:40:57] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 77 ms.
[2024-05-28 16:40:58] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:40:58] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:40:59] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 2 ms to minimize.
[2024-05-28 16:40:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1441 ms
[2024-05-28 16:41:00] [INFO ] Added : 58 causal constraints over 12 iterations in 2477 ms. Result :sat
Minimization took 3870 ms.
[2024-05-28 16:41:04] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:41:04] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-28 16:41:04] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-05-28 16:41:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:41:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:41:04] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 16:41:05] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2024-05-28 16:41:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 316 ms returned sat
[2024-05-28 16:41:06] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 86 ms.
[2024-05-28 16:41:07] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:41:07] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:41:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-05-28 16:41:08] [INFO ] Added : 72 causal constraints over 15 iterations in 1958 ms. Result :sat
Minimization took 3696 ms.
[2024-05-28 16:41:11] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:41:11] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-28 16:41:12] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2024-05-28 16:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:41:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:41:12] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-28 16:41:14] [INFO ] [Nat]Absence check using state equation in 1718 ms returned sat
[2024-05-28 16:41:14] [INFO ] [Nat]Added 96 Read/Feed constraints in 449 ms returned sat
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 155 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 169 places in 284 ms of which 3 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 957 ms
[2024-05-28 16:41:15] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 55 ms.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:41:17] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:41:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 672 ms
[2024-05-28 16:41:17] [INFO ] Added : 87 causal constraints over 19 iterations in 1908 ms. Result :sat
Minimization took 3944 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 49 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 30 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 16:41:24] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:41:24] [INFO ] Invariant cache hit.
[2024-05-28 16:41:25] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 16:41:25] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:41:25] [INFO ] Invariant cache hit.
[2024-05-28 16:41:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:41:29] [INFO ] Implicit Places using invariants and state equation in 4552 ms returned []
Implicit Place search using SMT with State Equation took 5138 ms to find 0 implicit places.
[2024-05-28 16:41:29] [INFO ] Redundant transitions in 99 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 16:41:29] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:41:29] [INFO ] Invariant cache hit.
[2024-05-28 16:41:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 4 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 3 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 134 places in 243 ms of which 3 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 231 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:41:44] [INFO ] Deduced a trap composed of 145 places in 289 ms of which 3 ms to minimize.
[2024-05-28 16:41:44] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:41:44] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 2 ms to minimize.
[2024-05-28 16:41:45] [INFO ] Deduced a trap composed of 123 places in 296 ms of which 5 ms to minimize.
[2024-05-28 16:41:45] [INFO ] Deduced a trap composed of 147 places in 298 ms of which 4 ms to minimize.
[2024-05-28 16:41:46] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 2 ms to minimize.
[2024-05-28 16:41:46] [INFO ] Deduced a trap composed of 174 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:41:47] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 181 places in 253 ms of which 3 ms to minimize.
[2024-05-28 16:41:53] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 3 ms to minimize.
[2024-05-28 16:41:54] [INFO ] Deduced a trap composed of 199 places in 300 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:42:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:42:08] [INFO ] Deduced a trap composed of 163 places in 269 ms of which 3 ms to minimize.
[2024-05-28 16:42:09] [INFO ] Deduced a trap composed of 172 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:42:09] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:42:09] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 2 ms to minimize.
[2024-05-28 16:42:09] [INFO ] Deduced a trap composed of 199 places in 214 ms of which 2 ms to minimize.
[2024-05-28 16:42:09] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 61972ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67304 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 16:42:31] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (27 resets) in 1559 ms. (25 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 635 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 536 ms. (74 steps per ms) remains 7/7 properties
[2024-05-28 16:42:43] [INFO ] Flatten gal took : 302 ms
BEST_FIRST walk for 40002 steps (10 resets) in 460 ms. (86 steps per ms) remains 7/7 properties
[2024-05-28 16:42:43] [INFO ] Flatten gal took : 143 ms
[2024-05-28 16:42:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6075449949527061848.gal : 27 ms
[2024-05-28 16:42:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14972883757949807481.prop : 2 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/ReachabilityCardinality6075449949527061848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14972883757949807481.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 7/7 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
BEST_FIRST walk for 40003 steps (12 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (14 resets) in 252 ms. (158 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality14972883757949807481.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :17 after 23
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :23 after 28
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :28 after 70
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :70 after 270
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :270 after 850
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :850 after 1940
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1940 after 10340
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :10340 after 15110
Interrupted probabilistic random walk after 67420 steps, run timeout after 3008 ms. (steps per millisecond=22 ) properties seen :0 out of 7
Probabilistic random walk after 67420 steps, saw 44573 distinct states, run finished after 3012 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-28 16:42:47] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:42:47] [INFO ] Invariant cache hit.
[2024-05-28 16:42:47] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :15110 after 17430
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :17430 after 25702
[2024-05-28 16:42:53] [INFO ] Deduced a trap composed of 38 places in 2855 ms of which 4 ms to minimize.
SMT process timed out in 5801ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 43 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running 891 sub problems to find dead transitions.
[2024-05-28 16:42:53] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:42:53] [INFO ] Invariant cache hit.
[2024-05-28 16:42:53] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :25702 after 467892
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:43:05] [INFO ] Deduced a trap composed of 19 places in 3651 ms of which 8 ms to minimize.
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 38 places in 2081 ms of which 27 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 38 places in 897 ms of which 26 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :467892 after 1.34137e+06
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 39 places in 1028 ms of which 26 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 39 places in 888 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 38 places in 1101 ms of which 23 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 145 places in 971 ms of which 3 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:43:14] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 50 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:43:19] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:43:19] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-05-28 16:43:26] [INFO ] Deduced a trap composed of 123 places in 246 ms of which 4 ms to minimize.
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 147 places in 246 ms of which 5 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 65536
[2024-05-28 16:43:27] [INFO ] Deduced a trap composed of 167 places in 280 ms of which 5 ms to minimize.
SDD size :1.34137e+06 after 2.17824e+06
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 169 places in 269 ms of which 6 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 169 places in 267 ms of which 5 ms to minimize.
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 165 places in 265 ms of which 6 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 142 places in 255 ms of which 5 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 4 ms to minimize.
[2024-05-28 16:43:29] [INFO ] Deduced a trap composed of 155 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:43:30] [INFO ] Deduced a trap composed of 155 places in 235 ms of which 8 ms to minimize.
[2024-05-28 16:43:30] [INFO ] Deduced a trap composed of 179 places in 274 ms of which 4 ms to minimize.
[2024-05-28 16:43:30] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 16:43:34] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:43:34] [INFO ] Applying decomposition
[2024-05-28 16:43:34] [INFO ] Flatten gal took : 46 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/graph14228761105347800163.txt' '-o' '/tmp/graph14228761105347800163.bin' '-w' '/tmp/graph14228761105347800163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14228761105347800163.bin' '-l' '-1' '-v' '-w' '/tmp/graph14228761105347800163.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:43:35] [INFO ] Decomposing Gal with order
[2024-05-28 16:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:43:35] [INFO ] Removed a total of 729 redundant transitions.
[2024-05-28 16:43:35] [INFO ] Flatten gal took : 545 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 65 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 28/28 constraints]
After SMT, in 42731ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 42740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42800 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 16:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 378 labels/synchronizations in 77 ms.
RANDOM walk for 40000 steps (19 resets) in 773 ms. (51 steps per ms) remains 6/6 properties
[2024-05-28 16:43:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8832913397392416968.gal : 17 ms
[2024-05-28 16:43:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9847156487470053596.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/ReachabilityCardinality8832913397392416968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9847156487470053596.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (11 resets) in 317 ms. (125 steps per ms) remains 6/6 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
BEST_FIRST walk for 40002 steps (13 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality9847156487470053596.prop.
BEST_FIRST walk for 40002 steps (11 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :13 after 16
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :16 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 48
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :48 after 65
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :65 after 108
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :108 after 507
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :507 after 2370
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2370 after 14859
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :14859 after 15395
Interrupted probabilistic random walk after 150058 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 6
Probabilistic random walk after 150058 steps, saw 95451 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-28 16:43:39] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:43:39] [INFO ] Invariant cache hit.
[2024-05-28 16:43:39] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 4096
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD size :22936 after 23242
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:43:40] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 877/1258 variables, 381/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 96/523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/1260 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :23242 after 24727
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1260 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 526 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2719 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:43:42] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 877/1258 variables, 381/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 96/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 6/530 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1258 variables, 0/530 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1260 variables, 2/532 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1260 variables, 1/533 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :24727 after 122544
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 159 places in 441 ms of which 6 ms to minimize.
[2024-05-28 16:43:51] [INFO ] Deduced a trap composed of 154 places in 419 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1260 variables, 2/535 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1260 variables, 0/535 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1260 variables, 0/535 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 535 constraints, problems are : Problem set: 2 solved, 4 unsolved in 9992 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints]
After SMT, in 12749ms problems are : Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :122544 after 734264
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :734264 after 1.7744e+06
Parikh walk visited 0 properties in 20753 ms.
Support contains 10 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 28 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 383/383 places, 893/893 transitions.
RANDOM walk for 40000 steps (13 resets) in 582 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 386 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 83787 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 4
Probabilistic random walk after 83787 steps, saw 54979 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-28 16:44:17] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:44:17] [INFO ] Invariant cache hit.
[2024-05-28 16:44:17] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 877/1258 variables, 381/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1258 variables, 96/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 148 places in 379 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1260 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1260 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 520 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 2 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 5 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 877/1258 variables, 381/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 96/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Detected timeout of ITS tools.
At refinement iteration 16 (INCLUDED_ONLY) 0/1258 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1260 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1260 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 147 places in 343 ms of which 3 ms to minimize.
[2024-05-28 16:44:38] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1260 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1260 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:44:53] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1260 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 189 places in 280 ms of which 4 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 158 places in 297 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1260 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 537 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 77620ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 34 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 27 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 16:45:34] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:45:34] [INFO ] Invariant cache hit.
[2024-05-28 16:45:35] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-28 16:45:35] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:45:35] [INFO ] Invariant cache hit.
[2024-05-28 16:45:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:45:38] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 4123 ms to find 0 implicit places.
[2024-05-28 16:45:38] [INFO ] Redundant transitions in 68 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 16:45:38] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:45:38] [INFO ] Invariant cache hit.
[2024-05-28 16:45:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 3 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:45:47] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:45:47] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:45:47] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 3 ms to minimize.
[2024-05-28 16:45:48] [INFO ] Deduced a trap composed of 145 places in 303 ms of which 3 ms to minimize.
[2024-05-28 16:45:48] [INFO ] Deduced a trap composed of 134 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:45:49] [INFO ] Deduced a trap composed of 231 places in 292 ms of which 3 ms to minimize.
[2024-05-28 16:45:52] [INFO ] Deduced a trap composed of 145 places in 213 ms of which 2 ms to minimize.
[2024-05-28 16:45:53] [INFO ] Deduced a trap composed of 166 places in 277 ms of which 3 ms to minimize.
[2024-05-28 16:45:53] [INFO ] Deduced a trap composed of 139 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:45:53] [INFO ] Deduced a trap composed of 123 places in 225 ms of which 3 ms to minimize.
[2024-05-28 16:45:54] [INFO ] Deduced a trap composed of 147 places in 279 ms of which 3 ms to minimize.
[2024-05-28 16:45:54] [INFO ] Deduced a trap composed of 180 places in 338 ms of which 5 ms to minimize.
[2024-05-28 16:45:55] [INFO ] Deduced a trap composed of 174 places in 384 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:45:56] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:46:01] [INFO ] Deduced a trap composed of 181 places in 253 ms of which 3 ms to minimize.
[2024-05-28 16:46:01] [INFO ] Deduced a trap composed of 181 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 199 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:46:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:46:18] [INFO ] Deduced a trap composed of 163 places in 257 ms of which 2 ms to minimize.
[2024-05-28 16:46:18] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 2 ms to minimize.
[2024-05-28 16:46:18] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 2 ms to minimize.
[2024-05-28 16:46:18] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:46:18] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 157 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 7)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 9)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 3)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 62068ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 62085ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66328 ms. Remains : 383/383 places, 893/893 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-02 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 2] Max Struct:[24, 4, +inf]
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-04
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:[24]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[24]
[2024-05-28 16:46:41] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:46:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[24]
RANDOM walk for 10000 steps (4 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[24]
[2024-05-28 16:46:41] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:46:41] [INFO ] Invariant cache hit.
[2024-05-28 16:46:41] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:46:41] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 16:46:41] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2024-05-28 16:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:46:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:46:41] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 16:46:42] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2024-05-28 16:46:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:46:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 326 ms returned sat
[2024-05-28 16:46:43] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:46:43] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:46:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-05-28 16:46:43] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 89 ms.
[2024-05-28 16:46:44] [INFO ] Added : 4 causal constraints over 1 iterations in 1024 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[24]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[24]
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 892
Applied a total of 2 rules in 68 ms. Remains 382 /383 variables (removed 1) and now considering 892/893 (removed 1) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 16:46:45] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-05-28 16:46:45] [INFO ] Computed 40 invariants in 47 ms
[2024-05-28 16:46:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:46:51] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:46:51] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:46:52] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:46:53] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:46:54] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:46:54] [INFO ] Deduced a trap composed of 218 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:46:56] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2024-05-28 16:46:56] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:47:03] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 59 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 60 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 22/22 constraints]
After SMT, in 41937ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 41952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42024 ms. Remains : 382/383 places, 892/893 transitions.
[2024-05-28 16:47:27] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:47:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[24]
RANDOM walk for 1000000 steps (468 resets) in 4224 ms. (236 steps per ms)
BEST_FIRST walk for 1000001 steps (188 resets) in 1904 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[24]
[2024-05-28 16:47:33] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:47:33] [INFO ] Invariant cache hit.
[2024-05-28 16:47:33] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 16:47:33] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 16:47:33] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-28 16:47:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:47:33] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-28 16:47:34] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-05-28 16:47:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:47:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 298 ms returned sat
[2024-05-28 16:47:34] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 526 transitions) in 57 ms.
[2024-05-28 16:47:35] [INFO ] Added : 47 causal constraints over 10 iterations in 1093 ms. Result :sat
Minimization took 3479 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[24]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[24]
Support contains 8 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 18 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 17 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 16:47:39] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:47:39] [INFO ] Invariant cache hit.
[2024-05-28 16:47:40] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-28 16:47:40] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:47:40] [INFO ] Invariant cache hit.
[2024-05-28 16:47:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:47:45] [INFO ] Implicit Places using invariants and state equation in 5038 ms returned []
Implicit Place search using SMT with State Equation took 5706 ms to find 0 implicit places.
[2024-05-28 16:47:45] [INFO ] Redundant transitions in 12 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 16:47:45] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:47:45] [INFO ] Invariant cache hit.
[2024-05-28 16:47:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:47:52] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:47:52] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-28 16:47:53] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:47:54] [INFO ] Deduced a trap composed of 218 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 149 places in 202 ms of which 2 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 149 places in 213 ms of which 16 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 2 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:48:04] [INFO ] Deduced a trap composed of 145 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/382 variables, 2/62 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 3 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1258 variables, and 65 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 88 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 23/61 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-05-28 16:48:29] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:48:31] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/63 constraints. Problems are: Problem set: 88 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 63 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 25/27 constraints]
After SMT, in 61493ms problems are : Problem set: 88 solved, 802 unsolved
Search for dead transitions found 88 dead transitions in 61501ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/382 places, 804/892 transitions.
Reduce places removed 2 places and 16 transitions.
Graph (complete) has 2376 edges and 380 vertex of which 8 are kept as prefixes of interest. Removing 372 places using SCC suffix rule.1 ms
Discarding 372 places :
Also discarding 780 output transitions
Drop transitions (Output transitions of discarded places.) removed 780 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 8
Reduce places removed 0 places and 8 transitions.
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 8 /382 variables (removed 374) and now considering 0/804 (removed 804) transitions.
[2024-05-28 16:48:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 16:48:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 16:48:47] [INFO ] Invariant cache hit.
[2024-05-28 16:48:47] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8/382 places, 0/892 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67317 ms. Remains : 8/382 places, 0/892 transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-04 in 126216 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 16:48:47] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 16:48:47] [INFO ] Computed 40 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (4 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 16:48:47] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:48:47] [INFO ] Invariant cache hit.
[2024-05-28 16:48:47] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:48:47] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-28 16:48:47] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2024-05-28 16:48:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:48:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-28 16:48:48] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-28 16:48:49] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-28 16:48:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:48:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 403 ms returned sat
[2024-05-28 16:48:49] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 61 ms.
[2024-05-28 16:48:51] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:48:51] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:48:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2024-05-28 16:48:51] [INFO ] Added : 72 causal constraints over 15 iterations in 2072 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 892
Applied a total of 2 rules in 34 ms. Remains 382 /383 variables (removed 1) and now considering 892/893 (removed 1) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 16:48:52] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-05-28 16:48:52] [INFO ] Computed 40 invariants in 16 ms
[2024-05-28 16:48:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 2 ms to minimize.
[2024-05-28 16:48:58] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:49:01] [INFO ] Deduced a trap composed of 218 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:49:03] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:49:03] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:49:03] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:49:04] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:49:04] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 59 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:49:18] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 60 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 22/22 constraints]
After SMT, in 41749ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 41759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41797 ms. Remains : 382/383 places, 892/893 transitions.
[2024-05-28 16:49:33] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:49:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (479 resets) in 3658 ms. (273 steps per ms)
BEST_FIRST walk for 1000001 steps (190 resets) in 1678 ms. (595 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 16:49:39] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:49:39] [INFO ] Invariant cache hit.
[2024-05-28 16:49:39] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 16:49:39] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-28 16:49:39] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-05-28 16:49:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 16:49:40] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2024-05-28 16:49:49] [INFO ] [Nat]Absence check using state equation in 9436 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 34 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 29 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 16:49:49] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:49:49] [INFO ] Invariant cache hit.
[2024-05-28 16:49:50] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-28 16:49:50] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:49:50] [INFO ] Invariant cache hit.
[2024-05-28 16:49:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:49:54] [INFO ] Implicit Places using invariants and state equation in 4522 ms returned []
Implicit Place search using SMT with State Equation took 5015 ms to find 0 implicit places.
[2024-05-28 16:49:54] [INFO ] Redundant transitions in 21 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 16:49:54] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:49:54] [INFO ] Invariant cache hit.
[2024-05-28 16:49:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 3 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 13 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:50:00] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:50:01] [INFO ] Deduced a trap composed of 134 places in 211 ms of which 8 ms to minimize.
[2024-05-28 16:50:02] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 2 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 134 places in 223 ms of which 2 ms to minimize.
[2024-05-28 16:50:05] [INFO ] Deduced a trap composed of 149 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 149 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:50:06] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 2 ms to minimize.
[2024-05-28 16:50:07] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 2 ms to minimize.
[2024-05-28 16:50:07] [INFO ] Deduced a trap composed of 156 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:50:08] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 31395ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 31409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36489 ms. Remains : 382/382 places, 892/892 transitions.
[2024-05-28 16:50:26] [INFO ] Flatten gal took : 101 ms
[2024-05-28 16:50:26] [INFO ] Flatten gal took : 63 ms
[2024-05-28 16:50:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality404122340205341004.gal : 9 ms
[2024-05-28 16:50:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8616459678319450599.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/ReachabilityCardinality404122340205341004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8616459678319450599.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 ...327
RANDOM walk for 40000 steps (19 resets) in 583 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8616459678319450599.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 270
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :270 after 850
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :850 after 1940
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1940 after 10340
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10340 after 15110
Interrupted probabilistic random walk after 167599 steps, run timeout after 3002 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 167599 steps, saw 105985 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 16:50:29] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:50:29] [INFO ] Invariant cache hit.
[2024-05-28 16:50:29] [INFO ] State equation strengthened by 96 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) 277/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/379 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 876/1256 variables, 380/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 96/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1258 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1258 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 277/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :15110 after 17426
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/379 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/380 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 876/1256 variables, 380/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 96/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1256 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1258 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1258 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1258 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1258 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3181ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 16:50:32] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:50:32] [INFO ] Invariant cache hit.
[2024-05-28 16:50:32] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :17426 after 25590
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:50:38] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:50:39] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:50:39] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:50:39] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:50:39] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:50:40] [INFO ] Deduced a trap composed of 218 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :25590 after 551370
[2024-05-28 16:50:42] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:50:43] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:50:43] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:50:43] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:50:43] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:50:43] [INFO ] Deduced a trap composed of 126 places in 144 ms of which 1 ms to minimize.
[2024-05-28 16:50:44] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:50:44] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:50:49] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:50:50] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 60 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :551370 after 1.44245e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 4 (OVERLAPS) 2/382 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1258 variables, and 62 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 22/22 constraints]
After SMT, in 41662ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 41670ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41684 ms. Remains : 382/382 places, 892/892 transitions.
RANDOM walk for 40000 steps (20 resets) in 517 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2024-05-28 16:51:16] [INFO ] Flatten gal took : 97 ms
[2024-05-28 16:51:16] [INFO ] Applying decomposition
[2024-05-28 16:51:16] [INFO ] Flatten gal took : 47 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/graph11533633230460871201.txt' '-o' '/tmp/graph11533633230460871201.bin' '-w' '/tmp/graph11533633230460871201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11533633230460871201.bin' '-l' '-1' '-v' '-w' '/tmp/graph11533633230460871201.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:51:16] [INFO ] Decomposing Gal with order
[2024-05-28 16:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:51:16] [INFO ] Removed a total of 904 redundant transitions.
[2024-05-28 16:51:16] [INFO ] Flatten gal took : 99 ms
[2024-05-28 16:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 41 ms.
[2024-05-28 16:51:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4097368020709907782.gal : 21 ms
[2024-05-28 16:51:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2388389400506569361.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/ReachabilityCardinality4097368020709907782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2388389400506569361.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/ReachabilityCardinality2388389400506569361.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 14
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14 after 14
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14 after 60
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60 after 380
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :380 after 1206
Interrupted probabilistic random walk after 155229 steps, run timeout after 3008 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 155229 steps, saw 98648 distinct states, run finished after 3009 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-28 16:51:17] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:51:17] [INFO ] Invariant cache hit.
[2024-05-28 16:51:17] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1206 after 7134
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) 277/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/379 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 876/1256 variables, 380/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 96/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7134 after 8637
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1258 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1258 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 277/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:51:19] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/379 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/380 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 876/1256 variables, 380/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 96/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1256 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1258 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1258 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 2 ms to minimize.
[2024-05-28 16:51:21] [INFO ] Deduced a trap composed of 148 places in 188 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1258 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8637 after 20049
At refinement iteration 21 (INCLUDED_ONLY) 0/1258 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1258 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 529 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3149 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 4345ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 13 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 16:51:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:51:22] [INFO ] Invariant cache hit.
[2024-05-28 16:51:22] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 16:51:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:51:22] [INFO ] Invariant cache hit.
[2024-05-28 16:51:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:51:27] [INFO ] Implicit Places using invariants and state equation in 4429 ms returned []
Implicit Place search using SMT with State Equation took 4885 ms to find 0 implicit places.
[2024-05-28 16:51:27] [INFO ] Redundant transitions in 20 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 16:51:27] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:51:27] [INFO ] Invariant cache hit.
[2024-05-28 16:51:27] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :20049 after 77196
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:51:33] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:51:34] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:51:35] [INFO ] Deduced a trap composed of 218 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:51:39] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/382 variables, 2/62 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:51:56] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1258 variables, and 65 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 88 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 88 solved, 802 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :77196 after 309274
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 23/61 constraints. Problems are: Problem set: 88 solved, 802 unsolved
Detected timeout of ITS tools.
[2024-05-28 16:52:11] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 2 ms to minimize.
[2024-05-28 16:52:12] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/63 constraints. Problems are: Problem set: 88 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 63 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 25/27 constraints]
After SMT, in 61714ms problems are : Problem set: 88 solved, 802 unsolved
Search for dead transitions found 88 dead transitions in 61728ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/382 places, 804/892 transitions.
Reduce places removed 2 places and 16 transitions.
Graph (complete) has 2376 edges and 380 vertex of which 1 are kept as prefixes of interest. Removing 379 places using SCC suffix rule.0 ms
Discarding 379 places :
Also discarding 787 output transitions
Drop transitions (Output transitions of discarded places.) removed 787 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 1 /382 variables (removed 381) and now considering 0/804 (removed 804) transitions.
[2024-05-28 16:52:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 16:52:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 16:52:28] [INFO ] Invariant cache hit.
[2024-05-28 16:52:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/382 places, 0/892 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66709 ms. Remains : 1/382 places, 0/892 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-11 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-11 in 221706 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-28 16:52:28] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 16:52:28] [INFO ] Computed 40 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (4 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 16:52:29] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:52:29] [INFO ] Invariant cache hit.
[2024-05-28 16:52:29] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:52:29] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-28 16:52:29] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-28 16:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:52:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 16:52:29] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-28 16:52:31] [INFO ] [Nat]Absence check using state equation in 1640 ms returned sat
[2024-05-28 16:52:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:52:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:52:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 580 ms returned sat
[2024-05-28 16:52:31] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 3 ms to minimize.
[2024-05-28 16:52:32] [INFO ] Deduced a trap composed of 170 places in 280 ms of which 2 ms to minimize.
[2024-05-28 16:52:32] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 3 ms to minimize.
[2024-05-28 16:52:32] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:52:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1311 ms
[2024-05-28 16:52:33] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 74 ms.
[2024-05-28 16:52:34] [INFO ] Added : 52 causal constraints over 11 iterations in 1162 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 30 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running 891 sub problems to find dead transitions.
[2024-05-28 16:52:34] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:52:34] [INFO ] Invariant cache hit.
[2024-05-28 16:52:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:52:40] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:52:41] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:52:42] [INFO ] Deduced a trap composed of 145 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 231 places in 210 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 2 ms to minimize.
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 123 places in 219 ms of which 2 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 180 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 1 ms to minimize.
[2024-05-28 16:52:54] [INFO ] Deduced a trap composed of 181 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:52:54] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:52:54] [INFO ] Deduced a trap composed of 199 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:52:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:53:02] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:53:02] [INFO ] Deduced a trap composed of 172 places in 209 ms of which 2 ms to minimize.
[2024-05-28 16:53:02] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:53:02] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 2 ms to minimize.
[2024-05-28 16:53:02] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:53:03] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 41535ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 41550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41585 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 16:53:15] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:53:26] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:53:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (475 resets) in 3647 ms. (274 steps per ms)
BEST_FIRST walk for 1000000 steps (159 resets) in 1682 ms. (594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 16:53:31] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:53:31] [INFO ] Invariant cache hit.
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2024-05-28 16:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 16:53:32] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-28 16:53:34] [INFO ] [Nat]Absence check using state equation in 1555 ms returned sat
[2024-05-28 16:53:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:53:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 655 ms returned sat
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 155 places in 223 ms of which 2 ms to minimize.
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 169 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:53:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 788 ms
[2024-05-28 16:53:35] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 51 ms.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 615 ms
[2024-05-28 16:53:37] [INFO ] Added : 87 causal constraints over 19 iterations in 1870 ms. Result :sat
Minimization took 3784 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 16:53:41] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:53:41] [INFO ] Invariant cache hit.
[2024-05-28 16:53:42] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-28 16:53:42] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:53:42] [INFO ] Invariant cache hit.
[2024-05-28 16:53:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:53:47] [INFO ] Implicit Places using invariants and state equation in 4770 ms returned []
Implicit Place search using SMT with State Equation took 5295 ms to find 0 implicit places.
[2024-05-28 16:53:47] [INFO ] Redundant transitions in 27 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 16:53:47] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 16:53:47] [INFO ] Invariant cache hit.
[2024-05-28 16:53:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:53:54] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 145 places in 256 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 134 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:53:56] [INFO ] Deduced a trap composed of 231 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:53:59] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:53:59] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 2 ms to minimize.
[2024-05-28 16:53:59] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:53:59] [INFO ] Deduced a trap composed of 123 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:54:00] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:54:00] [INFO ] Deduced a trap composed of 180 places in 275 ms of which 4 ms to minimize.
[2024-05-28 16:54:00] [INFO ] Deduced a trap composed of 174 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 16:54:01] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:54:05] [INFO ] Deduced a trap composed of 181 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:54:06] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 3 ms to minimize.
[2024-05-28 16:54:06] [INFO ] Deduced a trap composed of 199 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD892 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/383 variables, 3/64 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-05-28 16:54:17] [INFO ] Deduced a trap composed of 192 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:54:17] [INFO ] Deduced a trap composed of 130 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1260 variables, and 66 constraints, problems are : Problem set: 88 solved, 803 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 88 solved, 803 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 88 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-05-28 16:54:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:54:23] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 3 ms to minimize.
[2024-05-28 16:54:24] [INFO ] Deduced a trap composed of 182 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:54:33] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/65 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-05-28 16:54:43] [INFO ] Deduced a trap composed of 187 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:54:43] [INFO ] Deduced a trap composed of 180 places in 229 ms of which 2 ms to minimize.
[2024-05-28 16:54:43] [INFO ] Deduced a trap composed of 219 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:54:43] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 69 constraints, problems are : Problem set: 88 solved, 803 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 32/34 constraints]
After SMT, in 61612ms problems are : Problem set: 88 solved, 803 unsolved
Search for dead transitions found 88 dead transitions in 61627ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/383 places, 805/893 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 789
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 365 transition count 773
Applied a total of 18 rules in 14 ms. Remains 365 /383 variables (removed 18) and now considering 773/805 (removed 32) transitions.
[2024-05-28 16:54:48] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
// Phase 1: matrix 757 rows 365 cols
[2024-05-28 16:54:48] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 16:54:49] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-28 16:54:49] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
[2024-05-28 16:54:49] [INFO ] Invariant cache hit.
[2024-05-28 16:54:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:54:54] [INFO ] Implicit Places using invariants and state equation in 4831 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 365/383 places, 773/893 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72191 ms. Remains : 365/383 places, 773/893 transitions.
[2024-05-28 16:54:54] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 16:55:01] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
[2024-05-28 16:55:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (404 resets) in 3264 ms. (306 steps per ms)
BEST_FIRST walk for 1000001 steps (200 resets) in 1537 ms. (650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 16:55:06] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
[2024-05-28 16:55:06] [INFO ] Invariant cache hit.
[2024-05-28 16:55:06] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:55:06] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-13 2 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
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 16:55:06] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:55:06] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:55:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14316180395685032908.gal : 8 ms
[2024-05-28 16:55:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13509762018602470460.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/ReachabilityCardinality14316180395685032908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13509762018602470460.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
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:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-13 in 157873 ms.
[2024-05-28 16:55:06] [INFO ] Flatten gal took : 43 ms
Total runtime 1823588 ms.

BK_STOP 1716915306931

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBLF-PT-S02J04T08"
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 PolyORBLF-PT-S02J04T08, 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 r290-tajo-171654446600229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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