Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME 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 1748602081797

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-05-30 10:48:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:48:05] [INFO ] Load time of PNML (sax parser for PT used): 566 ms
[2025-05-30 10:48:05] [INFO ] Transformed 1440 places.
[2025-05-30 10:48:05] [INFO ] Transformed 672 transitions.
[2025-05-30 10:48:05] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 813 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 1093 places in 16 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-02 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-06 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] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2025-05-30 10:48:05] [INFO ] Computed 6 invariants in 84 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[10, 10]
RANDOM walk for 10000 steps (2272 resets) in 260 ms. (38 steps per ms)
BEST_FIRST walk for 20002 steps (1996 resets) in 254 ms. (78 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[10, 10]
[2025-05-30 10:48:06] [INFO ] Invariant cache hit.
[2025-05-30 10:48:06] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2025-05-30 10:48:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2025-05-30 10:48:07] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-05-30 10:48:07] [INFO ] State equation strengthened by 418 read => feed constraints.
[2025-05-30 10:48:07] [INFO ] [Real]Added 418 Read/Feed constraints in 137 ms returned sat
[2025-05-30 10:48:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2025-05-30 10:48:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2025-05-30 10:48:07] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2025-05-30 10:48:08] [INFO ] [Nat]Added 418 Read/Feed constraints in 140 ms returned sat
[2025-05-30 10:48:08] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 233 ms.
[2025-05-30 10:48:08] [INFO ] Added : 7 causal constraints over 2 iterations in 476 ms. Result :sat
Minimization took 553 ms.
[2025-05-30 10:48:09] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:48:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2025-05-30 10:48:09] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-05-30 10:48:09] [INFO ] [Real]Added 418 Read/Feed constraints in 224 ms returned sat
[2025-05-30 10:48:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:48:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2025-05-30 10:48:10] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-05-30 10:48:10] [INFO ] [Nat]Added 418 Read/Feed constraints in 231 ms returned sat
[2025-05-30 10:48:10] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 135 ms.
[2025-05-30 10:48:11] [INFO ] Deduced a trap composed of 83 places in 282 ms of which 60 ms to minimize.
[2025-05-30 10:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2025-05-30 10:48:11] [INFO ] Added : 10 causal constraints over 3 iterations in 826 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[10, 10]
Support contains 2 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 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 184 place count 230 transition count 332
Iterating global reduction 1 with 95 rules applied. Total rules applied 279 place count 230 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 283 place count 230 transition count 328
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 355 place count 158 transition count 256
Iterating global reduction 2 with 72 rules applied. Total rules applied 427 place count 158 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 432 place count 158 transition count 251
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 473 place count 117 transition count 184
Iterating global reduction 3 with 41 rules applied. Total rules applied 514 place count 117 transition count 184
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 538 place count 117 transition count 160
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 548 place count 107 transition count 144
Iterating global reduction 4 with 10 rules applied. Total rules applied 558 place count 107 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 559 place count 107 transition count 143
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 567 place count 99 transition count 135
Iterating global reduction 5 with 8 rules applied. Total rules applied 575 place count 99 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 578 place count 99 transition count 132
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 584 place count 93 transition count 126
Iterating global reduction 6 with 6 rules applied. Total rules applied 590 place count 93 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 592 place count 93 transition count 124
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 594 place count 91 transition count 116
Iterating global reduction 7 with 2 rules applied. Total rules applied 596 place count 91 transition count 116
Applied a total of 596 rules in 151 ms. Remains 91 /347 variables (removed 256) and now considering 116/672 (removed 556) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 91/347 places, 116/672 transitions.
// Phase 1: matrix 116 rows 91 cols
[2025-05-30 10:48:12] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (229899 resets) in 1155 ms. (865 steps per ms)
BEST_FIRST walk for 2000000 steps (197066 resets) in 1108 ms. (1803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[10, 10]
[2025-05-30 10:48:14] [INFO ] Invariant cache hit.
[2025-05-30 10:48:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:48:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-30 10:48:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:48:14] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:48:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:48:14] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:48:14] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 83 transitions) in 12 ms.
[2025-05-30 10:48:14] [INFO ] Added : 5 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 106 ms.
[2025-05-30 10:48:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:48:15] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:15] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-30 10:48:15] [INFO ] [Nat]Added 38 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:48:15] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 83 transitions) in 14 ms.
[2025-05-30 10:48:15] [INFO ] Added : 8 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[10, 10]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 14 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 91/91 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 14 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-05-30 10:48:15] [INFO ] Invariant cache hit.
[2025-05-30 10:48:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-30 10:48:15] [INFO ] Invariant cache hit.
[2025-05-30 10:48:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:48:15] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2025-05-30 10:48:15] [INFO ] Redundant transitions in 5 ms returned []
Running 115 sub problems to find dead transitions.
[2025-05-30 10:48:15] [INFO ] Invariant cache hit.
[2025-05-30 10:48:15] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 131 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4322 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 115/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 246 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5271 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 10109ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 10128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10551 ms. Remains : 91/91 places, 116/116 transitions.
[2025-05-30 10:48:26] [INFO ] Flatten gal took : 88 ms
RANDOM walk for 40000 steps (9219 resets) in 1359 ms. (29 steps per ms) remains 4/4 properties
[2025-05-30 10:48:26] [INFO ] Flatten gal took : 81 ms
[2025-05-30 10:48:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10904057676224090883.gal : 34 ms
[2025-05-30 10:48:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5801534481502999425.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/ReachabilityCardinality10904057676224090883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5801534481502999425.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (3853 resets) in 579 ms. (68 steps per ms) remains 4/4 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 ...329
Loading property file /tmp/ReachabilityCardinality5801534481502999425.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 28
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :28 after 104
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :104 after 278
BEST_FIRST walk for 40002 steps (3992 resets) in 413 ms. (96 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :278 after 684
BEST_FIRST walk for 40003 steps (3936 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3908 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :684 after 1382
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1382 after 7016
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7016 after 13100
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13100 after 48290
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :48290 after 132042
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :132042 after 638906
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :638906 after 2.06944e+06
Interrupted probabilistic random walk after 562480 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :2 out of 4
Probabilistic random walk after 562480 steps, saw 224626 distinct states, run finished after 3009 ms. (steps per millisecond=186 ) properties seen :2
[2025-05-30 10:48:30] [INFO ] Invariant cache hit.
[2025-05-30 10:48:30] [INFO ] State equation strengthened by 38 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) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/102 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 56/158 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 37/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/165 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/207 variables, 37/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 26/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 10:48:30] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 2 solved, 0 unsolved in 302 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 314ms 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:[10, 10]
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-00
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]
[2025-05-30 10:48:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2252 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (978 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-05-30 10:48:30] [INFO ] Invariant cache hit.
[2025-05-30 10:48:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:48:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:48:30] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:48:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:30] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-30 10:48:30] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:30] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 83 transitions) in 9 ms.
[2025-05-30 10:48:30] [INFO ] Added : 5 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 98 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 110
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 89 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 107
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 87 transition count 106
Applied a total of 10 rules in 33 ms. Remains 87 /91 variables (removed 4) and now considering 106/116 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 87/91 places, 106/116 transitions.
// Phase 1: matrix 106 rows 87 cols
[2025-05-30 10:48:30] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229535 resets) in 1097 ms. (910 steps per ms)
BEST_FIRST walk for 1000001 steps (98255 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-05-30 10:48:32] [INFO ] Invariant cache hit.
[2025-05-30 10:48:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:48:32] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-30 10:48:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 10:48:32] [INFO ] [Real]Added 31 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:32] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:48:32] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:32] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 74 transitions) in 9 ms.
[2025-05-30 10:48:32] [INFO ] Added : 5 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 68 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 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 106/106 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 87/87 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 106/106 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-05-30 10:48:32] [INFO ] Invariant cache hit.
[2025-05-30 10:48:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 10:48:32] [INFO ] Invariant cache hit.
[2025-05-30 10:48:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 10:48:33] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2025-05-30 10:48:33] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 10:48:33] [INFO ] Invariant cache hit.
[2025-05-30 10:48:33] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/193 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 120 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2948 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/193 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 105/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 225 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6769 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 9899ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10227 ms. Remains : 87/87 places, 106/106 transitions.
RANDOM walk for 40000 steps (9154 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3928 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2025-05-30 10:48:43] [INFO ] Flatten gal took : 76 ms
[2025-05-30 10:48:43] [INFO ] Flatten gal took : 46 ms
BEST_FIRST walk for 40002 steps (3864 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2025-05-30 10:48:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7875965011111050711.gal : 16 ms
[2025-05-30 10:48:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10582260064536801900.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/ReachabilityCardinality7875965011111050711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10582260064536801900.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10582260064536801900.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 154
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :154 after 320
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :320 after 628
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :628 after 1268
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1268 after 4980
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4980 after 25246
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :25246 after 66540
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :66540 after 176552
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :176552 after 1.23162e+06
Interrupted probabilistic random walk after 2492652 steps, run timeout after 3001 ms. (steps per millisecond=830 ) properties seen :1 out of 2
Probabilistic random walk after 2492652 steps, saw 989409 distinct states, run finished after 3002 ms. (steps per millisecond=830 ) properties seen :1
[2025-05-30 10:48:46] [INFO ] Invariant cache hit.
[2025-05-30 10:48:46] [INFO ] State equation strengthened by 31 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/87 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/141 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/148 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 45/193 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 24/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 10:48:46] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 193/193 variables, and 121 constraints, problems are : Problem set: 1 solved, 0 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 223ms 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-00 in 15992 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 116 rows 91 cols
[2025-05-30 10:48:46] [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 (2286 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (921 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-05-30 10:48:46] [INFO ] Invariant cache hit.
[2025-05-30 10:48:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-30 10:48:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:48:46] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:48:46] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:48:46] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:48:46] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 83 transitions) in 9 ms.
[2025-05-30 10:48:46] [INFO ] Added : 8 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 67 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 86 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 86 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 18 ms. Remains 86 /91 variables (removed 5) and now considering 109/116 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 86/91 places, 109/116 transitions.
// Phase 1: matrix 109 rows 86 cols
[2025-05-30 10:48:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229515 resets) in 959 ms. (1041 steps per ms)
BEST_FIRST walk for 1000001 steps (98670 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-05-30 10:48:48] [INFO ] Invariant cache hit.
[2025-05-30 10:48:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:48] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-30 10:48:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:48:48] [INFO ] [Real]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:48:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:48:48] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-05-30 10:48:48] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:48:48] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 14 ms.
[2025-05-30 10:48:48] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-05-30 10:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2025-05-30 10:48:48] [INFO ] Added : 17 causal constraints over 5 iterations in 180 ms. Result :sat
Minimization took 63 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 7 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 8 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 6 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-05-30 10:48:48] [INFO ] Invariant cache hit.
[2025-05-30 10:48:48] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 10:48:48] [INFO ] Invariant cache hit.
[2025-05-30 10:48:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:48:49] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2025-05-30 10:48:49] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 10:48:49] [INFO ] Invariant cache hit.
[2025-05-30 10:48:49] [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 3989 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 7974 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 12086ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12468 ms. Remains : 86/86 places, 109/109 transitions.
[2025-05-30 10:49:01] [INFO ] Flatten gal took : 12 ms
[2025-05-30 10:49:01] [INFO ] Flatten gal took : 11 ms
[2025-05-30 10:49:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1983165854227959638.gal : 4 ms
[2025-05-30 10:49:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8645458579508595561.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/ReachabilityCardinality1983165854227959638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8645458579508595561.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/ReachabilityCardinality8645458579508595561.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
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 422
RANDOM walk for 40000 steps (9211 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :422 after 732
BEST_FIRST walk for 40003 steps (3941 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3970 resets) in 42 ms. (930 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
Interrupted probabilistic random walk after 2365174 steps, run timeout after 3001 ms. (steps per millisecond=788 ) properties seen :1 out of 2
Probabilistic random walk after 2365174 steps, saw 930225 distinct states, run finished after 3001 ms. (steps per millisecond=788 ) properties seen :1
[2025-05-30 10:49:04] [INFO ] Invariant cache hit.
[2025-05-30 10:49:04] [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
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :741414 after 3.24257e+06
[2025-05-30 10:49:06] [INFO ] Deduced a trap composed of 11 places in 1870 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 2022 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 2034ms 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 20089 ms.
[2025-05-30 10:49:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 10:49:06] [INFO ] Applying decomposition
[2025-05-30 10:49:06] [INFO ] Flatten gal took : 15 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/graph9404676538841160927.txt' '-o' '/tmp/graph9404676538841160927.bin' '-w' '/tmp/graph9404676538841160927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9404676538841160927.bin' '-l' '-1' '-v' '-w' '/tmp/graph9404676538841160927.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:49:06] [INFO ] Decomposing Gal with order
[2025-05-30 10:49:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:49:06] [INFO ] Removed a total of 129 redundant transitions.
[2025-05-30 10:49:06] [INFO ] Flatten gal took : 91 ms
[2025-05-30 10:49:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 19 ms.
[2025-05-30 10:49:06] [INFO ] Time to serialize gal into /tmp/UpperBounds17073007177288081799.gal : 8 ms
[2025-05-30 10:49:06] [INFO ] Time to serialize properties into /tmp/UpperBounds14862183709687184660.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/UpperBounds17073007177288081799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14862183709687184660.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 ...285
Loading property file /tmp/UpperBounds14862183709687184660.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,6.11252e+08,696.192,4085992,16615,2843,1.56495e+06,60686,366,4.59905e+07,89,2.52632e+06,0
Total reachable state count : 611251988

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 7
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-00 :0 <= i4.u5.l1281 <= 7
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 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-00,0,710.246,4085992,1,0,1.56495e+06,60686,482,4.59905e+07,112,2.52632e+06,7753
Min sum of variable value : 0
Maximum sum along a path : 7
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-05 :0 <= i4.u15.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,710.286,4085992,1,0,1.56495e+06,60686,506,4.59905e+07,112,2.52632e+06,8134
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 773663 ms.

BK_STOP 1748602858229

--------------------
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="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r069-smll-174854075800014"
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.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 ;