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.r520-tall-171662337800109.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 QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K 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 QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717221863238

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:04:24] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-06-01 06:04:24] [INFO ] Transformed 3806 places.
[2024-06-01 06:04:24] [INFO ] Transformed 506 transitions.
[2024-06-01 06:04:24] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+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, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 506 rows 3806 cols
[2024-06-01 06:04:24] [INFO ] Computed 3301 invariants in 183 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, +inf, 1089, 1, 1, 1089, 1, 1, 33, 33, 19, +inf, +inf]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (267 resets) in 106 ms. (93 steps per ms)
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (125 resets) in 266 ms. (449 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, +inf, 1089, 1089, 1, 1, 33, 33, +inf, +inf]
[2024-06-01 06:04:25] [INFO ] Invariant cache hit.
[2024-06-01 06:04:25] [INFO ] [Real]Absence check using 3 positive place invariants in 52 ms returned sat
[2024-06-01 06:04:26] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 673 ms returned sat
[2024-06-01 06:04:28] [INFO ] [Real]Absence check using state equation in 2262 ms returned sat
[2024-06-01 06:04:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:04:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 55 ms returned sat
[2024-06-01 06:04:30] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 707 ms returned sat
[2024-06-01 06:04:31] [INFO ] [Nat]Absence check using state equation in 1791 ms returned sat
[2024-06-01 06:04:32] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 51 ms.
[2024-06-01 06:04:33] [INFO ] Added : 74 causal constraints over 15 iterations in 1530 ms. Result :sat
Minimization took 453 ms.
[2024-06-01 06:04:34] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned sat
[2024-06-01 06:04:35] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 706 ms returned sat
[2024-06-01 06:04:37] [INFO ] [Real]Absence check using state equation in 1936 ms returned sat
[2024-06-01 06:04:37] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 44 ms.
[2024-06-01 06:04:38] [INFO ] Added : 49 causal constraints over 10 iterations in 1062 ms. Result :sat
Minimization took 551 ms.
[2024-06-01 06:04:39] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned sat
[2024-06-01 06:04:40] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 691 ms returned sat
[2024-06-01 06:04:42] [INFO ] [Real]Absence check using state equation in 2000 ms returned sat
[2024-06-01 06:04:42] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2024-06-01 06:04:43] [INFO ] Added : 80 causal constraints over 16 iterations in 1602 ms. Result :sat
Minimization took 93 ms.
[2024-06-01 06:04:44] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2024-06-01 06:04:45] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 612 ms returned sat
[2024-06-01 06:04:48] [INFO ] [Real]Absence check using state equation in 3408 ms returned sat
[2024-06-01 06:04:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:04:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 45 ms returned sat
[2024-06-01 06:04:49] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 682 ms returned sat
[2024-06-01 06:04:51] [INFO ] [Nat]Absence check using state equation in 2327 ms returned sat
[2024-06-01 06:04:52] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2024-06-01 06:04:52] [INFO ] Added : 42 causal constraints over 9 iterations in 865 ms. Result :sat
Minimization took 550 ms.
[2024-06-01 06:04:53] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2024-06-01 06:04:54] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 673 ms returned sat
[2024-06-01 06:04:56] [INFO ] [Real]Absence check using state equation in 2213 ms returned sat
[2024-06-01 06:04:56] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 44 ms.
[2024-06-01 06:04:58] [INFO ] Added : 72 causal constraints over 15 iterations in 1546 ms. Result :unknown
[2024-06-01 06:04:58] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2024-06-01 06:04:59] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 625 ms returned sat
[2024-06-01 06:05:03] [INFO ] [Real]Absence check using state equation in 3636 ms returned sat
[2024-06-01 06:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:05:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 41 ms returned sat
[2024-06-01 06:05:04] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 657 ms returned sat
[2024-06-01 06:05:07] [INFO ] [Nat]Absence check using state equation in 3683 ms returned sat
[2024-06-01 06:05:08] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 06:05:08] [INFO ] [Real]Absence check using 3 positive place invariants in 47 ms returned sat
[2024-06-01 06:05:09] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 664 ms returned sat
[2024-06-01 06:05:11] [INFO ] [Real]Absence check using state equation in 1826 ms returned sat
[2024-06-01 06:05:11] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 32 ms.
[2024-06-01 06:05:12] [INFO ] Added : 38 causal constraints over 8 iterations in 852 ms. Result :sat
Minimization took 546 ms.
[2024-06-01 06:05:13] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2024-06-01 06:05:13] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 681 ms returned sat
[2024-06-01 06:05:15] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2024-06-01 06:05:15] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 37 ms.
[2024-06-01 06:05:17] [INFO ] Added : 67 causal constraints over 14 iterations in 1465 ms. Result :sat
Minimization took 314 ms.
[2024-06-01 06:05:18] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2024-06-01 06:05:18] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 675 ms returned sat
[2024-06-01 06:05:20] [INFO ] [Real]Absence check using state equation in 2137 ms returned sat
[2024-06-01 06:05:21] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 20 ms to minimize.
[2024-06-01 06:05:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:05:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 39 ms returned sat
[2024-06-01 06:05:22] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 682 ms returned sat
[2024-06-01 06:05:24] [INFO ] [Nat]Absence check using state equation in 2272 ms returned sat
[2024-06-01 06:05:24] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:05:25] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:05:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2024-06-01 06:05:25] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2024-06-01 06:05:26] [INFO ] Added : 70 causal constraints over 14 iterations in 1185 ms. Result :unknown
[2024-06-01 06:05:26] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned sat
[2024-06-01 06:05:27] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 650 ms returned sat
[2024-06-01 06:05:29] [INFO ] [Real]Absence check using state equation in 2046 ms returned sat
[2024-06-01 06:05:29] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 44 ms.
[2024-06-01 06:05:31] [INFO ] Added : 81 causal constraints over 17 iterations in 1744 ms. Result :sat
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 06:05:31] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2024-06-01 06:05:33] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 1280 ms returned sat
[2024-06-01 06:05:36] [INFO ] [Real]Absence check using state equation in 3361 ms returned unknown
[2024-06-01 06:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2024-06-01 06:05:37] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 684 ms returned sat
[2024-06-01 06:05:39] [INFO ] [Real]Absence check using state equation in 1817 ms returned sat
[2024-06-01 06:05:39] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 40 ms.
[2024-06-01 06:05:41] [INFO ] Added : 105 causal constraints over 21 iterations in 1962 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, +inf, 1089, 1089, 1, 1, 33, 33, +inf, +inf]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[33, 33, 33, 33, 1, 1, 1, 1] Max Struct:[+inf, +inf, 1089, 1089, 33, 33, +inf, +inf]
Support contains 135 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2613 are kept as prefixes of interest. Removing 1193 places using SCC suffix rule.20 ms
Discarding 1193 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 transitions
Drop transitions (Empty/Sink Transition effects.) removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 2547 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 270 place count 2546 transition count 269
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 270 place count 2546 transition count 203
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 467 place count 2415 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 467 place count 2415 transition count 202
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 470 place count 2413 transition count 202
Applied a total of 470 rules in 418 ms. Remains 2413 /3806 variables (removed 1393) and now considering 202/506 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 2413/3806 places, 202/506 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 202 rows 2413 cols
[2024-06-01 06:05:42] [INFO ] Computed 2211 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[33, 33, 33, 33, 1, 1, 1, 1] Max Struct:[65, 65, 1089, 59, 3, 33, 1, 3]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (7836 resets) in 17925 ms. (55 steps per ms)
BEST_FIRST walk for 3754121 steps (1400 resets) in 35007 ms. (107 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 33, 33, 33, 1, 1, 1] Max Struct:[65, 65, 1089, 59, 3, 33, 3]
[2024-06-01 06:06:35] [INFO ] Invariant cache hit.
[2024-06-01 06:06:36] [INFO ] [Real]Absence check using 1089 positive place invariants in 236 ms returned sat
[2024-06-01 06:06:36] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 261 ms returned unsat
[2024-06-01 06:06:37] [INFO ] [Real]Absence check using 1089 positive place invariants in 224 ms returned sat
[2024-06-01 06:06:37] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 263 ms returned unsat
[2024-06-01 06:06:37] [INFO ] [Real]Absence check using 1089 positive place invariants in 208 ms returned sat
[2024-06-01 06:06:38] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 225 ms returned sat
[2024-06-01 06:06:38] [INFO ] [Real]Absence check using state equation in 106 ms returned unsat
[2024-06-01 06:06:38] [INFO ] [Real]Absence check using 1089 positive place invariants in 210 ms returned sat
[2024-06-01 06:06:39] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 729 ms returned unsat
[2024-06-01 06:06:39] [INFO ] [Real]Absence check using 1089 positive place invariants in 210 ms returned sat
[2024-06-01 06:06:39] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 18 ms returned unsat
[2024-06-01 06:06:40] [INFO ] [Real]Absence check using 1089 positive place invariants in 211 ms returned sat
[2024-06-01 06:06:40] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 222 ms returned sat
[2024-06-01 06:06:40] [INFO ] [Real]Absence check using state equation in 367 ms returned unsat
[2024-06-01 06:06:41] [INFO ] [Real]Absence check using 1089 positive place invariants in 205 ms returned sat
[2024-06-01 06:06:41] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 139 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[33, 33, 33, 33, 1, 1, 1] Max Struct:[33, 33, 33, 33, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 33 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 5 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 136989 ms.
ITS solved all properties within timeout

BK_STOP 1717222001397

--------------------
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="QuasiCertifProtocol-PT-32"
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 QuasiCertifProtocol-PT-32, 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 r520-tall-171662337800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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