Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915604900019.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 Szymanski-PT-b06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 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 Szymanski-PT-b06-UpperBounds-00
FORMULA_NAME Szymanski-PT-b06-UpperBounds-01
FORMULA_NAME Szymanski-PT-b06-UpperBounds-02
FORMULA_NAME Szymanski-PT-b06-UpperBounds-03
FORMULA_NAME Szymanski-PT-b06-UpperBounds-04
FORMULA_NAME Szymanski-PT-b06-UpperBounds-05
FORMULA_NAME Szymanski-PT-b06-UpperBounds-06
FORMULA_NAME Szymanski-PT-b06-UpperBounds-07
FORMULA_NAME Szymanski-PT-b06-UpperBounds-08
FORMULA_NAME Szymanski-PT-b06-UpperBounds-09
FORMULA_NAME Szymanski-PT-b06-UpperBounds-10
FORMULA_NAME Szymanski-PT-b06-UpperBounds-11
FORMULA_NAME Szymanski-PT-b06-UpperBounds-12
FORMULA_NAME Szymanski-PT-b06-UpperBounds-13
FORMULA_NAME Szymanski-PT-b06-UpperBounds-14
FORMULA_NAME Szymanski-PT-b06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749196462215

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:23] [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-06 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2025-06-06 07:54:23] [INFO ] Transformed 568 places.
[2025-06-06 07:54:24] [INFO ] Transformed 8320 transitions.
[2025-06-06 07:54:24] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 22 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 07:54:24] [INFO ] Computed 3 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10001 steps (2 resets) in 64 ms. (153 steps per ms)
FORMULA Szymanski-PT-b06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (19 resets) in 155 ms. (320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 07:54:24] [INFO ] Invariant cache hit.
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2025-06-06 07:54:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:25] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:26] [INFO ] [Real]Added 147 Read/Feed constraints in 600 ms returned sat
[2025-06-06 07:54:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2025-06-06 07:54:27] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1052 ms returned unknown
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2025-06-06 07:54:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-06 07:54:29] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 949 ms returned sat
[2025-06-06 07:54:30] [INFO ] Deduced a trap composed of 39 places in 715 ms of which 28 ms to minimize.
[2025-06-06 07:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 950 ms
[2025-06-06 07:54:31] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 789 ms.
[2025-06-06 07:54:31] [INFO ] Added : 0 causal constraints over 0 iterations in 995 ms. Result :sat
Minimization took 638 ms.
[2025-06-06 07:54:32] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-06 07:54:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-06-06 07:54:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2025-06-06 07:54:34] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 1046 ms returned unknown
[2025-06-06 07:54:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Real]Added 147 Read/Feed constraints in 67 ms returned sat
[2025-06-06 07:54:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-06-06 07:54:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1041 ms returned unknown
[2025-06-06 07:54:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Real]Added 147 Read/Feed constraints in 310 ms returned sat
[2025-06-06 07:54:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:38] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2025-06-06 07:54:38] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 1040 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 729 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 757 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 07:54:40] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:54:40] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1508 ms. (662 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 3982 ms. (1255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:54:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:54:45] [INFO ] Invariant cache hit.
[2025-06-06 07:54:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:46] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-06-06 07:54:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:46] [INFO ] [Real]Added 147 Read/Feed constraints in 81 ms returned sat
[2025-06-06 07:54:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:46] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-06 07:54:49] [INFO ] [Nat]Added 147 Read/Feed constraints in 2549 ms returned sat
[2025-06-06 07:54:49] [INFO ] Deduced a trap composed of 119 places in 675 ms of which 3 ms to minimize.
[2025-06-06 07:54:50] [INFO ] Deduced a trap composed of 59 places in 564 ms of which 11 ms to minimize.
[2025-06-06 07:54:51] [INFO ] Deduced a trap composed of 91 places in 974 ms of which 3 ms to minimize.
[2025-06-06 07:54:52] [INFO ] Deduced a trap composed of 142 places in 791 ms of which 13 ms to minimize.
[2025-06-06 07:54:53] [INFO ] Deduced a trap composed of 143 places in 715 ms of which 3 ms to minimize.
[2025-06-06 07:54:53] [INFO ] Deduced a trap composed of 140 places in 536 ms of which 2 ms to minimize.
[2025-06-06 07:54:54] [INFO ] Deduced a trap composed of 136 places in 536 ms of which 2 ms to minimize.
[2025-06-06 07:54:54] [INFO ] Deduced a trap composed of 138 places in 532 ms of which 2 ms to minimize.
[2025-06-06 07:54:55] [INFO ] Deduced a trap composed of 133 places in 532 ms of which 2 ms to minimize.
[2025-06-06 07:54:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6422 ms
[2025-06-06 07:54:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 527 ms.
[2025-06-06 07:54:56] [INFO ] Added : 0 causal constraints over 0 iterations in 724 ms. Result :sat
Minimization took 4916 ms.
[2025-06-06 07:55:01] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 07:55:01] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-06 07:55:01] [INFO ] [Real]Added 147 Read/Feed constraints in 81 ms returned sat
[2025-06-06 07:55:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:02] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2025-06-06 07:55:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 3697 ms returned sat
[2025-06-06 07:55:06] [INFO ] Deduced a trap composed of 134 places in 501 ms of which 2 ms to minimize.
[2025-06-06 07:55:07] [INFO ] Deduced a trap composed of 137 places in 559 ms of which 2 ms to minimize.
[2025-06-06 07:55:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1242 ms
[2025-06-06 07:55:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 311 ms.
[2025-06-06 07:55:07] [INFO ] Added : 0 causal constraints over 0 iterations in 465 ms. Result :sat
Minimization took 4913 ms.
[2025-06-06 07:55:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:13] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2025-06-06 07:55:13] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2025-06-06 07:55:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:13] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-06 07:55:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1891 ms returned sat
[2025-06-06 07:55:16] [INFO ] Deduced a trap composed of 136 places in 561 ms of which 2 ms to minimize.
[2025-06-06 07:55:16] [INFO ] Deduced a trap composed of 144 places in 560 ms of which 2 ms to minimize.
[2025-06-06 07:55:17] [INFO ] Deduced a trap composed of 134 places in 570 ms of which 4 ms to minimize.
[2025-06-06 07:55:18] [INFO ] Deduced a trap composed of 137 places in 587 ms of which 2 ms to minimize.
[2025-06-06 07:55:18] [INFO ] Deduced a trap composed of 132 places in 547 ms of which 2 ms to minimize.
[2025-06-06 07:55:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3145 ms
[2025-06-06 07:55:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 511 ms.
[2025-06-06 07:55:19] [INFO ] Added : 0 causal constraints over 0 iterations in 701 ms. Result :sat
Minimization took 4902 ms.
[2025-06-06 07:55:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:24] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-06 07:55:24] [INFO ] [Real]Added 147 Read/Feed constraints in 83 ms returned sat
[2025-06-06 07:55:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:25] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2025-06-06 07:55:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 1347 ms returned sat
[2025-06-06 07:55:27] [INFO ] Deduced a trap composed of 133 places in 507 ms of which 2 ms to minimize.
[2025-06-06 07:55:27] [INFO ] Deduced a trap composed of 131 places in 508 ms of which 2 ms to minimize.
[2025-06-06 07:55:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1206 ms
[2025-06-06 07:55:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 317 ms.
[2025-06-06 07:55:28] [INFO ] Added : 0 causal constraints over 0 iterations in 480 ms. Result :sat
Minimization took 4900 ms.
[2025-06-06 07:55:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:33] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-06-06 07:55:33] [INFO ] [Real]Added 147 Read/Feed constraints in 92 ms returned sat
[2025-06-06 07:55:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:34] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-06 07:55:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 844 ms returned sat
[2025-06-06 07:55:35] [INFO ] Deduced a trap composed of 97 places in 578 ms of which 2 ms to minimize.
[2025-06-06 07:55:36] [INFO ] Deduced a trap composed of 136 places in 577 ms of which 2 ms to minimize.
[2025-06-06 07:55:37] [INFO ] Deduced a trap composed of 136 places in 573 ms of which 4 ms to minimize.
[2025-06-06 07:55:37] [INFO ] Deduced a trap composed of 153 places in 557 ms of which 2 ms to minimize.
[2025-06-06 07:55:38] [INFO ] Deduced a trap composed of 38 places in 563 ms of which 2 ms to minimize.
[2025-06-06 07:55:38] [INFO ] Deduced a trap composed of 50 places in 521 ms of which 2 ms to minimize.
[2025-06-06 07:55:39] [INFO ] Deduced a trap composed of 50 places in 507 ms of which 2 ms to minimize.
[2025-06-06 07:55:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4382 ms
[2025-06-06 07:55:39] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 364 ms.
[2025-06-06 07:55:40] [INFO ] Added : 2 causal constraints over 1 iterations in 608 ms. Result :sat
Minimization took 5179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 281 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 281 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:55:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:45] [INFO ] Invariant cache hit.
[2025-06-06 07:55:46] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-06-06 07:55:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:46] [INFO ] Invariant cache hit.
[2025-06-06 07:55:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:56:02] [INFO ] Implicit Places using invariants and state equation in 15582 ms returned []
Implicit Place search using SMT with State Equation took 16197 ms to find 0 implicit places.
[2025-06-06 07:56:03] [INFO ] Redundant transitions in 945 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:56:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:03] [INFO ] Invariant cache hit.
[2025-06-06 07:56:03] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:06] [INFO ] Deduced a trap composed of 138 places in 385 ms of which 1 ms to minimize.
[2025-06-06 07:57:08] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 2 ms to minimize.
[2025-06-06 07:57:08] [INFO ] Deduced a trap composed of 49 places in 432 ms of which 2 ms to minimize.
[2025-06-06 07:57:08] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 2 ms to minimize.
[2025-06-06 07:57:09] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 2 ms to minimize.
[2025-06-06 07:57:09] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 2 ms to minimize.
[2025-06-06 07:57:09] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 2 ms to minimize.
[2025-06-06 07:57:10] [INFO ] Deduced a trap composed of 57 places in 386 ms of which 1 ms to minimize.
[2025-06-06 07:57:10] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 6 ms to minimize.
[2025-06-06 07:57:11] [INFO ] Deduced a trap composed of 62 places in 389 ms of which 2 ms to minimize.
[2025-06-06 07:57:11] [INFO ] Deduced a trap composed of 70 places in 385 ms of which 2 ms to minimize.
[2025-06-06 07:57:12] [INFO ] Deduced a trap composed of 75 places in 368 ms of which 1 ms to minimize.
[2025-06-06 07:57:12] [INFO ] Deduced a trap composed of 102 places in 451 ms of which 2 ms to minimize.
[2025-06-06 07:57:12] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 2 ms to minimize.
[2025-06-06 07:57:13] [INFO ] Deduced a trap composed of 101 places in 366 ms of which 2 ms to minimize.
[2025-06-06 07:57:13] [INFO ] Deduced a trap composed of 114 places in 361 ms of which 2 ms to minimize.
[2025-06-06 07:57:14] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 2 ms to minimize.
[2025-06-06 07:57:14] [INFO ] Deduced a trap composed of 134 places in 250 ms of which 2 ms to minimize.
[2025-06-06 07:57:14] [INFO ] Deduced a trap composed of 137 places in 283 ms of which 1 ms to minimize.
[2025-06-06 07:57:15] [INFO ] Deduced a trap composed of 195 places in 259 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:19] [INFO ] Deduced a trap composed of 111 places in 365 ms of which 2 ms to minimize.
[2025-06-06 07:57:23] [INFO ] Deduced a trap composed of 195 places in 478 ms of which 2 ms to minimize.
[2025-06-06 07:57:23] [INFO ] Deduced a trap composed of 204 places in 481 ms of which 2 ms to minimize.
[2025-06-06 07:57:24] [INFO ] Deduced a trap composed of 209 places in 455 ms of which 2 ms to minimize.
[2025-06-06 07:57:24] [INFO ] Deduced a trap composed of 116 places in 457 ms of which 2 ms to minimize.
[2025-06-06 07:57:25] [INFO ] Deduced a trap composed of 136 places in 434 ms of which 2 ms to minimize.
[2025-06-06 07:57:25] [INFO ] Deduced a trap composed of 139 places in 462 ms of which 2 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 208 places in 395 ms of which 2 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 116 places in 334 ms of which 2 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 146 places in 340 ms of which 2 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 209 places in 301 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 208 places in 302 ms of which 1 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 144 places in 246 ms of which 1 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 64 places in 343 ms of which 2 ms to minimize.
[2025-06-06 07:57:32] [INFO ] Deduced a trap composed of 77 places in 421 ms of which 2 ms to minimize.
[2025-06-06 07:57:32] [INFO ] Deduced a trap composed of 72 places in 403 ms of which 2 ms to minimize.
SMT process timed out in 89221ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106914 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40008 steps (8 resets) in 865 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
[2025-06-06 07:57:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:33] [INFO ] Invariant cache hit.
[2025-06-06 07:57:33] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 07:57:34] [INFO ] Flatten gal took : 712 ms
[2025-06-06 07:57:34] [INFO ] Deduced a trap composed of 48 places in 433 ms of which 2 ms to minimize.
[2025-06-06 07:57:34] [INFO ] Flatten gal took : 301 ms
[2025-06-06 07:57:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5879522420575612827.gal : 107 ms
[2025-06-06 07:57:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12224778755791228218.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/ReachabilityCardinality5879522420575612827.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12224778755791228218.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-06 07:57:34] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 2 ms to minimize.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2025-06-06 07:57:35] [INFO ] Deduced a trap composed of 132 places in 529 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality12224778755791228218.prop.
[2025-06-06 07:57:35] [INFO ] Deduced a trap composed of 78 places in 481 ms of which 2 ms to minimize.
[2025-06-06 07:57:36] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 2 ms to minimize.
[2025-06-06 07:57:36] [INFO ] Deduced a trap composed of 130 places in 450 ms of which 2 ms to minimize.
[2025-06-06 07:57:37] [INFO ] Deduced a trap composed of 130 places in 436 ms of which 2 ms to minimize.
[2025-06-06 07:57:37] [INFO ] Deduced a trap composed of 79 places in 424 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :18 after 80
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :80 after 714
[2025-06-06 07:57:37] [INFO ] Deduced a trap composed of 64 places in 366 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :714 after 11559
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :11559 after 25722
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :25722 after 150696
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 317 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :150696 after 268073
[2025-06-06 07:57:39] [INFO ] Deduced a trap composed of 129 places in 442 ms of which 2 ms to minimize.
[2025-06-06 07:57:39] [INFO ] Deduced a trap composed of 129 places in 427 ms of which 2 ms to minimize.
[2025-06-06 07:57:40] [INFO ] Deduced a trap composed of 74 places in 422 ms of which 2 ms to minimize.
[2025-06-06 07:57:40] [INFO ] Deduced a trap composed of 154 places in 425 ms of which 2 ms to minimize.
[2025-06-06 07:57:41] [INFO ] Deduced a trap composed of 138 places in 277 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :268073 after 305696
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 10074ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 210 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40012 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :305696 after 995582
Interrupted probabilistic random walk after 125501 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 8
Probabilistic random walk after 125501 steps, saw 65093 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
[2025-06-06 07:57:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:47] [INFO ] Invariant cache hit.
[2025-06-06 07:57:47] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :995582 after 4.38018e+06
[2025-06-06 07:57:48] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 2 ms to minimize.
[2025-06-06 07:57:48] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 2 ms to minimize.
[2025-06-06 07:57:49] [INFO ] Deduced a trap composed of 132 places in 462 ms of which 2 ms to minimize.
[2025-06-06 07:57:49] [INFO ] Deduced a trap composed of 78 places in 455 ms of which 2 ms to minimize.
[2025-06-06 07:57:49] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 2 ms to minimize.
[2025-06-06 07:57:50] [INFO ] Deduced a trap composed of 130 places in 452 ms of which 2 ms to minimize.
[2025-06-06 07:57:50] [INFO ] Deduced a trap composed of 130 places in 442 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :4.38018e+06 after 7.37855e+06
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 79 places in 434 ms of which 2 ms to minimize.
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 64 places in 399 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 464 constraints, problems are : Problem set: 0 solved, 8 unsolved in 9346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 129 places in 453 ms of which 2 ms to minimize.
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 129 places in 445 ms of which 2 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 74 places in 428 ms of which 2 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 154 places in 419 ms of which 1 ms to minimize.
[2025-06-06 07:57:59] [INFO ] Deduced a trap composed of 138 places in 277 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :7.37855e+06 after 1.61178e+07
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 8/477 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 477 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8462 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 17852ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 1581 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40012 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 132015 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 132015 steps, saw 69719 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-06 07:58:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:10] [INFO ] Invariant cache hit.
[2025-06-06 07:58:10] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:10] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 2 ms to minimize.
[2025-06-06 07:58:11] [INFO ] Deduced a trap composed of 45 places in 481 ms of which 2 ms to minimize.
[2025-06-06 07:58:11] [INFO ] Deduced a trap composed of 78 places in 453 ms of which 1 ms to minimize.
[2025-06-06 07:58:12] [INFO ] Deduced a trap composed of 133 places in 444 ms of which 2 ms to minimize.
[2025-06-06 07:58:12] [INFO ] Deduced a trap composed of 77 places in 430 ms of which 2 ms to minimize.
[2025-06-06 07:58:13] [INFO ] Deduced a trap composed of 36 places in 444 ms of which 2 ms to minimize.
[2025-06-06 07:58:13] [INFO ] Deduced a trap composed of 37 places in 428 ms of which 2 ms to minimize.
[2025-06-06 07:58:14] [INFO ] Deduced a trap composed of 131 places in 452 ms of which 2 ms to minimize.
[2025-06-06 07:58:14] [INFO ] Deduced a trap composed of 137 places in 441 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:15] [INFO ] Deduced a trap composed of 212 places in 479 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:15] [INFO ] Deduced a trap composed of 222 places in 475 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 466 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8431 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:19] [INFO ] Deduced a trap composed of 131 places in 425 ms of which 1 ms to minimize.
[2025-06-06 07:58:19] [INFO ] Deduced a trap composed of 130 places in 431 ms of which 2 ms to minimize.
[2025-06-06 07:58:20] [INFO ] Deduced a trap composed of 104 places in 440 ms of which 2 ms to minimize.
[2025-06-06 07:58:20] [INFO ] Deduced a trap composed of 103 places in 443 ms of which 2 ms to minimize.
[2025-06-06 07:58:21] [INFO ] Deduced a trap composed of 129 places in 453 ms of which 2 ms to minimize.
[2025-06-06 07:58:21] [INFO ] Deduced a trap composed of 154 places in 422 ms of which 2 ms to minimize.
[2025-06-06 07:58:21] [INFO ] Deduced a trap composed of 138 places in 282 ms of which 1 ms to minimize.
[2025-06-06 07:58:22] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 2 ms to minimize.
[2025-06-06 07:58:22] [INFO ] Deduced a trap composed of 60 places in 415 ms of which 2 ms to minimize.
[2025-06-06 07:58:23] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 2 ms to minimize.
[2025-06-06 07:58:23] [INFO ] Deduced a trap composed of 50 places in 367 ms of which 2 ms to minimize.
[2025-06-06 07:58:23] [INFO ] Deduced a trap composed of 103 places in 299 ms of which 2 ms to minimize.
[2025-06-06 07:58:24] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 8 ms to minimize.
[2025-06-06 07:58:24] [INFO ] Deduced a trap composed of 134 places in 441 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:25] [INFO ] Flatten gal took : 228 ms
[2025-06-06 07:58:25] [INFO ] Applying decomposition
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-06 07:58:25] [INFO ] Flatten gal took : 226 ms
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4884352342833088455.txt' '-o' '/tmp/graph4884352342833088455.bin' '-w' '/tmp/graph4884352342833088455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4884352342833088455.bin' '-l' '-1' '-v' '-w' '/tmp/graph4884352342833088455.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:58:26] [INFO ] Decomposing Gal with order
[2025-06-06 07:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:58:27] [INFO ] Removed a total of 17886 redundant transitions.
[2025-06-06 07:58:27] [INFO ] Flatten gal took : 796 ms
[2025-06-06 07:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1088 labels/synchronizations in 369 ms.
[2025-06-06 07:58:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6533661452501438768.gal : 36 ms
[2025-06-06 07:58:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11054420469609157659.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/ReachabilityCardinality6533661452501438768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11054420469609157659.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11054420469609157659.prop.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :5 after 38
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :38 after 602
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :602 after 3132
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3132 after 8808
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :8808 after 16816
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :16816 after 22128
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :22128 after 28627
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 486 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11457 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 19926ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 542 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :28627 after 47729
Interrupted probabilistic random walk after 141911 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 141911 steps, saw 73787 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
[2025-06-06 07:58:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:34] [INFO ] Invariant cache hit.
[2025-06-06 07:58:34] [INFO ] State equation strengthened by 147 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:34] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 2 ms to minimize.
[2025-06-06 07:58:35] [INFO ] Deduced a trap composed of 36 places in 489 ms of which 2 ms to minimize.
[2025-06-06 07:58:35] [INFO ] Deduced a trap composed of 36 places in 451 ms of which 2 ms to minimize.
[2025-06-06 07:58:36] [INFO ] Deduced a trap composed of 78 places in 472 ms of which 3 ms to minimize.
[2025-06-06 07:58:36] [INFO ] Deduced a trap composed of 42 places in 467 ms of which 2 ms to minimize.
[2025-06-06 07:58:37] [INFO ] Deduced a trap composed of 37 places in 461 ms of which 2 ms to minimize.
[2025-06-06 07:58:37] [INFO ] Deduced a trap composed of 133 places in 519 ms of which 2 ms to minimize.
[2025-06-06 07:58:38] [INFO ] Deduced a trap composed of 141 places in 474 ms of which 3 ms to minimize.
[2025-06-06 07:58:38] [INFO ] Deduced a trap composed of 74 places in 425 ms of which 3 ms to minimize.
[2025-06-06 07:58:39] [INFO ] Deduced a trap composed of 44 places in 449 ms of which 2 ms to minimize.
[2025-06-06 07:58:39] [INFO ] Deduced a trap composed of 131 places in 485 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:41] [INFO ] Deduced a trap composed of 50 places in 592 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:42] [INFO ] Deduced a trap composed of 88 places in 554 ms of which 2 ms to minimize.
[2025-06-06 07:58:43] [INFO ] Deduced a trap composed of 84 places in 586 ms of which 3 ms to minimize.
[2025-06-06 07:58:44] [INFO ] Deduced a trap composed of 136 places in 586 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 470 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:46] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 2 ms to minimize.
[2025-06-06 07:58:46] [INFO ] Deduced a trap composed of 130 places in 439 ms of which 2 ms to minimize.
[2025-06-06 07:58:46] [INFO ] Deduced a trap composed of 138 places in 440 ms of which 2 ms to minimize.
[2025-06-06 07:58:47] [INFO ] Deduced a trap composed of 141 places in 428 ms of which 2 ms to minimize.
[2025-06-06 07:58:47] [INFO ] Deduced a trap composed of 130 places in 438 ms of which 2 ms to minimize.
[2025-06-06 07:58:48] [INFO ] Deduced a trap composed of 185 places in 441 ms of which 2 ms to minimize.
[2025-06-06 07:58:48] [INFO ] Deduced a trap composed of 129 places in 432 ms of which 2 ms to minimize.
[2025-06-06 07:58:49] [INFO ] Deduced a trap composed of 154 places in 416 ms of which 2 ms to minimize.
[2025-06-06 07:58:49] [INFO ] Deduced a trap composed of 74 places in 435 ms of which 1 ms to minimize.
[2025-06-06 07:58:50] [INFO ] Deduced a trap composed of 131 places in 437 ms of which 3 ms to minimize.
[2025-06-06 07:58:50] [INFO ] Deduced a trap composed of 132 places in 424 ms of which 2 ms to minimize.
[2025-06-06 07:58:50] [INFO ] Deduced a trap composed of 129 places in 425 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :47729 after 393004
[2025-06-06 07:58:51] [INFO ] Deduced a trap composed of 171 places in 491 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2604/2909 variables, 305/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 147/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 487 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9719 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 28/28 constraints]
After SMT, in 21084ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 613 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:58:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:56] [INFO ] Invariant cache hit.
[2025-06-06 07:58:56] [INFO ] Implicit Places using invariants in 650 ms returned []
[2025-06-06 07:58:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:56] [INFO ] Invariant cache hit.
[2025-06-06 07:58:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:59:14] [INFO ] Implicit Places using invariants and state equation in 17477 ms returned []
Implicit Place search using SMT with State Equation took 18128 ms to find 0 implicit places.
[2025-06-06 07:59:15] [INFO ] Redundant transitions in 774 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:59:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:15] [INFO ] Invariant cache hit.
[2025-06-06 07:59:15] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :393004 after 1.06528e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 08:00:19] [INFO ] Deduced a trap composed of 138 places in 448 ms of which 2 ms to minimize.
[2025-06-06 08:00:20] [INFO ] Deduced a trap composed of 36 places in 406 ms of which 2 ms to minimize.
[2025-06-06 08:00:21] [INFO ] Deduced a trap composed of 49 places in 390 ms of which 2 ms to minimize.
[2025-06-06 08:00:21] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 2 ms to minimize.
[2025-06-06 08:00:21] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 1 ms to minimize.
[2025-06-06 08:00:22] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 2 ms to minimize.
[2025-06-06 08:00:22] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 2 ms to minimize.
[2025-06-06 08:00:23] [INFO ] Deduced a trap composed of 57 places in 478 ms of which 2 ms to minimize.
[2025-06-06 08:00:23] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 2 ms to minimize.
[2025-06-06 08:00:24] [INFO ] Deduced a trap composed of 62 places in 456 ms of which 2 ms to minimize.
[2025-06-06 08:00:24] [INFO ] Deduced a trap composed of 70 places in 404 ms of which 2 ms to minimize.
[2025-06-06 08:00:24] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 2 ms to minimize.
[2025-06-06 08:00:25] [INFO ] Deduced a trap composed of 102 places in 413 ms of which 2 ms to minimize.
[2025-06-06 08:00:25] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 2 ms to minimize.
[2025-06-06 08:00:26] [INFO ] Deduced a trap composed of 101 places in 393 ms of which 2 ms to minimize.
[2025-06-06 08:00:26] [INFO ] Deduced a trap composed of 114 places in 418 ms of which 2 ms to minimize.
[2025-06-06 08:00:27] [INFO ] Deduced a trap composed of 78 places in 314 ms of which 1 ms to minimize.
[2025-06-06 08:00:27] [INFO ] Deduced a trap composed of 134 places in 260 ms of which 2 ms to minimize.
[2025-06-06 08:00:27] [INFO ] Deduced a trap composed of 137 places in 320 ms of which 1 ms to minimize.
[2025-06-06 08:00:28] [INFO ] Deduced a trap composed of 195 places in 271 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 08:00:32] [INFO ] Deduced a trap composed of 111 places in 336 ms of which 2 ms to minimize.
[2025-06-06 08:00:36] [INFO ] Deduced a trap composed of 195 places in 491 ms of which 2 ms to minimize.
[2025-06-06 08:00:36] [INFO ] Deduced a trap composed of 204 places in 484 ms of which 2 ms to minimize.
[2025-06-06 08:00:37] [INFO ] Deduced a trap composed of 209 places in 476 ms of which 2 ms to minimize.
[2025-06-06 08:00:37] [INFO ] Deduced a trap composed of 116 places in 477 ms of which 2 ms to minimize.
[2025-06-06 08:00:38] [INFO ] Deduced a trap composed of 136 places in 477 ms of which 2 ms to minimize.
[2025-06-06 08:00:38] [INFO ] Deduced a trap composed of 139 places in 450 ms of which 2 ms to minimize.
[2025-06-06 08:00:39] [INFO ] Deduced a trap composed of 208 places in 420 ms of which 1 ms to minimize.
[2025-06-06 08:00:40] [INFO ] Deduced a trap composed of 116 places in 356 ms of which 1 ms to minimize.
[2025-06-06 08:00:41] [INFO ] Deduced a trap composed of 146 places in 358 ms of which 2 ms to minimize.
[2025-06-06 08:00:41] [INFO ] Deduced a trap composed of 209 places in 346 ms of which 2 ms to minimize.
[2025-06-06 08:00:42] [INFO ] Deduced a trap composed of 208 places in 335 ms of which 2 ms to minimize.
[2025-06-06 08:00:42] [INFO ] Deduced a trap composed of 144 places in 257 ms of which 1 ms to minimize.
[2025-06-06 08:00:44] [INFO ] Deduced a trap composed of 64 places in 362 ms of which 2 ms to minimize.
[2025-06-06 08:00:45] [INFO ] Deduced a trap composed of 77 places in 430 ms of which 2 ms to minimize.
SMT process timed out in 90045ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 90123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109254 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b06-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b06-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for Szymanski-PT-b06-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 08:00:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 08:00:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 08:00:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 08:00:45] [INFO ] Invariant cache hit.
[2025-06-06 08:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 08:00:45] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2025-06-06 08:00:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 08:00:45] [INFO ] [Real]Added 147 Read/Feed constraints in 85 ms returned sat
[2025-06-06 08:00:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:00:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 08:00:46] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-06 08:00:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 08:00:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p151) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 08:00:47] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 08:00:47] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000004 steps (2 resets) in 1260 ms. (793 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1070 ms. (933 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 08:00:50] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 08:00:50] [INFO ] Invariant cache hit.
[2025-06-06 08:00:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 08:00:50] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-06 08:00:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 08:00:50] [INFO ] [Real]Added 147 Read/Feed constraints in 61 ms returned sat
[2025-06-06 08:00:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:00:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 08:00:51] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-06 08:00:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 943 ms returned sat
[2025-06-06 08:00:52] [INFO ] Deduced a trap composed of 78 places in 549 ms of which 2 ms to minimize.
[2025-06-06 08:00:53] [INFO ] Deduced a trap composed of 129 places in 572 ms of which 2 ms to minimize.
[2025-06-06 08:00:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1302 ms
[2025-06-06 08:00:53] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 332 ms.
[2025-06-06 08:00:53] [INFO ] Added : 0 causal constraints over 0 iterations in 498 ms. Result :sat

BK_STOP 1749196855308

--------------------
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r251-tall-174915604900019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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