Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075900044.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 DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748604381179

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:26: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-05-30 11:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:26:24] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2025-05-30 11:26:24] [INFO ] Transformed 314 places.
[2025-05-30 11:26:24] [INFO ] Transformed 271 transitions.
[2025-05-30 11:26:24] [INFO ] Found NUPN structural information;
[2025-05-30 11:26:24] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 579 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 257 rows 314 cols
[2025-05-30 11:26:24] [INFO ] Computed 59 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (225 resets) in 128 ms. (77 steps per ms)
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (449 resets) in 335 ms. (297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:26:25] [INFO ] Invariant cache hit.
[2025-05-30 11:26:25] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2025-05-30 11:26:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2025-05-30 11:26:26] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2025-05-30 11:26:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2025-05-30 11:26:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2025-05-30 11:26:27] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2025-05-30 11:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:26:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:26:27] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 63 ms.
[2025-05-30 11:26:29] [INFO ] Added : 176 causal constraints over 36 iterations in 2152 ms. Result :sat
Minimization took 355 ms.
[2025-05-30 11:26:29] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:26:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:26:30] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2025-05-30 11:26:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:26:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:26:30] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-30 11:26:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2025-05-30 11:26:30] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 32 ms.
[2025-05-30 11:26:31] [INFO ] Added : 62 causal constraints over 13 iterations in 543 ms. Result :sat
Minimization took 309 ms.
[2025-05-30 11:26:31] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2025-05-30 11:26:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:26:31] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-05-30 11:26:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2025-05-30 11:26:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2025-05-30 11:26:32] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-05-30 11:26:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2025-05-30 11:26:32] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 40 ms.
[2025-05-30 11:26:34] [INFO ] Added : 182 causal constraints over 37 iterations in 1515 ms. Result :sat
Minimization took 502 ms.
[2025-05-30 11:26:34] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:26:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:26:34] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-05-30 11:26:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:26:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:26:35] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-05-30 11:26:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 83 ms returned sat
[2025-05-30 11:26:35] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 33 ms.
[2025-05-30 11:26:35] [INFO ] Added : 55 causal constraints over 11 iterations in 571 ms. Result :sat
Minimization took 303 ms.
[2025-05-30 11:26:36] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:26:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:26:36] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-05-30 11:26:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:26:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:26:37] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-05-30 11:26:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2025-05-30 11:26:37] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 22 ms to minimize.
[2025-05-30 11:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-05-30 11:26:37] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 48 ms.
[2025-05-30 11:26:38] [INFO ] Added : 178 causal constraints over 36 iterations in 1324 ms. Result :sat
Minimization took 381 ms.
[2025-05-30 11:26:39] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:26:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:26:39] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-30 11:26:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:26:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:26:39] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-05-30 11:26:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2025-05-30 11:26:39] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2025-05-30 11:26:40] [INFO ] Added : 136 causal constraints over 28 iterations in 945 ms. Result :sat
Minimization took 506 ms.
[2025-05-30 11:26:41] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:26:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2025-05-30 11:26:41] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-30 11:26:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:26:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2025-05-30 11:26:42] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2025-05-30 11:26:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2025-05-30 11:26:42] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2025-05-30 11:26:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-05-30 11:26:42] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:26:43] [INFO ] Added : 95 causal constraints over 19 iterations in 796 ms. Result :sat
Minimization took 300 ms.
[2025-05-30 11:26:43] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2025-05-30 11:26:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:26:43] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 11:26:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:26:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:26:44] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-05-30 11:26:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 221 ms returned sat
[2025-05-30 11:26:44] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2025-05-30 11:26:45] [INFO ] Added : 173 causal constraints over 35 iterations in 1500 ms. Result :sat
Minimization took 501 ms.
[2025-05-30 11:26:46] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2025-05-30 11:26:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:26:46] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-05-30 11:26:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:26:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:26:47] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-05-30 11:26:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 92 ms returned sat
[2025-05-30 11:26:47] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2025-05-30 11:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2025-05-30 11:26:47] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
[2025-05-30 11:26:48] [INFO ] Added : 176 causal constraints over 36 iterations in 1100 ms. Result :sat
Minimization took 430 ms.
[2025-05-30 11:26:49] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2025-05-30 11:26:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2025-05-30 11:26:49] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-05-30 11:26:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:26:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2025-05-30 11:26:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2025-05-30 11:26:49] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-05-30 11:26:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 159 ms returned sat
[2025-05-30 11:26:50] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 27 ms.
[2025-05-30 11:26:51] [INFO ] Added : 83 causal constraints over 17 iterations in 935 ms. Result :sat
Minimization took 324 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 154 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2025-05-30 11:26:54] [INFO ] Computed 60 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13604 resets) in 2378 ms. (420 steps per ms)
BEST_FIRST walk for 8000007 steps (18202 resets) in 8861 ms. (902 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:27:05] [INFO ] Invariant cache hit.
[2025-05-30 11:27:05] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:27:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2025-05-30 11:27:05] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-05-30 11:27:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:27:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2025-05-30 11:27:06] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2025-05-30 11:27:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:27:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2025-05-30 11:27:06] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 5 ms to minimize.
[2025-05-30 11:27:06] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2025-05-30 11:27:06] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2025-05-30 11:27:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2025-05-30 11:27:06] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2025-05-30 11:27:08] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2025-05-30 11:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-05-30 11:27:08] [INFO ] Added : 219 causal constraints over 44 iterations in 1519 ms. Result :sat
Minimization took 288 ms.
[2025-05-30 11:27:08] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2025-05-30 11:27:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:27:09] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-30 11:27:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:27:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:27:09] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-05-30 11:27:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-30 11:27:09] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 30 ms.
[2025-05-30 11:27:10] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2025-05-30 11:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-05-30 11:27:11] [INFO ] Added : 226 causal constraints over 46 iterations in 1630 ms. Result :sat
Minimization took 289 ms.
[2025-05-30 11:27:11] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:27:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2025-05-30 11:27:11] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2025-05-30 11:27:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:27:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:27:12] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-05-30 11:27:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 22 ms returned sat
[2025-05-30 11:27:12] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 4 ms to minimize.
[2025-05-30 11:27:12] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2025-05-30 11:27:12] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2025-05-30 11:27:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 471 ms
[2025-05-30 11:27:12] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2025-05-30 11:27:13] [INFO ] Added : 209 causal constraints over 42 iterations in 1034 ms. Result :sat
Minimization took 193 ms.
[2025-05-30 11:27:13] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2025-05-30 11:27:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2025-05-30 11:27:14] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2025-05-30 11:27:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-30 11:27:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2025-05-30 11:27:14] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-05-30 11:27:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2025-05-30 11:27:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2025-05-30 11:27:14] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 17 ms.
[2025-05-30 11:27:15] [INFO ] Added : 150 causal constraints over 31 iterations in 741 ms. Result :sat
Minimization took 207 ms.
[2025-05-30 11:27:15] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2025-05-30 11:27:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2025-05-30 11:27:16] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2025-05-30 11:27:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:27:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:27:16] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2025-05-30 11:27:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:27:16] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 29 ms.
[2025-05-30 11:27:17] [INFO ] Added : 78 causal constraints over 16 iterations in 656 ms. Result :sat
Minimization took 251 ms.
[2025-05-30 11:27:17] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:27:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2025-05-30 11:27:17] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2025-05-30 11:27:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:27:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2025-05-30 11:27:18] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-05-30 11:27:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2025-05-30 11:27:18] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 29 ms.
[2025-05-30 11:27:19] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 3 ms to minimize.
[2025-05-30 11:27:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-05-30 11:27:19] [INFO ] Added : 91 causal constraints over 19 iterations in 934 ms. Result :sat
Minimization took 223 ms.
[2025-05-30 11:27:19] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2025-05-30 11:27:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2025-05-30 11:27:19] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-05-30 11:27:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:27:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2025-05-30 11:27:20] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-05-30 11:27:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:27:20] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 28 ms.
[2025-05-30 11:27:21] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2025-05-30 11:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-05-30 11:27:21] [INFO ] Added : 229 causal constraints over 47 iterations in 1585 ms. Result :sat
Minimization took 261 ms.
[2025-05-30 11:27:22] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2025-05-30 11:27:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2025-05-30 11:27:22] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-30 11:27:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:27:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:27:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2025-05-30 11:27:22] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-05-30 11:27:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2025-05-30 11:27:22] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 23 ms.
[2025-05-30 11:27:23] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 4 ms to minimize.
[2025-05-30 11:27:24] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 4 ms to minimize.
[2025-05-30 11:27:24] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2025-05-30 11:27:24] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2025-05-30 11:27:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 842 ms
[2025-05-30 11:27:24] [INFO ] Added : 90 causal constraints over 18 iterations in 1498 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 23 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2025-05-30 11:27:29] [INFO ] Invariant cache hit.
[2025-05-30 11:27:29] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-30 11:27:29] [INFO ] Invariant cache hit.
[2025-05-30 11:27:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:27:30] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
[2025-05-30 11:27:30] [INFO ] Redundant transitions in 18 ms returned []
Running 250 sub problems to find dead transitions.
[2025-05-30 11:27:30] [INFO ] Invariant cache hit.
[2025-05-30 11:27:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:27:41] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:27:49] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 4 ms to minimize.
[2025-05-30 11:27:49] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:27:49] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2025-05-30 11:27:49] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:27:50] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 4 ms to minimize.
[2025-05-30 11:27:50] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 4 ms to minimize.
[2025-05-30 11:27:50] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2025-05-30 11:27:52] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:27:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 383 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:28:07] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2025-05-30 11:28:07] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:28:08] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2025-05-30 11:28:10] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2025-05-30 11:28:10] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 3 ms to minimize.
[2025-05-30 11:28:10] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2025-05-30 11:28:11] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 5 ms to minimize.
[2025-05-30 11:28:11] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 253/563 variables, 310/387 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 250/639 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 639 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 17/18 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61965 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (546 resets) in 2223 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
[2025-05-30 11:28:32] [INFO ] Flatten gal took : 256 ms
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2025-05-30 11:28:32] [INFO ] Flatten gal took : 140 ms
BEST_FIRST walk for 4004 steps (11 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
[2025-05-30 11:28:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality325992933599944061.gal : 32 ms
[2025-05-30 11:28:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16681427693623462260.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality325992933599944061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16681427693623462260.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality16681427693623462260.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :18 after 22
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :22 after 576
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :576 after 630
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :630 after 1440
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1440 after 11292
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :11292 after 69964
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :69964 after 93680
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :364744 after 412888
Interrupted probabilistic random walk after 383863 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 16
Probabilistic random walk after 383863 steps, saw 56791 distinct states, run finished after 3010 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-30 11:28:35] [INFO ] Invariant cache hit.
[2025-05-30 11:28:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 179/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :412888 after 6.77365e+08
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 63/519 variables, 14/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/520 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 44/564 variables, 44/373 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:37] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 2 ms to minimize.
[2025-05-30 11:28:37] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2025-05-30 11:28:37] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2025-05-30 11:28:38] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2025-05-30 11:28:38] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:38] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 32768
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD size :7.06975e+08 after 7.0795e+08
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 379 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4421 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 179/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/245 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:40] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2025-05-30 11:28:40] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2025-05-30 11:28:41] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 63/519 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/519 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/519 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 1/520 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:43] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/520 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 44/564 variables, 44/399 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 399 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 10/10 constraints]
After SMT, in 9441ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 26 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (542 resets) in 591 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :7.29588e+08 after 7.96643e+09
Interrupted probabilistic random walk after 393160 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 16
Probabilistic random walk after 393160 steps, saw 58029 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2025-05-30 11:28:48] [INFO ] Invariant cache hit.
[2025-05-30 11:28:48] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 179/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 63/519 variables, 14/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/520 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 44/564 variables, 44/373 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2025-05-30 11:28:51] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2025-05-30 11:28:51] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-05-30 11:28:51] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:51] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 379 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5492 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 179/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/245 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:54] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2025-05-30 11:28:54] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-05-30 11:28:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 63/519 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/519 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/519 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 1/520 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:28:57] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 12 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/520 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 44/564 variables, 44/399 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 399 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 10/10 constraints]
After SMT, in 11118ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 8 different solutions.
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :8.45539e+09 after 3.36009e+10
Parikh walk visited 0 properties in 2318 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2025-05-30 11:29:01] [INFO ] Invariant cache hit.
[2025-05-30 11:29:02] [INFO ] Implicit Places using invariants in 704 ms returned []
[2025-05-30 11:29:02] [INFO ] Invariant cache hit.
[2025-05-30 11:29:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:29:02] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2025-05-30 11:29:02] [INFO ] Redundant transitions in 3 ms returned []
Running 250 sub problems to find dead transitions.
[2025-05-30 11:29:02] [INFO ] Invariant cache hit.
[2025-05-30 11:29:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:29:11] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:29:17] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
[2025-05-30 11:29:19] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:29:22] [INFO ] Flatten gal took : 37 ms
[2025-05-30 11:29:22] [INFO ] Applying decomposition
[2025-05-30 11:29:22] [INFO ] Flatten gal took : 32 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/graph6183462050487390850.txt' '-o' '/tmp/graph6183462050487390850.bin' '-w' '/tmp/graph6183462050487390850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6183462050487390850.bin' '-l' '-1' '-v' '-w' '/tmp/graph6183462050487390850.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:29:22] [INFO ] Decomposing Gal with order
[2025-05-30 11:29:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:29:22] [INFO ] Removed a total of 61 redundant transitions.
[2025-05-30 11:29:22] [INFO ] Flatten gal took : 137 ms
[2025-05-30 11:29:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 17 ms.
[2025-05-30 11:29:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17678444839127120483.gal : 14 ms
[2025-05-30 11:29:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15230120980950159780.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17678444839127120483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15230120980950159780.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/ReachabilityCardinality15230120980950159780.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :20 after 364
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :364 after 2640
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :8206 after 2.30515e+08
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :2.30515e+08 after 4.72788e+08
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :4.72788e+08 after 7.55443e+08
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :7.55443e+08 after 1.15924e+09
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:29:26] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 13 ms to minimize.
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1.03797e+12 after 1.07158e+12
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:29:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.3555e+13 after 1.41519e+13
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 384 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 250 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2.13143e+13 after 2.19111e+13
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/380 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.83192e+13,17.7512,293072,30196,6657,648490,22371,310,803918,476,159271,0
Total reachable state count : 28319158339780

Verifying 16 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,9.7258e+10,17.8208,293072,1541,976,648490,22371,310,803918,478,159271,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,9.7258e+10,17.8364,293072,1541,976,648490,22371,312,803918,479,159271,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,168,17.8391,293072,71,309,648490,22371,312,803918,480,159271,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,168,17.8409,293072,71,309,648490,22371,314,803918,481,159271,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1.07748e+06,17.8482,293072,293,666,648490,22371,314,803918,482,159271,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1.07748e+06,17.8558,293072,293,666,648490,22371,317,803918,483,159271,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1.07748e+06,17.8623,293072,293,544,648490,22371,320,803918,485,159271,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1.07748e+06,17.8684,293072,293,544,648490,22371,326,803918,487,159271,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,180,17.87,293072,65,191,648490,22371,328,803918,489,159271,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,180,17.8718,293072,65,191,648490,22371,332,803918,491,159271,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,3796,17.873,293072,163,204,648490,22371,334,803918,493,159271,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,3796,17.8739,293072,163,204,648490,22371,338,803918,495,159271,0
Reachability property MAX6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,720,17.8752,293072,86,297,648490,22371,338,803918,496,159271,0
Invariant property MIN6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,720,17.8762,293072,86,297,648490,22371,340,803918,497,159271,0
Reachability property MAX7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,3796,17.8773,293072,163,189,648490,22371,342,803918,499,159271,0
Invariant property MIN7 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,3796,17.8779,293072,163,189,648490,22371,346,803918,501,159271,0
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/632 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2025-05-30 11:30:01] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 633 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 11/12 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61643 ms. Remains : 311/311 places, 253/253 transitions.
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 8 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 219449 ms.

BK_STOP 1748604603328

--------------------
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="DES-PT-50a"
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 DES-PT-50a, 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 r069-smll-174854075900044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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