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.r500-smll-171649588000357.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 ltsminxred
Input is IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 10K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717286595169

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 00:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:03:17] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-02 00:03:17] [INFO ] Transformed 273 places.
[2024-06-02 00:03:17] [INFO ] Transformed 179 transitions.
[2024-06-02 00:03:17] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 179 rows 273 cols
[2024-06-02 00:03:18] [INFO ] Computed 101 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[100, +inf, 100, 300, 900, 100, 100, 100, 24, 100, 100, 100, +inf, 100, 100, 100]
RANDOM walk for 10000 steps (37 resets) in 54 ms. (181 steps per ms)
BEST_FIRST walk for 160014 steps (103 resets) in 348 ms. (458 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 2, 6, 1, 1, 7, 5, 2, 1, 7, 7, 6, 2, 7, 7, 6] Max Struct:[100, +inf, 100, 300, 900, 100, 100, 100, 24, 100, 100, 100, +inf, 100, 100, 100]
[2024-06-02 00:03:18] [INFO ] Invariant cache hit.
[2024-06-02 00:03:18] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-06-02 00:03:19] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 62 ms returned sat
[2024-06-02 00:03:19] [INFO ] [Real]Absence check using state equation in 137 ms returned unsat
[2024-06-02 00:03:19] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 00:03:19] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 30 ms returned sat
[2024-06-02 00:03:19] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-02 00:03:19] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 42 ms.
[2024-06-02 00:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-06-02 00:03:20] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 29 ms returned sat
[2024-06-02 00:03:20] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-02 00:03:20] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-02 00:03:21] [INFO ] Added : 119 causal constraints over 24 iterations in 612 ms. Result :sat
Minimization took 267 ms.
[2024-06-02 00:03:21] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:21] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2024-06-02 00:03:21] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-06-02 00:03:21] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-02 00:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 00:03:22] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2024-06-02 00:03:22] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-06-02 00:03:22] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 41 ms.
[2024-06-02 00:03:22] [INFO ] Added : 103 causal constraints over 22 iterations in 556 ms. Result :sat
Minimization took 136 ms.
[2024-06-02 00:03:23] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2024-06-02 00:03:23] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-06-02 00:03:23] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-02 00:03:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:23] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2024-06-02 00:03:24] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-06-02 00:03:24] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-02 00:03:24] [INFO ] Added : 116 causal constraints over 24 iterations in 671 ms. Result :sat
Minimization took 190 ms.
[2024-06-02 00:03:25] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:25] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 48 ms returned sat
[2024-06-02 00:03:25] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-02 00:03:25] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-02 00:03:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:25] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2024-06-02 00:03:26] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 00:03:26] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-02 00:03:26] [INFO ] Added : 129 causal constraints over 26 iterations in 718 ms. Result :sat
Minimization took 246 ms.
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using state equation in 154 ms returned unsat
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2024-06-02 00:03:27] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-06-02 00:03:27] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-02 00:03:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:28] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2024-06-02 00:03:28] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 00:03:28] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-02 00:03:28] [INFO ] Added : 39 causal constraints over 8 iterations in 227 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 00:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 00:03:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 41 ms returned sat
[2024-06-02 00:03:29] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-02 00:03:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-02 00:03:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2024-06-02 00:03:29] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-02 00:03:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-02 00:03:30] [INFO ] Added : 139 causal constraints over 28 iterations in 760 ms. Result :sat
Minimization took 212 ms.
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 49 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using state equation in 140 ms returned unsat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 43 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using state equation in 166 ms returned unsat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using state equation in 149 ms returned unsat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 41 ms returned sat
[2024-06-02 00:03:32] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-02 00:03:32] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-02 00:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:32] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2024-06-02 00:03:32] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-06-02 00:03:32] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-02 00:03:32] [INFO ] Added : 42 causal constraints over 9 iterations in 266 ms. Result :sat
Minimization took 156 ms.
[2024-06-02 00:03:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-02 00:03:33] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 23 ms returned sat
[2024-06-02 00:03:33] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 00:03:33] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-02 00:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 00:03:33] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 46 ms returned sat
[2024-06-02 00:03:34] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-02 00:03:34] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-02 00:03:34] [INFO ] Added : 119 causal constraints over 24 iterations in 510 ms. Result :sat
Minimization took 163 ms.
[2024-06-02 00:03:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-02 00:03:34] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 29 ms returned sat
[2024-06-02 00:03:34] [INFO ] [Real]Absence check using state equation in 112 ms returned unsat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 28 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using state equation in 96 ms returned unsat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 30 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-02 00:03:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-02 00:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 00:03:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 27 ms returned sat
[2024-06-02 00:03:35] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-06-02 00:03:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-02 00:03:35] [INFO ] Added : 32 causal constraints over 7 iterations in 130 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 2, 6, 1, 1, 7, 5, 2, 1, 7, 7, 6, 2, 7, 7, 6] Max Struct:[7, +inf, 100, 300, 900, 7, 100, 100, 1, 7, 7, 100, +inf, 7, 7, 100]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 7, 3, 3, 7, 5, 7, 7, 7] Max Struct:[+inf, 100, 300, 900, 100, 100, 100, +inf, 100]
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 224 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Ensure Unique test removed 82 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 113 edges and 142 vertex of which 20 / 142 are part of one of the 1 SCC in 4 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 123 transition count 85
Reduce places removed 58 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 87 rules applied. Total rules applied 236 place count 65 transition count 56
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 9 rules applied. Total rules applied 245 place count 61 transition count 51
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 250 place count 56 transition count 51
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 250 place count 56 transition count 34
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 285 place count 38 transition count 34
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 290 place count 33 transition count 29
Iterating global reduction 4 with 5 rules applied. Total rules applied 295 place count 33 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 303 place count 28 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 304 place count 27 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 305 place count 27 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 26 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 26 transition count 24
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 309 place count 26 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 25 transition count 23
Applied a total of 310 rules in 81 ms. Remains 25 /273 variables (removed 248) and now considering 23/179 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 25/273 places, 23/179 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 23 rows 25 cols
[2024-06-02 00:03:36] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 7, 3, 3, 7, 5, 7, 7, 7] Max Struct:[+inf, 100, 300, 900, 100, 100, 100, +inf, 100]
RANDOM walk for 1000003 steps (20144 resets) in 325 ms. (3067 steps per ms)
BEST_FIRST walk for 9000009 steps (43031 resets) in 3447 ms. (2610 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 3, 3, 7, 5, 7, 7, 7] Max Struct:[+inf, 100, 300, 900, 100, 100, 100, +inf, 100]
[2024-06-02 00:03:40] [INFO ] Invariant cache hit.
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:40] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-06-02 00:03:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 00:03:41] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 3, 3, 7, 5, 7, 7, 7] Max Struct:[7, 7, 3, 3, 7, 5, 7, 7, 7]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23525 ms.
ITS solved all properties within timeout

BK_STOP 1717286621095

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is IBMB2S565S3960-PT-none, 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 r500-smll-171649588000357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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