fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654371900056
Last Updated
July 7, 2024

About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S24C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16222.972 3600000.00 2616860.00 520992.40 1 1 1 1 ? 0 1 ? ? 1 ? 0 0 1 1 1 normal

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.r263-tall-171654371900056.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 gold2023
Input is MultiCrashLeafsetExtension-PT-S24C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716637534110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 11:45:35] [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-25 11:45:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:45:36] [INFO ] Load time of PNML (sax parser for PT used): 466 ms
[2024-05-25 11:45:36] [INFO ] Transformed 12464 places.
[2024-05-25 11:45:36] [INFO ] Transformed 18463 transitions.
[2024-05-25 11:45:36] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 17863 out of 18463 initially.
// Phase 1: matrix 17863 rows 12464 cols
[2024-05-25 11:45:37] [INFO ] Computed 1029 invariants in 1254 ms
Incomplete random walk after 10000 steps, including 161 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :1
[2024-05-25 11:45:38] [INFO ] Flow matrix only has 17863 transitions (discarded 600 similar events)
// Phase 1: matrix 17863 rows 12464 cols
[2024-05-25 11:45:40] [INFO ] Computed 1029 invariants in 1072 ms
[2024-05-25 11:45:41] [INFO ] [Real]Absence check using 66 positive place invariants in 217 ms returned sat
[2024-05-25 11:45:42] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 623 ms returned sat
[2024-05-25 11:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:45:45] [INFO ] [Real]Absence check using state equation in 2765 ms returned unknown
[2024-05-25 11:45:46] [INFO ] [Real]Absence check using 66 positive place invariants in 219 ms returned sat
[2024-05-25 11:45:47] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 638 ms returned sat
[2024-05-25 11:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:45:50] [INFO ] [Real]Absence check using state equation in 3000 ms returned unknown
[2024-05-25 11:45:51] [INFO ] [Real]Absence check using 66 positive place invariants in 225 ms returned sat
[2024-05-25 11:45:52] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 595 ms returned sat
[2024-05-25 11:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:45:55] [INFO ] [Real]Absence check using state equation in 2957 ms returned unknown
[2024-05-25 11:45:56] [INFO ] [Real]Absence check using 66 positive place invariants in 206 ms returned sat
[2024-05-25 11:45:57] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 541 ms returned unsat
[2024-05-25 11:45:58] [INFO ] [Real]Absence check using 66 positive place invariants in 212 ms returned sat
[2024-05-25 11:45:59] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 549 ms returned sat
[2024-05-25 11:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:02] [INFO ] [Real]Absence check using state equation in 3045 ms returned unknown
[2024-05-25 11:46:03] [INFO ] [Real]Absence check using 66 positive place invariants in 225 ms returned sat
[2024-05-25 11:46:04] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 604 ms returned sat
[2024-05-25 11:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:07] [INFO ] [Real]Absence check using state equation in 2932 ms returned unknown
[2024-05-25 11:46:08] [INFO ] [Real]Absence check using 66 positive place invariants in 214 ms returned sat
[2024-05-25 11:46:09] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 540 ms returned unsat
[2024-05-25 11:46:10] [INFO ] [Real]Absence check using 66 positive place invariants in 205 ms returned sat
[2024-05-25 11:46:11] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 584 ms returned sat
[2024-05-25 11:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:14] [INFO ] [Real]Absence check using state equation in 3009 ms returned unknown
[2024-05-25 11:46:15] [INFO ] [Real]Absence check using 66 positive place invariants in 208 ms returned sat
[2024-05-25 11:46:16] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 596 ms returned sat
[2024-05-25 11:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:19] [INFO ] [Real]Absence check using state equation in 2976 ms returned unknown
[2024-05-25 11:46:20] [INFO ] [Real]Absence check using 66 positive place invariants in 206 ms returned sat
[2024-05-25 11:46:21] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 563 ms returned unsat
[2024-05-25 11:46:22] [INFO ] [Real]Absence check using 66 positive place invariants in 218 ms returned sat
[2024-05-25 11:46:23] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 577 ms returned sat
[2024-05-25 11:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:26] [INFO ] [Real]Absence check using state equation in 3107 ms returned unknown
[2024-05-25 11:46:27] [INFO ] [Real]Absence check using 66 positive place invariants in 210 ms returned sat
[2024-05-25 11:46:28] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 579 ms returned sat
[2024-05-25 11:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:31] [INFO ] [Real]Absence check using state equation in 2967 ms returned unknown
[2024-05-25 11:46:32] [INFO ] [Real]Absence check using 66 positive place invariants in 196 ms returned sat
[2024-05-25 11:46:33] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 577 ms returned sat
[2024-05-25 11:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:36] [INFO ] [Real]Absence check using state equation in 3004 ms returned unknown
[2024-05-25 11:46:37] [INFO ] [Real]Absence check using 66 positive place invariants in 210 ms returned sat
[2024-05-25 11:46:38] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 541 ms returned unsat
[2024-05-25 11:46:39] [INFO ] [Real]Absence check using 66 positive place invariants in 205 ms returned sat
[2024-05-25 11:46:40] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 573 ms returned sat
[2024-05-25 11:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:46:43] [INFO ] [Real]Absence check using state equation in 3030 ms returned unknown
[2024-05-25 11:46:44] [INFO ] [Real]Absence check using 66 positive place invariants in 205 ms returned sat
[2024-05-25 11:46:45] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 537 ms returned unsat
Current structural bounds on expressions (after SMT) : [75, 75, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25, 1] Max seen :[0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 12464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Graph (complete) has 41533 edges and 12464 vertex of which 12424 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.39 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 3596 transitions
Trivial Post-agglo rules discarded 3596 transitions
Performed 3596 trivial Post agglomeration. Transition count delta: 3596
Iterating post reduction 0 with 3596 rules applied. Total rules applied 3597 place count 12424 transition count 14867
Reduce places removed 3596 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3598 rules applied. Total rules applied 7195 place count 8828 transition count 14865
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7197 place count 8826 transition count 14865
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 300 Pre rules applied. Total rules applied 7197 place count 8826 transition count 14565
Deduced a syphon composed of 300 places in 15 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 7797 place count 8526 transition count 14565
Discarding 3296 places :
Symmetric choice reduction at 3 with 3296 rule applications. Total rules 11093 place count 5230 transition count 11269
Iterating global reduction 3 with 3296 rules applied. Total rules applied 14389 place count 5230 transition count 11269
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 14389 place count 5230 transition count 11261
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 14405 place count 5222 transition count 11261
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 14951 place count 4676 transition count 7985
Iterating global reduction 3 with 546 rules applied. Total rules applied 15497 place count 4676 transition count 7985
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 15547 place count 4651 transition count 7960
Free-agglomeration rule (complex) applied 340 times.
Iterating global reduction 3 with 340 rules applied. Total rules applied 15887 place count 4651 transition count 10350
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 3 with 340 rules applied. Total rules applied 16227 place count 4311 transition count 10350
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 16327 place count 4311 transition count 10350
Applied a total of 16327 rules in 5072 ms. Remains 4311 /12464 variables (removed 8153) and now considering 10350/18463 (removed 8113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5075 ms. Remains : 4311/12464 places, 10350/18463 transitions.
Normalized transition count is 9464 out of 10350 initially.
// Phase 1: matrix 9464 rows 4311 cols
[2024-05-25 11:46:50] [INFO ] Computed 989 invariants in 283 ms
Interrupted random walk after 793834 steps, including 21275 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 4
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 931115 steps, including 3090 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 928727 steps, including 3082 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 2
Interrupted Best-First random walk after 931941 steps, including 3092 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 933629 steps, including 3098 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 931446 steps, including 3091 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 932411 steps, including 3094 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 929941 steps, including 3086 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 2
Interrupted Best-First random walk after 933839 steps, including 3099 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
Interrupted Best-First random walk after 931145 steps, including 3090 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 2
[2024-05-25 11:48:05] [INFO ] Flow matrix only has 9464 transitions (discarded 886 similar events)
// Phase 1: matrix 9464 rows 4311 cols
[2024-05-25 11:48:05] [INFO ] Computed 989 invariants in 280 ms
[2024-05-25 11:48:06] [INFO ] [Real]Absence check using 49 positive place invariants in 97 ms returned sat
[2024-05-25 11:48:06] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 203 ms returned unsat
[2024-05-25 11:48:07] [INFO ] [Real]Absence check using 49 positive place invariants in 132 ms returned sat
[2024-05-25 11:48:07] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 29 ms returned unsat
[2024-05-25 11:48:07] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 11:48:07] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 228 ms returned sat
[2024-05-25 11:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:11] [INFO ] [Real]Absence check using state equation in 3872 ms returned sat
[2024-05-25 11:48:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:48:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 11:48:12] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 231 ms returned sat
[2024-05-25 11:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:16] [INFO ] [Nat]Absence check using state equation in 4037 ms returned sat
[2024-05-25 11:48:16] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:48:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:48:23] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6354 ms returned unknown
[2024-05-25 11:48:23] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 11:48:23] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 229 ms returned sat
[2024-05-25 11:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:28] [INFO ] [Real]Absence check using state equation in 4364 ms returned sat
[2024-05-25 11:48:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:48:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 11:48:29] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 233 ms returned sat
[2024-05-25 11:48:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:33] [INFO ] [Nat]Absence check using state equation in 4187 ms returned sat
[2024-05-25 11:48:36] [INFO ] [Nat]Added 5602 Read/Feed constraints in 2728 ms returned unsat
[2024-05-25 11:48:36] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 11:48:36] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 235 ms returned sat
[2024-05-25 11:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:41] [INFO ] [Real]Absence check using state equation in 4200 ms returned sat
[2024-05-25 11:48:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:48:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 11:48:42] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 241 ms returned sat
[2024-05-25 11:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:46] [INFO ] [Nat]Absence check using state equation in 4106 ms returned sat
[2024-05-25 11:48:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:48:52] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6562 ms returned unknown
[2024-05-25 11:48:53] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 11:48:53] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 231 ms returned sat
[2024-05-25 11:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:48:57] [INFO ] [Real]Absence check using state equation in 4116 ms returned sat
[2024-05-25 11:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:48:58] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 11:48:58] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 240 ms returned sat
[2024-05-25 11:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:02] [INFO ] [Nat]Absence check using state equation in 4283 ms returned sat
[2024-05-25 11:49:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:49:09] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6316 ms returned unknown
[2024-05-25 11:49:09] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 11:49:09] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 240 ms returned sat
[2024-05-25 11:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:13] [INFO ] [Real]Absence check using state equation in 3907 ms returned sat
[2024-05-25 11:49:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:49:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 86 ms returned sat
[2024-05-25 11:49:14] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 240 ms returned sat
[2024-05-25 11:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:18] [INFO ] [Nat]Absence check using state equation in 4173 ms returned sat
[2024-05-25 11:49:21] [INFO ] [Nat]Added 5602 Read/Feed constraints in 2474 ms returned sat
[2024-05-25 11:49:22] [INFO ] Computed and/alt/rep : 4617/6653/4617 causal constraints (skipped 4822 transitions) in 929 ms.
[2024-05-25 11:49:24] [INFO ] Added : 8 causal constraints over 2 iterations in 2751 ms. Result :sat
[2024-05-25 11:49:25] [INFO ] [Real]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-05-25 11:49:25] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 237 ms returned sat
[2024-05-25 11:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:29] [INFO ] [Real]Absence check using state equation in 4310 ms returned sat
[2024-05-25 11:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:49:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 11:49:30] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 235 ms returned sat
[2024-05-25 11:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:35] [INFO ] [Nat]Absence check using state equation in 4143 ms returned sat
[2024-05-25 11:49:36] [INFO ] [Nat]Added 5602 Read/Feed constraints in 1318 ms returned unsat
[2024-05-25 11:49:36] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 11:49:37] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 241 ms returned sat
[2024-05-25 11:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:41] [INFO ] [Real]Absence check using state equation in 4095 ms returned sat
[2024-05-25 11:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:49:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 11:49:42] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 242 ms returned sat
[2024-05-25 11:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:49:46] [INFO ] [Nat]Absence check using state equation in 3928 ms returned sat
[2024-05-25 11:49:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:49:50] [INFO ] [Nat]Added 5602 Read/Feed constraints in 4655 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0, 1, 1, 1, 0, 0] Max seen :[1, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 4311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4311/4311 places, 10350/10350 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4311 transition count 10348
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4309 transition count 10348
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 4309 transition count 10344
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 4305 transition count 10344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 4301 transition count 10340
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 4301 transition count 10340
Applied a total of 20 rules in 1378 ms. Remains 4301 /4311 variables (removed 10) and now considering 10340/10350 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1378 ms. Remains : 4301/4311 places, 10340/10350 transitions.
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:49:52] [INFO ] Computed 989 invariants in 275 ms
Interrupted random walk after 820113 steps, including 21989 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 0
Interrupted Best-First random walk after 893854 steps, including 2966 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Interrupted Best-First random walk after 879293 steps, including 2918 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 896281 steps, including 2974 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen 0
Interrupted Best-First random walk after 909010 steps, including 3016 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 0
[2024-05-25 11:50:42] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:50:42] [INFO ] Computed 989 invariants in 265 ms
[2024-05-25 11:50:43] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-05-25 11:50:43] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 233 ms returned sat
[2024-05-25 11:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:50:47] [INFO ] [Real]Absence check using state equation in 3575 ms returned sat
[2024-05-25 11:50:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:50:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 11:50:47] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 228 ms returned sat
[2024-05-25 11:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:50:51] [INFO ] [Nat]Absence check using state equation in 3745 ms returned sat
[2024-05-25 11:50:51] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:50:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:50:58] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6417 ms returned unknown
[2024-05-25 11:50:58] [INFO ] [Real]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-05-25 11:50:58] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 205 ms returned sat
[2024-05-25 11:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:02] [INFO ] [Real]Absence check using state equation in 3483 ms returned sat
[2024-05-25 11:51:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:51:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 11:51:03] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 224 ms returned sat
[2024-05-25 11:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:07] [INFO ] [Nat]Absence check using state equation in 3912 ms returned sat
[2024-05-25 11:51:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:51:13] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6330 ms returned unknown
[2024-05-25 11:51:13] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 11:51:14] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 224 ms returned sat
[2024-05-25 11:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:17] [INFO ] [Real]Absence check using state equation in 3439 ms returned sat
[2024-05-25 11:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:51:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 11:51:18] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 220 ms returned sat
[2024-05-25 11:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:22] [INFO ] [Nat]Absence check using state equation in 4049 ms returned sat
[2024-05-25 11:51:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:51:28] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6053 ms returned sat
[2024-05-25 11:51:34] [INFO ] Deduced a trap composed of 526 places in 5161 ms of which 17 ms to minimize.
[2024-05-25 11:51:39] [INFO ] Deduced a trap composed of 301 places in 5453 ms of which 5 ms to minimize.
[2024-05-25 11:51:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 11520 ms
[2024-05-25 11:51:41] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4819 transitions) in 961 ms.
[2024-05-25 11:51:44] [INFO ] Added : 14 causal constraints over 4 iterations in 4148 ms. Result :sat
[2024-05-25 11:51:45] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-05-25 11:51:45] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 225 ms returned sat
[2024-05-25 11:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:49] [INFO ] [Real]Absence check using state equation in 3981 ms returned sat
[2024-05-25 11:51:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:51:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-05-25 11:51:50] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 227 ms returned sat
[2024-05-25 11:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:51:54] [INFO ] [Nat]Absence check using state equation in 4151 ms returned sat
[2024-05-25 11:51:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:51:57] [INFO ] [Nat]Added 5602 Read/Feed constraints in 3499 ms returned sat
[2024-05-25 11:52:02] [INFO ] Deduced a trap composed of 614 places in 4834 ms of which 19 ms to minimize.
[2024-05-25 11:52:08] [INFO ] Deduced a trap composed of 342 places in 5232 ms of which 5 ms to minimize.
[2024-05-25 11:52:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10946 ms
[2024-05-25 11:52:09] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4819 transitions) in 658 ms.
[2024-05-25 11:52:13] [INFO ] Added : 11 causal constraints over 3 iterations in 4317 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 518 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 514 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 11:52:14] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:52:14] [INFO ] Invariant cache hit.
[2024-05-25 11:52:18] [INFO ] Implicit Places using invariants in 4067 ms returned []
Implicit Place search using SMT only with invariants took 4083 ms to find 0 implicit places.
[2024-05-25 11:52:18] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:52:18] [INFO ] Invariant cache hit.
[2024-05-25 11:52:24] [INFO ] Dead Transitions using invariants and state equation in 5506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10120 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:52:24] [INFO ] Computed 989 invariants in 245 ms
Incomplete random walk after 10000 steps, including 267 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
[2024-05-25 11:52:25] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:52:25] [INFO ] Computed 989 invariants in 246 ms
[2024-05-25 11:52:25] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-05-25 11:52:26] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 224 ms returned sat
[2024-05-25 11:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:52:29] [INFO ] [Real]Absence check using state equation in 3472 ms returned sat
[2024-05-25 11:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:52:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 11:52:30] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 230 ms returned sat
[2024-05-25 11:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:52:34] [INFO ] [Nat]Absence check using state equation in 3641 ms returned sat
[2024-05-25 11:52:34] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:52:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:52:34] [INFO ] [Nat]Added 5602 Read/Feed constraints in 611 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 520 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:52:35] [INFO ] Computed 989 invariants in 255 ms
Interrupted random walk after 856007 steps, including 22948 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Interrupted Best-First random walk after 942282 steps, including 3127 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 0
[2024-05-25 11:53:10] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:53:10] [INFO ] Computed 989 invariants in 253 ms
[2024-05-25 11:53:11] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 11:53:11] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 226 ms returned sat
[2024-05-25 11:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:53:15] [INFO ] [Real]Absence check using state equation in 3519 ms returned sat
[2024-05-25 11:53:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:53:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-05-25 11:53:15] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 229 ms returned sat
[2024-05-25 11:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:53:19] [INFO ] [Nat]Absence check using state equation in 3706 ms returned sat
[2024-05-25 11:53:19] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:53:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:53:26] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6303 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 515 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 507 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 11:53:27] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:53:27] [INFO ] Invariant cache hit.
[2024-05-25 11:53:30] [INFO ] Implicit Places using invariants in 3862 ms returned []
Implicit Place search using SMT only with invariants took 3870 ms to find 0 implicit places.
[2024-05-25 11:53:30] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:53:30] [INFO ] Invariant cache hit.
[2024-05-25 11:53:36] [INFO ] Dead Transitions using invariants and state equation in 5630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10021 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04 in 72202 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-07
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:53:36] [INFO ] Computed 989 invariants in 245 ms
Incomplete random walk after 10000 steps, including 267 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
[2024-05-25 11:53:37] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:53:37] [INFO ] Computed 989 invariants in 265 ms
[2024-05-25 11:53:37] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 11:53:38] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 226 ms returned sat
[2024-05-25 11:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:53:41] [INFO ] [Real]Absence check using state equation in 3539 ms returned sat
[2024-05-25 11:53:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:53:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 11:53:42] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 223 ms returned sat
[2024-05-25 11:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:53:46] [INFO ] [Nat]Absence check using state equation in 3882 ms returned sat
[2024-05-25 11:53:46] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:53:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:53:47] [INFO ] [Nat]Added 5602 Read/Feed constraints in 406 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 501 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:53:47] [INFO ] Computed 989 invariants in 260 ms
Interrupted random walk after 855670 steps, including 22939 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Interrupted Best-First random walk after 947803 steps, including 3145 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
[2024-05-25 11:54:22] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:54:23] [INFO ] Computed 989 invariants in 248 ms
[2024-05-25 11:54:23] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 11:54:23] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 208 ms returned sat
[2024-05-25 11:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:54:27] [INFO ] [Real]Absence check using state equation in 3573 ms returned sat
[2024-05-25 11:54:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:54:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 11:54:28] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 233 ms returned sat
[2024-05-25 11:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:54:32] [INFO ] [Nat]Absence check using state equation in 3921 ms returned sat
[2024-05-25 11:54:32] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:54:38] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6294 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 510 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 521 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 11:54:39] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:54:39] [INFO ] Invariant cache hit.
[2024-05-25 11:54:43] [INFO ] Implicit Places using invariants in 3813 ms returned []
Implicit Place search using SMT only with invariants took 3823 ms to find 0 implicit places.
[2024-05-25 11:54:43] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:54:43] [INFO ] Invariant cache hit.
[2024-05-25 11:54:49] [INFO ] Dead Transitions using invariants and state equation in 5707 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10071 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-07 in 72511 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:54:49] [INFO ] Computed 989 invariants in 265 ms
Incomplete random walk after 10000 steps, including 268 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
[2024-05-25 11:54:49] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:54:50] [INFO ] Computed 989 invariants in 253 ms
[2024-05-25 11:54:50] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-05-25 11:54:50] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 209 ms returned sat
[2024-05-25 11:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:54:54] [INFO ] [Real]Absence check using state equation in 3479 ms returned sat
[2024-05-25 11:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:54:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 11:54:55] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 225 ms returned sat
[2024-05-25 11:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:54:59] [INFO ] [Nat]Absence check using state equation in 4121 ms returned sat
[2024-05-25 11:54:59] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:54:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:911)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 514 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:55:00] [INFO ] Computed 989 invariants in 253 ms
Interrupted random walk after 855572 steps, including 22936 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Interrupted Best-First random walk after 956217 steps, including 3173 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
[2024-05-25 11:55:35] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:55:35] [INFO ] Computed 989 invariants in 264 ms
[2024-05-25 11:55:36] [INFO ] [Real]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-05-25 11:55:36] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 232 ms returned sat
[2024-05-25 11:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:55:39] [INFO ] [Real]Absence check using state equation in 3379 ms returned sat
[2024-05-25 11:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:55:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 11:55:40] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 222 ms returned sat
[2024-05-25 11:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:55:44] [INFO ] [Nat]Absence check using state equation in 4146 ms returned sat
[2024-05-25 11:55:44] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:55:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:55:51] [INFO ] [Nat]Added 5602 Read/Feed constraints in 6294 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 520 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 517 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 11:55:52] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:55:52] [INFO ] Invariant cache hit.
[2024-05-25 11:55:55] [INFO ] Implicit Places using invariants in 3799 ms returned []
Implicit Place search using SMT only with invariants took 3806 ms to find 0 implicit places.
[2024-05-25 11:55:55] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:55:55] [INFO ] Invariant cache hit.
[2024-05-25 11:56:02] [INFO ] Dead Transitions using invariants and state equation in 6962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11298 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08 in 73766 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-10
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:56:03] [INFO ] Computed 989 invariants in 247 ms
Incomplete random walk after 10000 steps, including 268 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
[2024-05-25 11:56:03] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:56:03] [INFO ] Computed 989 invariants in 245 ms
[2024-05-25 11:56:04] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 11:56:04] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 219 ms returned sat
[2024-05-25 11:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:56:08] [INFO ] [Real]Absence check using state equation in 3859 ms returned sat
[2024-05-25 11:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:56:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-05-25 11:56:09] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 222 ms returned sat
[2024-05-25 11:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:56:13] [INFO ] [Nat]Absence check using state equation in 4034 ms returned sat
[2024-05-25 11:56:13] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:56:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:911)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 503 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Normalized transition count is 9454 out of 10340 initially.
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:56:14] [INFO ] Computed 989 invariants in 244 ms
Interrupted random walk after 863596 steps, including 23149 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Interrupted Best-First random walk after 935817 steps, including 3105 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen 0
[2024-05-25 11:56:49] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-25 11:56:49] [INFO ] Computed 989 invariants in 260 ms
[2024-05-25 11:56:50] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 11:56:50] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 219 ms returned sat
[2024-05-25 11:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:56:54] [INFO ] [Real]Absence check using state equation in 3813 ms returned sat
[2024-05-25 11:56:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:56:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 11:56:54] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 216 ms returned sat
[2024-05-25 11:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:56:58] [INFO ] [Nat]Absence check using state equation in 4007 ms returned sat
[2024-05-25 11:56:59] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:57:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:57:02] [INFO ] [Nat]Added 5602 Read/Feed constraints in 3479 ms returned sat
[2024-05-25 11:57:07] [INFO ] Deduced a trap composed of 614 places in 4974 ms of which 5 ms to minimize.
[2024-05-25 11:57:13] [INFO ] Deduced a trap composed of 342 places in 5193 ms of which 4 ms to minimize.
[2024-05-25 11:57:18] [INFO ] Deduced a trap composed of 260 places in 5288 ms of which 5 ms to minimize.
[2024-05-25 11:57:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 16647 ms
[2024-05-25 11:57:19] [INFO ] Computed and/alt/rep : 4610/6642/4610 causal constraints (skipped 4819 transitions) in 605 ms.
[2024-05-25 11:57:24] [INFO ] Added : 14 causal constraints over 4 iterations in 5024 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 498 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 503 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-25 11:57:25] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-25 11:57:25] [INFO ] Invariant cache hit.
[2024-05-25 11:57:34] [INFO ] Implicit Places using invariants in 8862 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2511, 2517, 2525, 2535, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2562, 2570, 2576, 2580, 2582, 2584, 2586, 2588, 2590, 2592, 2607, 2613, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2637, 2643, 2651, 2661, 2673, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2704, 2714, 2722, 2728, 2732, 2734, 2736, 2738, 2740, 2742, 2757, 2763, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2773, 2775, 2777, 2779, 2781, 2785, 2791, 2799, 2809, 2821, 2835, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2870, 2882, 2892, 2900, 2906, 2910, 2912, 2914, 2916, 2918, 2933, 2939, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2949, 2951, 2953, 2955, 2959, 2965, 2973, 2983, 2995, 3009, 3025, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3064, 3078, 3090, 3100, 3108, 3114, 3118, 3120, 3122, 3124, 3139, 3145, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3155, 3157, 3159, 3163, 3169, 3177, 3187, 3199, 3213, 3229, 3247, 3266, 3267, 3268, 3269, 3270, 3271, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360, 3362, 3364, 3379, 3385, 3387, 3388, 3389, 3390, 3391, 3392, 3393, 3395, 3397, 3401, 3407, 3415, 3425, 3437, 3451, 3467, 3485, 3505, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3552, 3570, 3586, 3600, 3612, 3622, 3630, 3636, 3640, 3642, 3657, 3659, 3662, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3672, 3676, 3682, 3690, 3700, 3712, 3726, 3742, 3760, 3780, 3802, 3825, 3826, 3827, 3828, 3829, 3830, 3831, 3853, 3873, 3891, 3907, 3921, 3933, 3943, 3951, 3957, 3961, 3976]
Discarding 926 places :
Implicit Place search using SMT only with invariants took 8888 ms to find 926 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3375/4301 places, 10340/10340 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3087 transition count 10052
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3087 transition count 10052
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 2799 transition count 9764
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 2799 transition count 9764
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 2799 transition count 9761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 2796 transition count 9761
Applied a total of 1158 rules in 1285 ms. Remains 2796 /3375 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2024-05-25 11:57:35] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2796 cols
[2024-05-25 11:57:36] [INFO ] Computed 63 invariants in 210 ms
[2024-05-25 11:57:40] [INFO ] Implicit Places using invariants in 4513 ms returned [1373, 1517]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4531 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 452 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 15660 ms. Remains : 2794/4301 places, 9761/10340 transitions.
Normalized transition count is 8875 out of 9761 initially.
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 11:57:41] [INFO ] Computed 61 invariants in 159 ms
Interrupted random walk after 919386 steps, including 26078 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2386 resets, run finished after 3636 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
[2024-05-25 11:58:14] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 11:58:14] [INFO ] Computed 61 invariants in 173 ms
[2024-05-25 11:58:15] [INFO ] [Real]Absence check using 47 positive place invariants in 63 ms returned sat
[2024-05-25 11:58:15] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-25 11:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:58:17] [INFO ] [Real]Absence check using state equation in 2251 ms returned sat
[2024-05-25 11:58:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:58:17] [INFO ] [Nat]Absence check using 47 positive place invariants in 48 ms returned sat
[2024-05-25 11:58:17] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-25 11:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:58:20] [INFO ] [Nat]Absence check using state equation in 2642 ms returned sat
[2024-05-25 11:58:20] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 11:58:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 11:58:24] [INFO ] [Nat]Added 5602 Read/Feed constraints in 4259 ms returned sat
[2024-05-25 11:58:27] [INFO ] Deduced a trap composed of 417 places in 2011 ms of which 3 ms to minimize.
[2024-05-25 11:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2431 ms
[2024-05-25 11:58:28] [INFO ] Computed and/alt/rep : 4550/6592/4550 causal constraints (skipped 4231 transitions) in 738 ms.
[2024-05-25 11:58:29] [INFO ] Added : 13 causal constraints over 3 iterations in 2256 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 468 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 479 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-25 11:58:30] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 11:58:30] [INFO ] Invariant cache hit.
[2024-05-25 11:58:35] [INFO ] Implicit Places using invariants in 4113 ms returned []
[2024-05-25 11:58:35] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 11:58:35] [INFO ] Invariant cache hit.
[2024-05-25 11:58:41] [INFO ] Implicit Places using invariants and state equation in 6331 ms returned []
Implicit Place search using SMT with State Equation took 10467 ms to find 0 implicit places.
[2024-05-25 11:58:42] [INFO ] Redundant transitions in 1414 ms returned []
[2024-05-25 11:58:42] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 11:58:42] [INFO ] Invariant cache hit.
[2024-05-25 11:58:47] [INFO ] Dead Transitions using invariants and state equation in 4877 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17255 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-10 in 164822 ms.
[2024-05-25 11:58:49] [INFO ] Flatten gal took : 1086 ms
[2024-05-25 11:58:49] [INFO ] Applying decomposition
[2024-05-25 11:58:50] [INFO ] Flatten gal took : 636 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16595862253866444469.txt' '-o' '/tmp/graph16595862253866444469.bin' '-w' '/tmp/graph16595862253866444469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16595862253866444469.bin' '-l' '-1' '-v' '-w' '/tmp/graph16595862253866444469.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:58:52] [INFO ] Decomposing Gal with order
[2024-05-25 11:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:58:55] [INFO ] Removed a total of 18604 redundant transitions.
[2024-05-25 11:58:56] [INFO ] Flatten gal took : 3734 ms
[2024-05-25 11:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 6679 labels/synchronizations in 1101 ms.
[2024-05-25 11:58:58] [INFO ] Time to serialize gal into /tmp/UpperBounds9095373918677612231.gal : 224 ms
[2024-05-25 11:58:58] [INFO ] Time to serialize properties into /tmp/UpperBounds5653601230647946424.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9095373918677612231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5653601230647946424.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds5653601230647946424.prop.
Detected timeout of ITS tools.
[2024-05-25 12:23:54] [INFO ] Flatten gal took : 12935 ms
[2024-05-25 12:23:54] [INFO ] Time to serialize gal into /tmp/UpperBounds3806538426101098592.gal : 127 ms
[2024-05-25 12:23:54] [INFO ] Time to serialize properties into /tmp/UpperBounds13398404147696283951.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3806538426101098592.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13398404147696283951.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds13398404147696283951.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135280 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12838484 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="MultiCrashLeafsetExtension-PT-S24C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S24C06, 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 r263-tall-171654371900056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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