Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-PT-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 146K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 649K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 190K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 878K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.9M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748894265199

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:57:46] [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]
[2025-06-02 19:57:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:57:47] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2025-06-02 19:57:47] [INFO ] Transformed 506 places.
[2025-06-02 19:57:47] [INFO ] Transformed 7154 transitions.
[2025-06-02 19:57:47] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 692 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 6, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 6, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:57:47] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2025-06-02 19:57:47] [INFO ] Computed 54 invariants in 114 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 6, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 4, 172, 17, 344, 344, 68, +inf, 43, 4, 43, +inf, 1, 2, 46]
RANDOM walk for 10000 steps (48 resets) in 100 ms. (99 steps per ms)
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110007 steps (191 resets) in 400 ms. (274 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 1, 1, 6, 1, 1, 1, 4, 1] Max Struct:[172, 17, 344, 344, 68, +inf, 43, 4, 43, +inf, 46]
[2025-06-02 19:57:47] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2025-06-02 19:57:47] [INFO ] Invariant cache hit.
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 9 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 7 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 6 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 5 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2025-06-02 19:57:48] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 9 ms returned unsat
[2025-06-02 19:57:49] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2025-06-02 19:57:49] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-02 19:57:50] [INFO ] [Real]Absence check using state equation in 1671 ms returned sat
[2025-06-02 19:57:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:57:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2025-06-02 19:57:50] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-02 19:57:53] [INFO ] [Nat]Absence check using state equation in 2713 ms returned sat
[2025-06-02 19:57:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:57:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:57:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 1030 ms returned unknown
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 19:57:54] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-02 19:57:57] [INFO ] [Real]Absence check using state equation in 2719 ms returned sat
[2025-06-02 19:57:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:57:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 19:57:57] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 24 ms returned sat
[2025-06-02 19:57:59] [INFO ] [Nat]Absence check using state equation in 1429 ms returned sat
[2025-06-02 19:57:59] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:58:00] [INFO ] [Nat]Added 112 Read/Feed constraints in 1015 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 1, 1, 6, 1, 1, 1, 4, 1] Max Struct:[1, 2, 1, 1, 1, 6, 1, 4, 1, 4, 46]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[4, 46]
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 282 place count 362 transition count 1636
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 362 transition count 1628
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 298 place count 354 transition count 1628
Applied a total of 298 rules in 301 ms. Remains 354 /506 variables (removed 152) and now considering 1628/1774 (removed 146) transitions.
Running 1622 sub problems to find dead transitions.
[2025-06-02 19:58:00] [INFO ] Flow matrix only has 1604 transitions (discarded 24 similar events)
// Phase 1: matrix 1604 rows 354 cols
[2025-06-02 19:58:00] [INFO ] Computed 48 invariants in 37 ms
[2025-06-02 19:58:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
[2025-06-02 19:58:26] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 8 ms to minimize.
[2025-06-02 19:58:27] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2025-06-02 19:58:31] [INFO ] Deduced a trap composed of 81 places in 121 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 Real declared 348/1958 variables, and 40 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 19/29 constraints, State Equation: 0/354 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1611 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/349 variables, 1/41 constraints. Problems are: Problem set: 112 solved, 1510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1958 variables, and 41 constraints, problems are : Problem set: 112 solved, 1510 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 19/29 constraints, State Equation: 0/354 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1622 constraints, Known Traps: 3/3 constraints]
After SMT, in 56519ms problems are : Problem set: 112 solved, 1510 unsolved
Search for dead transitions found 112 dead transitions in 56555ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/506 places, 1516/1774 transitions.
Applied a total of 0 rules in 30 ms. Remains 354 /354 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56922 ms. Remains : 354/506 places, 1516/1774 transitions.
[2025-06-02 19:58:57] [INFO ] Flow matrix only has 1492 transitions (discarded 24 similar events)
// Phase 1: matrix 1492 rows 354 cols
[2025-06-02 19:58:57] [INFO ] Computed 48 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[4, 30]
RANDOM walk for 1000000 steps (9547 resets) in 8396 ms. (119 steps per ms)
BEST_FIRST walk for 2000001 steps (5859 resets) in 5758 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[4, 30]
[2025-06-02 19:59:11] [INFO ] Flow matrix only has 1492 transitions (discarded 24 similar events)
[2025-06-02 19:59:11] [INFO ] Invariant cache hit.
[2025-06-02 19:59:11] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:59:11] [INFO ] [Real]Absence check using 22 positive and 26 generalized place invariants in 15 ms returned sat
[2025-06-02 19:59:12] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2025-06-02 19:59:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:59:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:59:12] [INFO ] [Nat]Absence check using 22 positive and 26 generalized place invariants in 15 ms returned sat
[2025-06-02 19:59:14] [INFO ] [Nat]Absence check using state equation in 1754 ms returned sat
[2025-06-02 19:59:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:59:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 1389 ms returned sat
[2025-06-02 19:59:15] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-02 19:59:16] [INFO ] Computed and/alt/rep : 1080/4456/1075 causal constraints (skipped 411 transitions) in 150 ms.
[2025-06-02 19:59:17] [INFO ] Added : 63 causal constraints over 13 iterations in 1509 ms. Result :sat
Minimization took 6428 ms.
[2025-06-02 19:59:23] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-02 19:59:24] [INFO ] [Real]Absence check using 22 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-02 19:59:25] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2025-06-02 19:59:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:59:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-06-02 19:59:25] [INFO ] [Nat]Absence check using 22 positive and 26 generalized place invariants in 16 ms returned sat
[2025-06-02 19:59:26] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2025-06-02 19:59:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 840 ms returned sat
[2025-06-02 19:59:27] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:59:27] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:59:28] [INFO ] Deduced a trap composed of 153 places in 331 ms of which 4 ms to minimize.
[2025-06-02 19:59:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 766 ms
[2025-06-02 19:59:28] [INFO ] Computed and/alt/rep : 1080/4456/1075 causal constraints (skipped 411 transitions) in 178 ms.
[2025-06-02 19:59:29] [INFO ] Added : 48 causal constraints over 10 iterations in 1032 ms. Result :sat
Minimization took 6039 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[4, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[4, 30]
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 1516/1516 transitions.
Applied a total of 0 rules in 30 ms. Remains 354 /354 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 354/354 places, 1516/1516 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 1516/1516 transitions.
Applied a total of 0 rules in 29 ms. Remains 354 /354 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
[2025-06-02 19:59:35] [INFO ] Flow matrix only has 1492 transitions (discarded 24 similar events)
[2025-06-02 19:59:35] [INFO ] Invariant cache hit.
[2025-06-02 19:59:35] [INFO ] Implicit Places using invariants in 532 ms returned [17, 70, 145]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 549 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/354 places, 1516/1516 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 348 transition count 1513
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 348 transition count 1513
Applied a total of 6 rules in 49 ms. Remains 348 /351 variables (removed 3) and now considering 1513/1516 (removed 3) transitions.
[2025-06-02 19:59:36] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
// Phase 1: matrix 1489 rows 348 cols
[2025-06-02 19:59:36] [INFO ] Computed 45 invariants in 24 ms
[2025-06-02 19:59:36] [INFO ] Implicit Places using invariants in 490 ms returned []
[2025-06-02 19:59:36] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 19:59:36] [INFO ] Invariant cache hit.
[2025-06-02 19:59:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:59:45] [INFO ] Implicit Places using invariants and state equation in 8830 ms returned []
Implicit Place search using SMT with State Equation took 9327 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 348/354 places, 1513/1516 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9954 ms. Remains : 348/354 places, 1513/1516 transitions.
[2025-06-02 19:59:45] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 19:59:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[4, 30]
RANDOM walk for 1000000 steps (9743 resets) in 8316 ms. (120 steps per ms)
BEST_FIRST walk for 2000001 steps (5796 resets) in 5862 ms. (341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[4, 30]
[2025-06-02 19:59:59] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 19:59:59] [INFO ] Invariant cache hit.
[2025-06-02 19:59:59] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-02 19:59:59] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 13 ms returned sat
[2025-06-02 20:00:00] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2025-06-02 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:00:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-02 20:00:00] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 14 ms returned sat
[2025-06-02 20:00:05] [INFO ] [Nat]Absence check using state equation in 5379 ms returned sat
[2025-06-02 20:00:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 20:00:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 755 ms returned sat
[2025-06-02 20:00:06] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2025-06-02 20:00:07] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2025-06-02 20:00:07] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2025-06-02 20:00:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1464 ms
[2025-06-02 20:00:08] [INFO ] Computed and/alt/rep : 1077/4453/1072 causal constraints (skipped 411 transitions) in 116 ms.
[2025-06-02 20:00:13] [INFO ] Added : 88 causal constraints over 18 iterations in 5123 ms. Result :sat
Minimization took 4993 ms.
[2025-06-02 20:00:18] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2025-06-02 20:00:18] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 17 ms returned sat
[2025-06-02 20:00:19] [INFO ] [Real]Absence check using state equation in 1550 ms returned sat
[2025-06-02 20:00:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:00:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2025-06-02 20:00:19] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 12 ms returned sat
[2025-06-02 20:00:21] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2025-06-02 20:00:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 1072 ms returned sat
[2025-06-02 20:00:23] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2025-06-02 20:00:23] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2025-06-02 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2025-06-02 20:00:23] [INFO ] Computed and/alt/rep : 1077/4453/1072 causal constraints (skipped 411 transitions) in 96 ms.
[2025-06-02 20:00:24] [INFO ] Added : 21 causal constraints over 5 iterations in 1078 ms. Result :sat
Minimization took 5002 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[4, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[4, 30]
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1513/1513 transitions.
Applied a total of 0 rules in 32 ms. Remains 348 /348 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 348/348 places, 1513/1513 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1513/1513 transitions.
Applied a total of 0 rules in 25 ms. Remains 348 /348 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
[2025-06-02 20:00:29] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 20:00:29] [INFO ] Invariant cache hit.
[2025-06-02 20:00:30] [INFO ] Implicit Places using invariants in 465 ms returned []
[2025-06-02 20:00:30] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 20:00:30] [INFO ] Invariant cache hit.
[2025-06-02 20:00:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 20:00:39] [INFO ] Implicit Places using invariants and state equation in 8964 ms returned []
Implicit Place search using SMT with State Equation took 9431 ms to find 0 implicit places.
[2025-06-02 20:00:39] [INFO ] Redundant transitions in 83 ms returned []
Running 1507 sub problems to find dead transitions.
[2025-06-02 20:00:39] [INFO ] Flow matrix only has 1489 transitions (discarded 24 similar events)
[2025-06-02 20:00:39] [INFO ] Invariant cache hit.
[2025-06-02 20:00:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2025-06-02 20:01:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-02 20:01:04] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2025-06-02 20:01:08] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1837 variables, and 37 constraints, problems are : Problem set: 0 solved, 1507 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1507/1507 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
Problem TDEAD774 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/345 variables, 3/40 constraints. Problems are: Problem set: 312 solved, 1195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/40 constraints. Problems are: Problem set: 312 solved, 1195 unsolved
Problem TDEAD776 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1502 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/348 variables, 8/48 constraints. Problems are: Problem set: 500 solved, 1007 unsolved
[2025-06-02 20:01:47] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:01:48] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2025-06-02 20:01:48] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-06-02 20:01:48] [INFO ] Deduced a trap composed of 159 places in 345 ms of which 2 ms to minimize.
[2025-06-02 20:01:48] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2025-06-02 20:01:48] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2025-06-02 20:01:49] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 3 ms to minimize.
[2025-06-02 20:01:49] [INFO ] Deduced a trap composed of 170 places in 370 ms of which 2 ms to minimize.
[2025-06-02 20:01:50] [INFO ] Deduced a trap composed of 163 places in 338 ms of which 2 ms to minimize.
[2025-06-02 20:01:50] [INFO ] Deduced a trap composed of 172 places in 242 ms of which 3 ms to minimize.
[2025-06-02 20:01:50] [INFO ] Deduced a trap composed of 132 places in 252 ms of which 2 ms to minimize.
[2025-06-02 20:01:53] [INFO ] Deduced a trap composed of 96 places in 307 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/1837 variables, and 60 constraints, problems are : Problem set: 500 solved, 1007 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1507 constraints, Known Traps: 15/15 constraints]
After SMT, in 75634ms problems are : Problem set: 500 solved, 1007 unsolved
Search for dead transitions found 500 dead transitions in 75651ms
Found 500 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 500 transitions
Dead transitions reduction (with SMT) removed 500 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/348 places, 1013/1513 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
[2025-06-02 20:01:54] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85244 ms. Remains : 348/348 places, 1013/1513 transitions.
[2025-06-02 20:01:54] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
// Phase 1: matrix 989 rows 348 cols
[2025-06-02 20:01:54] [INFO ] Computed 45 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[4, 30]
RANDOM walk for 1000000 steps (9724 resets) in 4593 ms. (217 steps per ms)
BEST_FIRST walk for 2000001 steps (5710 resets) in 3723 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[4, 30]
[2025-06-02 20:02:03] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:02:03] [INFO ] Invariant cache hit.
[2025-06-02 20:02:03] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-02 20:02:03] [INFO ] [Real]Absence check using 23 positive and 22 generalized place invariants in 9 ms returned sat
[2025-06-02 20:02:04] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2025-06-02 20:02:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:02:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-02 20:02:04] [INFO ] [Nat]Absence check using 23 positive and 22 generalized place invariants in 9 ms returned sat
[2025-06-02 20:02:05] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2025-06-02 20:02:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 20:02:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 504 ms returned sat
[2025-06-02 20:02:06] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:02:06] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:02:06] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2025-06-02 20:02:07] [INFO ] Deduced a trap composed of 188 places in 213 ms of which 2 ms to minimize.
[2025-06-02 20:02:07] [INFO ] Deduced a trap composed of 185 places in 237 ms of which 2 ms to minimize.
[2025-06-02 20:02:07] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:02:07] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 3 ms to minimize.
[2025-06-02 20:02:08] [INFO ] Deduced a trap composed of 177 places in 231 ms of which 11 ms to minimize.
[2025-06-02 20:02:08] [INFO ] Deduced a trap composed of 183 places in 222 ms of which 3 ms to minimize.
[2025-06-02 20:02:08] [INFO ] Deduced a trap composed of 185 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:02:09] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:02:09] [INFO ] Deduced a trap composed of 188 places in 298 ms of which 2 ms to minimize.
[2025-06-02 20:02:09] [INFO ] Deduced a trap composed of 184 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:02:10] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:02:10] [INFO ] Deduced a trap composed of 188 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:02:10] [INFO ] Deduced a trap composed of 179 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:02:11] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:02:11] [INFO ] Deduced a trap composed of 184 places in 241 ms of which 2 ms to minimize.
[2025-06-02 20:02:11] [INFO ] Deduced a trap composed of 184 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:02:11] [INFO ] Deduced a trap composed of 173 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:02:12] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:02:12] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:02:12] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:02:12] [INFO ] Deduced a trap composed of 167 places in 225 ms of which 5 ms to minimize.
[2025-06-02 20:02:13] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:02:13] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:02:13] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:02:14] [INFO ] Deduced a trap composed of 184 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:02:14] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 4 ms to minimize.
[2025-06-02 20:02:14] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:02:15] [INFO ] Deduced a trap composed of 179 places in 203 ms of which 2 ms to minimize.
[2025-06-02 20:02:15] [INFO ] Deduced a trap composed of 189 places in 203 ms of which 3 ms to minimize.
[2025-06-02 20:02:15] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 2 ms to minimize.
[2025-06-02 20:02:16] [INFO ] Deduced a trap composed of 174 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:02:16] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:02:16] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:02:16] [INFO ] Deduced a trap composed of 176 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:02:17] [INFO ] Deduced a trap composed of 187 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:02:17] [INFO ] Deduced a trap composed of 190 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:02:17] [INFO ] Deduced a trap composed of 189 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 181 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 181 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 183 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 188 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:02:19] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:02:19] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:02:19] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:02:20] [INFO ] Deduced a trap composed of 143 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:02:20] [INFO ] Deduced a trap composed of 178 places in 227 ms of which 2 ms to minimize.
[2025-06-02 20:02:20] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 2 ms to minimize.
[2025-06-02 20:02:20] [INFO ] Deduced a trap composed of 179 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:02:21] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:02:21] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 2 ms to minimize.
[2025-06-02 20:02:21] [INFO ] Deduced a trap composed of 179 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:02:22] [INFO ] Deduced a trap composed of 178 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:02:22] [INFO ] Deduced a trap composed of 198 places in 203 ms of which 2 ms to minimize.
[2025-06-02 20:02:22] [INFO ] Deduced a trap composed of 196 places in 187 ms of which 2 ms to minimize.
[2025-06-02 20:02:23] [INFO ] Deduced a trap composed of 185 places in 225 ms of which 2 ms to minimize.
[2025-06-02 20:02:23] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:02:23] [INFO ] Deduced a trap composed of 183 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:02:24] [INFO ] Deduced a trap composed of 183 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:02:24] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2025-06-02 20:02:25] [INFO ] Deduced a trap composed of 193 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:02:25] [INFO ] Deduced a trap composed of 195 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:02:25] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 3 ms to minimize.
[2025-06-02 20:02:26] [INFO ] Deduced a trap composed of 153 places in 202 ms of which 2 ms to minimize.
[2025-06-02 20:02:26] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:02:26] [INFO ] Deduced a trap composed of 174 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:02:26] [INFO ] Deduced a trap composed of 148 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:02:27] [INFO ] Deduced a trap composed of 186 places in 206 ms of which 2 ms to minimize.
[2025-06-02 20:02:27] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 2 ms to minimize.
[2025-06-02 20:02:27] [INFO ] Deduced a trap composed of 151 places in 204 ms of which 2 ms to minimize.
[2025-06-02 20:02:27] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 2 ms to minimize.
[2025-06-02 20:02:28] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 3 ms to minimize.
[2025-06-02 20:02:29] [INFO ] Deduced a trap composed of 190 places in 197 ms of which 2 ms to minimize.
[2025-06-02 20:02:29] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 2 ms to minimize.
[2025-06-02 20:02:29] [INFO ] Deduced a trap composed of 174 places in 220 ms of which 2 ms to minimize.
[2025-06-02 20:02:29] [INFO ] Deduced a trap composed of 182 places in 222 ms of which 2 ms to minimize.
[2025-06-02 20:02:30] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:02:30] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 24565 ms
[2025-06-02 20:02:30] [INFO ] Computed and/alt/rep : 577/2813/572 causal constraints (skipped 411 transitions) in 58 ms.
[2025-06-02 20:02:32] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 2 ms to minimize.
[2025-06-02 20:02:33] [INFO ] Deduced a trap composed of 181 places in 216 ms of which 2 ms to minimize.
[2025-06-02 20:02:33] [INFO ] Deduced a trap composed of 185 places in 223 ms of which 2 ms to minimize.
[2025-06-02 20:02:34] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:02:35] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:02:36] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 5 ms to minimize.
[2025-06-02 20:02:36] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:02:37] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 2 ms to minimize.
[2025-06-02 20:02:37] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 2 ms to minimize.
[2025-06-02 20:02:37] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 2 ms to minimize.
[2025-06-02 20:02:38] [INFO ] Deduced a trap composed of 148 places in 229 ms of which 2 ms to minimize.
[2025-06-02 20:02:38] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:02:41] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 2 ms to minimize.
[2025-06-02 20:02:41] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:02:43] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 2 ms to minimize.
[2025-06-02 20:02:44] [INFO ] Deduced a trap composed of 185 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:02:44] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:02:45] [INFO ] Deduced a trap composed of 178 places in 253 ms of which 2 ms to minimize.
[2025-06-02 20:02:46] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 2 ms to minimize.
[2025-06-02 20:02:46] [INFO ] Deduced a trap composed of 174 places in 208 ms of which 2 ms to minimize.
[2025-06-02 20:02:47] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 2 ms to minimize.
[2025-06-02 20:02:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 15118 ms
[2025-06-02 20:02:49] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:02:49] [INFO ] Deduced a trap composed of 185 places in 226 ms of which 2 ms to minimize.
[2025-06-02 20:02:49] [INFO ] Deduced a trap composed of 168 places in 298 ms of which 2 ms to minimize.
[2025-06-02 20:02:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 20:02:49] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-02 20:02:49] [INFO ] [Real]Absence check using 23 positive and 22 generalized place invariants in 9 ms returned sat
[2025-06-02 20:02:51] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2025-06-02 20:02:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:02:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-02 20:02:51] [INFO ] [Nat]Absence check using 23 positive and 22 generalized place invariants in 9 ms returned sat
[2025-06-02 20:02:52] [INFO ] [Nat]Absence check using state equation in 1512 ms returned sat
[2025-06-02 20:02:53] [INFO ] [Nat]Added 112 Read/Feed constraints in 583 ms returned sat
[2025-06-02 20:02:53] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 2 ms to minimize.
[2025-06-02 20:02:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-06-02 20:02:53] [INFO ] Computed and/alt/rep : 577/2813/572 causal constraints (skipped 411 transitions) in 50 ms.
[2025-06-02 20:02:54] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 2 ms to minimize.
[2025-06-02 20:02:54] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2025-06-02 20:02:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1473 ms
[2025-06-02 20:02:55] [INFO ] Added : 29 causal constraints over 7 iterations in 2145 ms. Result :sat
Minimization took 4508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[4, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[4, 30]
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1013/1013 transitions.
Applied a total of 0 rules in 22 ms. Remains 348 /348 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 348/348 places, 1013/1013 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1013/1013 transitions.
Applied a total of 0 rules in 32 ms. Remains 348 /348 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
[2025-06-02 20:03:00] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:03:00] [INFO ] Invariant cache hit.
[2025-06-02 20:03:00] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-06-02 20:03:01] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:03:01] [INFO ] Invariant cache hit.
[2025-06-02 20:03:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 20:03:19] [INFO ] Implicit Places using invariants and state equation in 18452 ms returned []
Implicit Place search using SMT with State Equation took 18920 ms to find 0 implicit places.
[2025-06-02 20:03:19] [INFO ] Redundant transitions in 50 ms returned []
Running 1007 sub problems to find dead transitions.
[2025-06-02 20:03:19] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:03:19] [INFO ] Invariant cache hit.
[2025-06-02 20:03:19] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
[2025-06-02 20:03:28] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2025-06-02 20:03:29] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2025-06-02 20:03:29] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2025-06-02 20:03:32] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2025-06-02 20:03:33] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 4 (OVERLAPS) 3/345 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 345/1337 variables, and 46 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1007/1007 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1007 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
[2025-06-02 20:03:54] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:03:55] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2025-06-02 20:03:55] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:03:59] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 5 (OVERLAPS) 3/345 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
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 Int declared 345/1337 variables, and 50 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/348 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1007 constraints, Known Traps: 9/9 constraints]
After SMT, in 61999ms problems are : Problem set: 0 solved, 1007 unsolved
Search for dead transitions found 0 dead transitions in 62008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81040 ms. Remains : 348/348 places, 1013/1013 transitions.
RANDOM walk for 40000 steps (382 resets) in 1449 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (110 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
[2025-06-02 20:04:22] [INFO ] Flatten gal took : 369 ms
BEST_FIRST walk for 40003 steps (114 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (140 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
[2025-06-02 20:04:22] [INFO ] Flatten gal took : 210 ms
BEST_FIRST walk for 40003 steps (123 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
[2025-06-02 20:04:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13438373041250184861.gal : 42 ms
[2025-06-02 20:04:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11028038228363252680.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13438373041250184861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11028038228363252680.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11028038228363252680.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :11 after 23
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 46
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :46 after 113
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :113 after 552
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :552 after 1856
Interrupted probabilistic random walk after 156897 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 156897 steps, saw 81261 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-02 20:04:25] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:04:25] [INFO ] Invariant cache hit.
[2025-06-02 20:04:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 167/175 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 87/262 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
At refinement iteration 7 (OVERLAPS) 83/345 variables, 18/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 20:04:25] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/346 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 989/1335 variables, 346/391 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1335 variables, 112/503 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1335 variables, 0/503 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1337 variables, 2/505 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1337 variables, 1/506 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1337 variables, 0/506 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1337 variables, 0/506 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 506 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 348/348 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 167/175 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 87/262 variables, 20/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 83/345 variables, 18/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
SDD size :1856 after 13967
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 5/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13967 after 179115
At refinement iteration 13 (OVERLAPS) 989/1335 variables, 346/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1337 variables, and 508 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3037 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 346/348 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 4445ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 132 ms.
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1013/1013 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
Running 1007 sub problems to find dead transitions.
[2025-06-02 20:04:30] [INFO ] Flow matrix only has 989 transitions (discarded 24 similar events)
[2025-06-02 20:04:30] [INFO ] Invariant cache hit.
[2025-06-02 20:04:30] [INFO ] State equation strengthened by 112 read => feed constraints.

BK_STOP 1748894677393

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J06T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S06J06T04, 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 r167-tall-174881266100067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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