Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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-b10-UpperBounds-00
FORMULA_NAME Szymanski-PT-b10-UpperBounds-01
FORMULA_NAME Szymanski-PT-b10-UpperBounds-02
FORMULA_NAME Szymanski-PT-b10-UpperBounds-03
FORMULA_NAME Szymanski-PT-b10-UpperBounds-04
FORMULA_NAME Szymanski-PT-b10-UpperBounds-05
FORMULA_NAME Szymanski-PT-b10-UpperBounds-06
FORMULA_NAME Szymanski-PT-b10-UpperBounds-07
FORMULA_NAME Szymanski-PT-b10-UpperBounds-08
FORMULA_NAME Szymanski-PT-b10-UpperBounds-09
FORMULA_NAME Szymanski-PT-b10-UpperBounds-10
FORMULA_NAME Szymanski-PT-b10-UpperBounds-11
FORMULA_NAME Szymanski-PT-b10-UpperBounds-12
FORMULA_NAME Szymanski-PT-b10-UpperBounds-13
FORMULA_NAME Szymanski-PT-b10-UpperBounds-14
FORMULA_NAME Szymanski-PT-b10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749196462261

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-b10
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): 326 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 494 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+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 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 21, 1, 1, 1, 21, 1, 1, 1]
RANDOM walk for 10008 steps (2 resets) in 63 ms. (156 steps per ms)
FORMULA Szymanski-PT-b10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (12 resets) in 152 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 10, 0, 6, 0] Max Struct:[1, 21, 1, 21, 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 8 ms returned sat
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 10 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 655 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 ] [Real]Added 147 Read/Feed constraints in 112 ms returned sat
[2025-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2025-06-06 07:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1034 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 0 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Real]Added 147 Read/Feed constraints in 151 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 4 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Nat]Absence check using state equation in 407 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 1064 ms returned unknown
[2025-06-06 07:54:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Real]Added 147 Read/Feed constraints in 150 ms returned sat
[2025-06-06 07:54:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-06-06 07:54:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 817 ms returned sat
[2025-06-06 07:54:32] [INFO ] Deduced a trap composed of 133 places in 599 ms of which 21 ms to minimize.
[2025-06-06 07:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 781 ms
[2025-06-06 07:54:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 633 ms.
[2025-06-06 07:54:33] [INFO ] Added : 0 causal constraints over 0 iterations in 816 ms. Result :sat
Minimization took 589 ms.
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Added 147 Read/Feed constraints in 314 ms returned sat
[2025-06-06 07:54:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2025-06-06 07:54:35] [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:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-06-06 07:54:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:37] [INFO ] [Real]Added 147 Read/Feed constraints in 568 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 4 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-06 07:54:38] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 760 ms returned sat
[2025-06-06 07:54:39] [INFO ] Deduced a trap composed of 146 places in 603 ms of which 3 ms to minimize.
[2025-06-06 07:54:39] [INFO ] Deduced a trap composed of 145 places in 541 ms of which 3 ms to minimize.
[2025-06-06 07:54:40] [INFO ] Deduced a trap composed of 138 places in 584 ms of which 2 ms to minimize.
[2025-06-06 07:54:41] [INFO ] Deduced a trap composed of 135 places in 593 ms of which 3 ms to minimize.
[2025-06-06 07:54:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2649 ms
[2025-06-06 07:54:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 908 ms.
[2025-06-06 07:54:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1089 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 10, 0, 6, 0] Max Struct:[1, 21, 1, 21, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 10, 0, 6, 0] Max Struct:[1, 21, 1, 21, 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.17 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 443 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 456 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 07:54:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:54:42] [INFO ] Computed 3 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 10, 0, 6, 0] Max Struct:[1, 11, 1, 11, 1]
RANDOM walk for 1000003 steps (2 resets) in 922 ms. (1083 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 3825 ms. (1306 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 10, 0, 10, 0] Max Struct:[1, 11, 1, 11, 1]
[2025-06-06 07:54:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:54:47] [INFO ] Invariant cache hit.
[2025-06-06 07:54:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:48] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-06 07:54:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:48] [INFO ] [Real]Added 147 Read/Feed constraints in 91 ms returned sat
[2025-06-06 07:54:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:48] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-06 07:54:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 1423 ms returned sat
[2025-06-06 07:54:50] [INFO ] Deduced a trap composed of 132 places in 544 ms of which 2 ms to minimize.
[2025-06-06 07:54:51] [INFO ] Deduced a trap composed of 129 places in 556 ms of which 3 ms to minimize.
[2025-06-06 07:54:52] [INFO ] Deduced a trap composed of 129 places in 547 ms of which 3 ms to minimize.
[2025-06-06 07:54:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1872 ms
[2025-06-06 07:54:52] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 360 ms.
[2025-06-06 07:54:52] [INFO ] Added : 0 causal constraints over 0 iterations in 535 ms. Result :sat
Minimization took 4904 ms.
[2025-06-06 07:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:57] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2025-06-06 07:54:58] [INFO ] [Real]Added 147 Read/Feed constraints in 833 ms returned sat
[2025-06-06 07:54:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:59] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-06-06 07:55:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 3747 ms returned sat
[2025-06-06 07:55:03] [INFO ] Deduced a trap composed of 36 places in 529 ms of which 2 ms to minimize.
[2025-06-06 07:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 577 ms
[2025-06-06 07:55:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:04] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-06-06 07:55:04] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2025-06-06 07:55:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:04] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2025-06-06 07:55:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 1313 ms returned sat
[2025-06-06 07:55:06] [INFO ] Deduced a trap composed of 134 places in 525 ms of which 2 ms to minimize.
[2025-06-06 07:55:07] [INFO ] Deduced a trap composed of 133 places in 500 ms of which 2 ms to minimize.
[2025-06-06 07:55:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1246 ms
[2025-06-06 07:55:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 368 ms.
[2025-06-06 07:55:07] [INFO ] Added : 0 causal constraints over 0 iterations in 526 ms. Result :sat
Minimization took 4898 ms.
[2025-06-06 07:55:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:13] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-06 07:55:14] [INFO ] [Real]Added 147 Read/Feed constraints in 1824 ms returned sat
[2025-06-06 07:55:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:15] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-06-06 07:55:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:55:21] [INFO ] [Nat]Added 147 Read/Feed constraints in 5618 ms returned sat
[2025-06-06 07:55:21] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 2 ms to minimize.
[2025-06-06 07:55:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 590 ms
[2025-06-06 07:55:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:22] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-06-06 07:55:22] [INFO ] [Real]Added 147 Read/Feed constraints in 329 ms returned sat
[2025-06-06 07:55:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:22] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-06 07:55:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 383 ms returned sat
[2025-06-06 07:55:23] [INFO ] Deduced a trap composed of 144 places in 507 ms of which 2 ms to minimize.
[2025-06-06 07:55:24] [INFO ] Deduced a trap composed of 131 places in 526 ms of which 2 ms to minimize.
[2025-06-06 07:55:24] [INFO ] Deduced a trap composed of 132 places in 507 ms of which 2 ms to minimize.
[2025-06-06 07:55:25] [INFO ] Deduced a trap composed of 140 places in 333 ms of which 1 ms to minimize.
[2025-06-06 07:55:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2136 ms
[2025-06-06 07:55:25] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 316 ms.
[2025-06-06 07:55:25] [INFO ] Added : 0 causal constraints over 0 iterations in 469 ms. Result :sat
Minimization took 4899 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 10, 0, 10, 0] Max Struct:[1, 10, 1, 10, 1]
FORMULA Szymanski-PT-b10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
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 239 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 239 ms. Remains : 305/305 places, 7808/7808 transitions.
[2025-06-06 07:55:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000001 steps (2 resets) in 742 ms. (1345 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 2097 ms. (1429 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-06 07:55:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:33] [INFO ] Invariant cache hit.
[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:34] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-06 07:55:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:55:34] [INFO ] [Real]Added 147 Read/Feed constraints in 81 ms returned sat
[2025-06-06 07:55:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:34] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1346 ms returned sat
[2025-06-06 07:55:36] [INFO ] Deduced a trap composed of 132 places in 496 ms of which 2 ms to minimize.
[2025-06-06 07:55:37] [INFO ] Deduced a trap composed of 129 places in 499 ms of which 2 ms to minimize.
[2025-06-06 07:55:37] [INFO ] Deduced a trap composed of 129 places in 509 ms of which 2 ms to minimize.
[2025-06-06 07:55:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1723 ms
[2025-06-06 07:55:38] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 317 ms.
[2025-06-06 07:55:38] [INFO ] Added : 0 causal constraints over 0 iterations in 476 ms. Result :sat
Minimization took 4899 ms.
[2025-06-06 07:55:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:43] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-06 07:55:43] [INFO ] [Real]Added 147 Read/Feed constraints in 103 ms returned sat
[2025-06-06 07:55:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:44] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2025-06-06 07:55:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 1326 ms returned sat
[2025-06-06 07:55:46] [INFO ] Deduced a trap composed of 134 places in 492 ms of which 2 ms to minimize.
[2025-06-06 07:55:46] [INFO ] Deduced a trap composed of 133 places in 503 ms of which 2 ms to minimize.
[2025-06-06 07:55:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1212 ms
[2025-06-06 07:55:47] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 322 ms.
[2025-06-06 07:55:47] [INFO ] Added : 0 causal constraints over 0 iterations in 475 ms. Result :sat
Minimization took 4889 ms.
[2025-06-06 07:55:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:52] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-06-06 07:55:52] [INFO ] [Real]Added 147 Read/Feed constraints in 330 ms returned sat
[2025-06-06 07:55:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:53] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2025-06-06 07:55:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 393 ms returned sat
[2025-06-06 07:55:54] [INFO ] Deduced a trap composed of 144 places in 504 ms of which 2 ms to minimize.
[2025-06-06 07:55:54] [INFO ] Deduced a trap composed of 131 places in 502 ms of which 2 ms to minimize.
[2025-06-06 07:55:55] [INFO ] Deduced a trap composed of 132 places in 525 ms of which 2 ms to minimize.
[2025-06-06 07:55:55] [INFO ] Deduced a trap composed of 140 places in 329 ms of which 2 ms to minimize.
[2025-06-06 07:55:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2135 ms
[2025-06-06 07:55:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 307 ms.
[2025-06-06 07:55:56] [INFO ] Added : 0 causal constraints over 0 iterations in 458 ms. Result :sat
Minimization took 4913 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
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 285 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 285 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 220 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:56:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:01] [INFO ] Invariant cache hit.
[2025-06-06 07:56:02] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-06-06 07:56:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:02] [INFO ] Invariant cache hit.
[2025-06-06 07:56:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:56:21] [INFO ] Implicit Places using invariants and state equation in 19199 ms returned []
Implicit Place search using SMT with State Equation took 19841 ms to find 0 implicit places.
[2025-06-06 07:56:22] [INFO ] Redundant transitions in 921 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:56:22] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:22] [INFO ] Invariant cache hit.
[2025-06-06 07:56:22] [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 30160 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:24] [INFO ] Deduced a trap composed of 138 places in 398 ms of which 2 ms to minimize.
[2025-06-06 07:57:25] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 2 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 118 places in 303 ms of which 1 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 157 places in 294 ms of which 2 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 101 places in 213 ms of which 1 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 2 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 85 places in 248 ms of which 1 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 74 places in 360 ms of which 29 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 111 places in 337 ms of which 2 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 103 places in 240 ms of which 4 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 107 places in 305 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 112 places in 302 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 103 places in 226 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 132 places in 241 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 134 places in 359 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 134 places in 346 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 125 places in 322 ms of which 2 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 195 places in 234 ms of which 1 ms to minimize.
[2025-06-06 07:57:47] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 22 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 19/19 constraints]
After SMT, in 87934ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109087 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40012 steps (8 resets) in 841 ms. (47 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/4 properties
[2025-06-06 07:57:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:51] [INFO ] Invariant cache hit.
[2025-06-06 07:57:51] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 72 places in 457 ms of which 3 ms to minimize.
[2025-06-06 07:57:51] [INFO ] Flatten gal took : 718 ms
[2025-06-06 07:57:52] [INFO ] Flatten gal took : 401 ms
[2025-06-06 07:57:52] [INFO ] Deduced a trap composed of 129 places in 520 ms of which 10 ms to minimize.
[2025-06-06 07:57:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14488385925749896122.gal : 158 ms
[2025-06-06 07:57:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1915140679301077015.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/ReachabilityCardinality14488385925749896122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1915140679301077015.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2025-06-06 07:57:53] [INFO ] Deduced a trap composed of 91 places in 548 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality1915140679301077015.prop.
[2025-06-06 07:57:53] [INFO ] Deduced a trap composed of 93 places in 406 ms of which 2 ms to minimize.
[2025-06-06 07:57:53] [INFO ] Deduced a trap composed of 130 places in 423 ms of which 2 ms to minimize.
[2025-06-06 07:57:54] [INFO ] Deduced a trap composed of 131 places in 453 ms of which 2 ms to minimize.
[2025-06-06 07:57:54] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 3 ms to minimize.
[2025-06-06 07:57:55] [INFO ] Deduced a trap composed of 138 places in 280 ms of which 1 ms to minimize.
[2025-06-06 07:57:55] [INFO ] Deduced a trap composed of 134 places in 316 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 60
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :60 after 671
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :671 after 81081
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :81081 after 261051
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :261051 after 803946
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :803946 after 4.70672e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 144 places in 508 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, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.70672e+06 after 8.10932e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 8375ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 1 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 195 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 197 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 144702 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 144702 steps, saw 112691 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-06 07:58:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:03] [INFO ] Invariant cache hit.
[2025-06-06 07:58:03] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:58:04] [INFO ] Deduced a trap composed of 72 places in 829 ms of which 2 ms to minimize.
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 129 places in 433 ms of which 9 ms to minimize.
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 91 places in 461 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.10932e+06 after 1.67973e+07
[2025-06-06 07:58:06] [INFO ] Deduced a trap composed of 93 places in 408 ms of which 2 ms to minimize.
[2025-06-06 07:58:06] [INFO ] Deduced a trap composed of 130 places in 445 ms of which 2 ms to minimize.
[2025-06-06 07:58:06] [INFO ] Deduced a trap composed of 131 places in 424 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.67973e+07 after 3.57521e+07
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 74 places in 401 ms of which 2 ms to minimize.
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 138 places in 261 ms of which 2 ms to minimize.
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 134 places in 264 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 464 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5836 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:58:09] [INFO ] Deduced a trap composed of 144 places in 326 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, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.57521e+07 after 1.99733e+08
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 8590ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 1 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 181 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 182 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 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:58:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:12] [INFO ] Invariant cache hit.
[2025-06-06 07:58:13] [INFO ] Implicit Places using invariants in 785 ms returned []
[2025-06-06 07:58:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:13] [INFO ] Invariant cache hit.
[2025-06-06 07:58:13] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.99733e+08 after 3.6595e+08
[2025-06-06 07:58:32] [INFO ] Implicit Places using invariants and state equation in 19209 ms returned []
Implicit Place search using SMT with State Equation took 19999 ms to find 0 implicit places.
[2025-06-06 07:58:33] [INFO ] Redundant transitions in 785 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:58:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:33] [INFO ] Invariant cache hit.
[2025-06-06 07:58:33] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-06 07:58:43] [INFO ] Flatten gal took : 329 ms
[2025-06-06 07:58:43] [INFO ] Applying decomposition
[2025-06-06 07:58:43] [INFO ] Flatten gal took : 231 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12842203718059962577.txt' '-o' '/tmp/graph12842203718059962577.bin' '-w' '/tmp/graph12842203718059962577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12842203718059962577.bin' '-l' '-1' '-v' '-w' '/tmp/graph12842203718059962577.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:58:44] [INFO ] Decomposing Gal with order
[2025-06-06 07:58:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:58:45] [INFO ] Removed a total of 18109 redundant transitions.
[2025-06-06 07:58:45] [INFO ] Flatten gal took : 760 ms
[2025-06-06 07:58:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1148 labels/synchronizations in 476 ms.
[2025-06-06 07:58:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13026529682443373647.gal : 37 ms
[2025-06-06 07:58:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11366864376381422599.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13026529682443373647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11366864376381422599.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11366864376381422599.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 462
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :462 after 2417
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2417 after 21310
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :21310 after 49525
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :49525 after 198715
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :198715 after 235069
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :235069 after 495769
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :495769 after 677225
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :677225 after 688181
SMT process timed out in 62032ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 62170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83225 ms. Remains : 305/305 places, 7808/7808 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Szymanski-PT-b10-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b10-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:35] [INFO ] Invariant cache hit.
[2025-06-06 07:59:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:36] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-06 07:59:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:59:36] [INFO ] [Real]Added 147 Read/Feed constraints in 88 ms returned sat
[2025-06-06 07:59:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:59:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:59:36] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-06-06 07:59:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:59:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 1038 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 p246) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 194 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 196 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 07:59:37] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 07:59:37] [INFO ] Computed 3 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000003 steps (2 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 721 ms. (1385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:39] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 07:59:39] [INFO ] Invariant cache hit.
[2025-06-06 07:59:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:40] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2025-06-06 07:59:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:59:40] [INFO ] [Real]Added 147 Read/Feed constraints in 87 ms returned sat
[2025-06-06 07:59:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:59:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:40] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-06 07:59:41] [INFO ] [Nat]Added 147 Read/Feed constraints in 724 ms returned sat
[2025-06-06 07:59:42] [INFO ] Deduced a trap composed of 78 places in 555 ms of which 2 ms to minimize.
[2025-06-06 07:59:42] [INFO ] Deduced a trap composed of 129 places in 541 ms of which 2 ms to minimize.
[2025-06-06 07:59:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1286 ms
[2025-06-06 07:59:43] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 331 ms.
[2025-06-06 07:59:43] [INFO ] Added : 0 causal constraints over 0 iterations in 496 ms. Result :sat

BK_STOP 1749196784851

--------------------
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-b10"
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-b10, 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-174915604900021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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