Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189500541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DBSingleClientW-PT-d1m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716324806145

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 20:53:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:53:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:53:27] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-21 20:53:27] [INFO ] Transformed 1440 places.
[2024-05-21 20:53:27] [INFO ] Transformed 672 transitions.
[2024-05-21 20:53:27] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 20:53:27] [INFO ] Computed 6 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
RANDOM walk for 10000 steps (2273 resets) in 127 ms. (78 steps per ms)
BEST_FIRST walk for 40001 steps (3927 resets) in 156 ms. (254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
[2024-05-21 20:53:27] [INFO ] Invariant cache hit.
[2024-05-21 20:53:28] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 20:53:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 20:53:28] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-21 20:53:28] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 20:53:28] [INFO ] [Real]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-21 20:53:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-21 20:53:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:53:28] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 20:53:28] [INFO ] [Nat]Added 418 Read/Feed constraints in 77 ms returned sat
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 23 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-05-21 20:53:29] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 136 ms.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 3 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-21 20:53:29] [INFO ] Added : 7 causal constraints over 2 iterations in 531 ms. Result :sat
Minimization took 597 ms.
[2024-05-21 20:53:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Real]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-21 20:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-21 20:53:30] [INFO ] [Nat]Added 418 Read/Feed constraints in 72 ms returned sat
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-05-21 20:53:31] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 63 ms.
[2024-05-21 20:53:31] [INFO ] Added : 11 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 502 ms.
[2024-05-21 20:53:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:53:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 20:53:31] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-21 20:53:32] [INFO ] [Real]Added 418 Read/Feed constraints in 98 ms returned sat
[2024-05-21 20:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:53:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:53:32] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-21 20:53:32] [INFO ] [Nat]Added 418 Read/Feed constraints in 79 ms returned sat
[2024-05-21 20:53:32] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 67 ms.
[2024-05-21 20:53:32] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 4 ms to minimize.
[2024-05-21 20:53:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-21 20:53:32] [INFO ] Added : 10 causal constraints over 3 iterations in 471 ms. Result :sat
Minimization took 503 ms.
[2024-05-21 20:53:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Real]Added 418 Read/Feed constraints in 71 ms returned sat
[2024-05-21 20:53:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-21 20:53:33] [INFO ] [Nat]Added 418 Read/Feed constraints in 64 ms returned sat
[2024-05-21 20:53:34] [INFO ] Deduced a trap composed of 202 places in 164 ms of which 9 ms to minimize.
[2024-05-21 20:53:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-21 20:53:34] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2024-05-21 20:53:34] [INFO ] Added : 4 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 175 place count 232 transition count 338
Iterating global reduction 1 with 94 rules applied. Total rules applied 269 place count 232 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 272 place count 232 transition count 335
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 345 place count 159 transition count 262
Iterating global reduction 2 with 73 rules applied. Total rules applied 418 place count 159 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 423 place count 159 transition count 257
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 463 place count 119 transition count 192
Iterating global reduction 3 with 40 rules applied. Total rules applied 503 place count 119 transition count 192
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 525 place count 119 transition count 170
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 535 place count 109 transition count 153
Iterating global reduction 4 with 10 rules applied. Total rules applied 545 place count 109 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 546 place count 109 transition count 152
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 555 place count 100 transition count 143
Iterating global reduction 5 with 9 rules applied. Total rules applied 564 place count 100 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 567 place count 100 transition count 140
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 574 place count 93 transition count 133
Iterating global reduction 6 with 7 rules applied. Total rules applied 581 place count 93 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 584 place count 93 transition count 130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 585 place count 92 transition count 128
Iterating global reduction 7 with 1 rules applied. Total rules applied 586 place count 92 transition count 128
Applied a total of 586 rules in 96 ms. Remains 92 /347 variables (removed 255) and now considering 128/672 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 92/347 places, 128/672 transitions.
// Phase 1: matrix 128 rows 92 cols
[2024-05-21 20:53:34] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
RANDOM walk for 1000000 steps (229547 resets) in 1029 ms. (970 steps per ms)
BEST_FIRST walk for 4000002 steps (393959 resets) in 1995 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1] Max Struct:[10, 1741, 10, 1741]
[2024-05-21 20:53:37] [INFO ] Invariant cache hit.
[2024-05-21 20:53:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-21 20:53:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 20:53:37] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 20:53:38] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 20:53:38] [INFO ] [Real]Added 52 Read/Feed constraints in 12 ms returned sat
[2024-05-21 20:53:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Added 52 Read/Feed constraints in 8 ms returned sat
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-21 20:53:38] [INFO ] Computed and/alt/rep : 34/79/34 causal constraints (skipped 93 transitions) in 7 ms.
[2024-05-21 20:53:38] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 29 ms.
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Added 52 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:53:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Nat]Added 52 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:53:38] [INFO ] Computed and/alt/rep : 34/79/34 causal constraints (skipped 93 transitions) in 10 ms.
[2024-05-21 20:53:38] [INFO ] Added : 8 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 44 ms.
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:38] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1] Max Struct:[1, 1741, 10, 1]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 128/128 transitions.
Graph (complete) has 291 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 91 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 89 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 89 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 89 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 88 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 88 transition count 118
Applied a total of 13 rules in 13 ms. Remains 88 /92 variables (removed 4) and now considering 118/128 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 88/92 places, 118/128 transitions.
// Phase 1: matrix 118 rows 88 cols
[2024-05-21 20:53:38] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1741, 10]
RANDOM walk for 1000000 steps (229962 resets) in 901 ms. (1108 steps per ms)
BEST_FIRST walk for 2000001 steps (197358 resets) in 845 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1741, 10]
[2024-05-21 20:53:40] [INFO ] Invariant cache hit.
[2024-05-21 20:53:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:53:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:53:40] [INFO ] [Real]Added 43 Read/Feed constraints in 10 ms returned sat
[2024-05-21 20:53:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:53:40] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 11 ms.
[2024-05-21 20:53:40] [INFO ] Added : 9 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 33 ms.
[2024-05-21 20:53:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:53:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 20:53:40] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:53:40] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 6 ms.
[2024-05-21 20:53:40] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1741, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/88 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 20:53:40] [INFO ] Invariant cache hit.
[2024-05-21 20:53:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 20:53:40] [INFO ] Invariant cache hit.
[2024-05-21 20:53:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:53:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-21 20:53:41] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 20:53:41] [INFO ] Invariant cache hit.
[2024-05-21 20:53:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2527 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4685 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7408ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7739 ms. Remains : 88/88 places, 118/118 transitions.
RANDOM walk for 40000 steps (9083 resets) in 793 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3976 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3957 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3858 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
[2024-05-21 20:53:49] [INFO ] Flatten gal took : 109 ms
BEST_FIRST walk for 40003 steps (3855 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
[2024-05-21 20:53:49] [INFO ] Flatten gal took : 41 ms
[2024-05-21 20:53:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13939832677255985443.gal : 19 ms
[2024-05-21 20:53:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14822298748224868385.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/ReachabilityCardinality13939832677255985443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14822298748224868385.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14822298748224868385.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :154 after 278
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :278 after 500
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :500 after 960
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :960 after 5024
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5024 after 14034
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :14034 after 70364
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :70364 after 725420
Interrupted probabilistic random walk after 1043416 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :2 out of 4
Probabilistic random walk after 1043416 steps, saw 391549 distinct states, run finished after 3004 ms. (steps per millisecond=347 ) properties seen :2
[2024-05-21 20:53:52] [INFO ] Invariant cache hit.
[2024-05-21 20:53:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/104 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 7/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 12 (OVERLAPS) 44/206 variables, 36/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 27/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 20:53:52] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 206/206 variables, and 134 constraints, problems are : Problem set: 2 solved, 0 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 206ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1741, 10]
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 20:53:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 10000 steps (2283 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (957 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 20:53:52] [INFO ] Invariant cache hit.
[2024-05-21 20:53:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 20:53:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:53:52] [INFO ] [Real]Added 43 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:53:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:53:52] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 7 ms.
[2024-05-21 20:53:52] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 84 transition count 108
Applied a total of 10 rules in 15 ms. Remains 84 /88 variables (removed 4) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 84/88 places, 108/118 transitions.
// Phase 1: matrix 108 rows 84 cols
[2024-05-21 20:53:52] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 1000000 steps (230090 resets) in 837 ms. (1193 steps per ms)
BEST_FIRST walk for 1000001 steps (98676 resets) in 386 ms. (2583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 20:53:53] [INFO ] Invariant cache hit.
[2024-05-21 20:53:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:53:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:53:54] [INFO ] [Real]Added 36 Read/Feed constraints in 29 ms returned sat
[2024-05-21 20:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:53:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:53:54] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:53:54] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 8 ms.
[2024-05-21 20:53:54] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 20:53:54] [INFO ] Invariant cache hit.
[2024-05-21 20:53:54] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 20:53:54] [INFO ] Invariant cache hit.
[2024-05-21 20:53:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:53:54] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 20:53:54] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 20:53:54] [INFO ] Invariant cache hit.
[2024-05-21 20:53:54] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1902 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4316 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6356ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6705 ms. Remains : 84/84 places, 108/108 transitions.
RANDOM walk for 40000 steps (9185 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3837 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2024-05-21 20:54:00] [INFO ] Flatten gal took : 38 ms
[2024-05-21 20:54:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:54:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4774520233325643038.gal : 2 ms
[2024-05-21 20:54:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5608834913888736332.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4774520233325643038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5608834913888736332.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3963 resets) in 59 ms. (666 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5608834913888736332.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 278
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :278 after 550
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :550 after 1008
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1008 after 5708
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5708 after 18218
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18218 after 72114
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :72114 after 326101
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :326101 after 999143
Interrupted probabilistic random walk after 3222219 steps, run timeout after 3001 ms. (steps per millisecond=1073 ) properties seen :1 out of 2
Probabilistic random walk after 3222219 steps, saw 1256222 distinct states, run finished after 3001 ms. (steps per millisecond=1073 ) properties seen :1
[2024-05-21 20:54:03] [INFO ] Invariant cache hit.
[2024-05-21 20:54:03] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1741]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02 in 11633 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 118 rows 88 cols
[2024-05-21 20:54:04] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2296 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (979 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 20:54:04] [INFO ] Invariant cache hit.
[2024-05-21 20:54:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 20:54:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:54:04] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:54:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 20:54:04] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:54:04] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 7 ms.
[2024-05-21 20:54:04] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 109
Applied a total of 5 rules in 12 ms. Remains 86 /88 variables (removed 2) and now considering 109/118 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 86/88 places, 109/118 transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 20:54:04] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229663 resets) in 813 ms. (1228 steps per ms)
BEST_FIRST walk for 1000001 steps (98181 resets) in 388 ms. (2570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 20:54:05] [INFO ] Invariant cache hit.
[2024-05-21 20:54:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:05] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 20:54:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:54:05] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:54:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:54:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:54:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:54:05] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 5 ms.
[2024-05-21 20:54:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-21 20:54:05] [INFO ] Added : 17 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 20:54:05] [INFO ] Invariant cache hit.
[2024-05-21 20:54:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 20:54:05] [INFO ] Invariant cache hit.
[2024-05-21 20:54:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:54:06] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 20:54:06] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 20:54:06] [INFO ] Invariant cache hit.
[2024-05-21 20:54:06] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1935 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4417 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6463ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6679 ms. Remains : 86/86 places, 109/109 transitions.
[2024-05-21 20:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:54:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:54:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9156931277880417415.gal : 2 ms
[2024-05-21 20:54:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3147880222225188699.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9156931277880417415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3147880222225188699.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/ReachabilityCardinality3147880222225188699.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 248
RANDOM walk for 40000 steps (9205 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 422
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :422 after 732
BEST_FIRST walk for 40004 steps (3920 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3920 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :732 after 1326
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1326 after 9295
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9295 after 47174
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :47174 after 741414
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :741414 after 3.24257e+06
Interrupted probabilistic random walk after 3242554 steps, run timeout after 3001 ms. (steps per millisecond=1080 ) properties seen :1 out of 2
Probabilistic random walk after 3242554 steps, saw 1256334 distinct states, run finished after 3001 ms. (steps per millisecond=1080 ) properties seen :1
[2024-05-21 20:54:15] [INFO ] Invariant cache hit.
[2024-05-21 20:54:15] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/90 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/192 variables, 75/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:54:15] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/195 variables, and 120 constraints, problems are : Problem set: 1 solved, 0 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 83/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05 in 11744 ms.
[2024-05-21 20:54:15] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:54:15] [INFO ] Applying decomposition
[2024-05-21 20:54:15] [INFO ] Flatten gal took : 9 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/graph12044334106795799801.txt' '-o' '/tmp/graph12044334106795799801.bin' '-w' '/tmp/graph12044334106795799801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12044334106795799801.bin' '-l' '-1' '-v' '-w' '/tmp/graph12044334106795799801.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:54:15] [INFO ] Decomposing Gal with order
[2024-05-21 20:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:54:16] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-21 20:54:16] [INFO ] Flatten gal took : 38 ms
[2024-05-21 20:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 8 ms.
[2024-05-21 20:54:16] [INFO ] Time to serialize gal into /tmp/UpperBounds12270219091088743187.gal : 3 ms
[2024-05-21 20:54:16] [INFO ] Time to serialize properties into /tmp/UpperBounds6801995690491223015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12270219091088743187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6801995690491223015.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 ...284
Loading property file /tmp/UpperBounds6801995690491223015.prop.
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.28531e+08,95.8167,1032984,5648,1173,653560,39637,345,9.05563e+06,105,303706,0
Total reachable state count : 228530857

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-02 :0 <= u8.l305 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m10-UpperBounds-02,0,97.7182,1032984,1,0,653560,39637,452,9.05563e+06,137,303706,3661
Min sum of variable value : 0
Maximum sum along a path : 7
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-05 :0 <= i4.u11.l1018 <= 7
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-05 7 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m10-UpperBounds-05,0,97.8577,1032984,1,0,653560,39637,478,9.05563e+06,148,303706,5460
Total runtime 146866 ms.

BK_STOP 1716324954197

--------------------
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="DBSingleClientW-PT-d1m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m10, 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 r092-tall-171624189500541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;