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.r508-tall-171654350800077.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 MultiCrashLeafsetExtension-PT-S24C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 12 06:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 06:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 06:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 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 10M 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-S24C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717201503194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:25:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:25:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:25:05] [INFO ] Load time of PNML (sax parser for PT used): 613 ms
[2024-06-01 00:25:05] [INFO ] Transformed 9748 places.
[2024-06-01 00:25:05] [INFO ] Transformed 14659 transitions.
[2024-06-01 00:25:05] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 800 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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]
[2024-06-01 00:25:05] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2024-06-01 00:25:06] [INFO ] Computed 921 invariants in 940 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:[1, 25, 75, 25, 1, 1, 25, 1, 1, 75, 25, 75, 25, 25, 25, 25]
RANDOM walk for 10000 steps (240 resets) in 272 ms. (36 steps per ms)
BEST_FIRST walk for 160015 steps (704 resets) in 681 ms. (234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0] Max Struct:[1, 25, 75, 25, 1, 1, 25, 1, 1, 75, 25, 75, 25, 25, 25, 25]
[2024-06-01 00:25:07] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
[2024-06-01 00:25:07] [INFO ] Invariant cache hit.
[2024-06-01 00:25:08] [INFO ] [Real]Absence check using 62 positive place invariants in 214 ms returned sat
[2024-06-01 00:25:09] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 376 ms returned sat
[2024-06-01 00:25:12] [INFO ] [Real]Absence check using state equation in 3360 ms returned unknown
[2024-06-01 00:25:13] [INFO ] [Real]Absence check using 62 positive place invariants in 172 ms returned sat
[2024-06-01 00:25:13] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 124 ms returned unsat
[2024-06-01 00:25:14] [INFO ] [Real]Absence check using 62 positive place invariants in 170 ms returned sat
[2024-06-01 00:25:15] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 347 ms returned sat
[2024-06-01 00:25:18] [INFO ] [Real]Absence check using state equation in 3580 ms returned unknown
[2024-06-01 00:25:19] [INFO ] [Real]Absence check using 62 positive place invariants in 165 ms returned sat
[2024-06-01 00:25:19] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 125 ms returned unsat
[2024-06-01 00:25:20] [INFO ] [Real]Absence check using 62 positive place invariants in 170 ms returned sat
[2024-06-01 00:25:21] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 341 ms returned sat
[2024-06-01 00:25:24] [INFO ] [Real]Absence check using state equation in 3648 ms returned unknown
[2024-06-01 00:25:25] [INFO ] [Real]Absence check using 62 positive place invariants in 162 ms returned sat
[2024-06-01 00:25:26] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 340 ms returned sat
[2024-06-01 00:25:29] [INFO ] [Real]Absence check using state equation in 3622 ms returned unknown
[2024-06-01 00:25:30] [INFO ] [Real]Absence check using 62 positive place invariants in 191 ms returned sat
[2024-06-01 00:25:31] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 115 ms returned unsat
[2024-06-01 00:25:32] [INFO ] [Real]Absence check using 62 positive place invariants in 165 ms returned sat
[2024-06-01 00:25:32] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 336 ms returned sat
[2024-06-01 00:25:36] [INFO ] [Real]Absence check using state equation in 3621 ms returned unknown
[2024-06-01 00:25:37] [INFO ] [Real]Absence check using 62 positive place invariants in 162 ms returned sat
[2024-06-01 00:25:37] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 335 ms returned sat
[2024-06-01 00:25:41] [INFO ] [Real]Absence check using state equation in 3655 ms returned unknown
[2024-06-01 00:25:42] [INFO ] [Real]Absence check using 62 positive place invariants in 163 ms returned sat
[2024-06-01 00:25:42] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 269 ms returned unsat
[2024-06-01 00:25:43] [INFO ] [Real]Absence check using 62 positive place invariants in 161 ms returned sat
[2024-06-01 00:25:43] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 119 ms returned unsat
[2024-06-01 00:25:44] [INFO ] [Real]Absence check using 62 positive place invariants in 166 ms returned sat
[2024-06-01 00:25:45] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 342 ms returned sat
[2024-06-01 00:25:48] [INFO ] [Real]Absence check using state equation in 3633 ms returned unknown
[2024-06-01 00:25:49] [INFO ] [Real]Absence check using 62 positive place invariants in 167 ms returned sat
[2024-06-01 00:25:49] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 123 ms returned unsat
[2024-06-01 00:25:50] [INFO ] [Real]Absence check using 62 positive place invariants in 163 ms returned sat
[2024-06-01 00:25:50] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 115 ms returned unsat
[2024-06-01 00:25:52] [INFO ] [Real]Absence check using 62 positive place invariants in 161 ms returned sat
[2024-06-01 00:25:52] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 122 ms returned unsat
[2024-06-01 00:25:53] [INFO ] [Real]Absence check using 62 positive place invariants in 163 ms returned sat
[2024-06-01 00:25:53] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 350 ms returned sat
[2024-06-01 00:25:57] [INFO ] [Real]Absence check using state equation in 3636 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0] Max Struct:[1, 1, 75, 1, 1, 1, 1, 1, 1, 1, 1, 75, 1, 1, 1, 25]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 75, 1, 1, 1, 1, 75, 25]
Support contains 8 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.37 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2398 place count 9712 transition count 12262
Reduce places removed 2397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 7315 transition count 12260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4799 place count 7313 transition count 12260
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4799 place count 7313 transition count 12060
Deduced a syphon composed of 200 places in 8 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5199 place count 7113 transition count 12060
Discarding 2197 places :
Symmetric choice reduction at 3 with 2197 rule applications. Total rules 7396 place count 4916 transition count 9863
Iterating global reduction 3 with 2197 rules applied. Total rules applied 9593 place count 4916 transition count 9863
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 9593 place count 4916 transition count 9857
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9605 place count 4910 transition count 9857
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 10152 place count 4363 transition count 7669
Iterating global reduction 3 with 547 rules applied. Total rules applied 10699 place count 4363 transition count 7669
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 13 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10749 place count 4338 transition count 7644
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 3 with 339 rules applied. Total rules applied 11088 place count 4338 transition count 8946
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 3 with 339 rules applied. Total rules applied 11427 place count 3999 transition count 8946
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 11477 place count 3999 transition count 8946
Applied a total of 11477 rules in 4563 ms. Remains 3999 /9748 variables (removed 5749) and now considering 8946/14659 (removed 5713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4580 ms. Remains : 3999/9748 places, 8946/14659 transitions.
[2024-06-01 00:26:01] [INFO ] Flow matrix only has 8060 transitions (discarded 886 similar events)
// Phase 1: matrix 8060 rows 3999 cols
[2024-06-01 00:26:02] [INFO ] Computed 885 invariants in 222 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 1, 1, 1, 1, 2, 1]
RANDOM walk for 1000000 steps (39705 resets) in 23420 ms. (42 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (33460 resets) in 26230 ms. (266 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 1] Max Struct:[1, 2, 1, 1, 1, 1, 2]
[2024-06-01 00:26:51] [INFO ] Flow matrix only has 8060 transitions (discarded 886 similar events)
[2024-06-01 00:26:51] [INFO ] Invariant cache hit.
[2024-06-01 00:26:52] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-06-01 00:26:52] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 172 ms returned sat
[2024-06-01 00:26:56] [INFO ] [Real]Absence check using state equation in 3988 ms returned sat
[2024-06-01 00:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-06-01 00:26:57] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 169 ms returned sat
[2024-06-01 00:27:01] [INFO ] [Nat]Absence check using state equation in 3886 ms returned sat
[2024-06-01 00:27:01] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2024-06-01 00:27:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:27:05] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4848 ms returned unsat
[2024-06-01 00:27:06] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-06-01 00:27:06] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 161 ms returned unsat
[2024-06-01 00:27:06] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-06-01 00:27:07] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 175 ms returned sat
[2024-06-01 00:27:10] [INFO ] [Real]Absence check using state equation in 3230 ms returned sat
[2024-06-01 00:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:27:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2024-06-01 00:27:11] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 158 ms returned sat
[2024-06-01 00:27:14] [INFO ] [Nat]Absence check using state equation in 3174 ms returned sat
[2024-06-01 00:27:19] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4580 ms returned unsat
[2024-06-01 00:27:19] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-06-01 00:27:19] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 163 ms returned sat
[2024-06-01 00:27:22] [INFO ] [Real]Absence check using state equation in 3021 ms returned sat
[2024-06-01 00:27:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:27:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-06-01 00:27:23] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 173 ms returned sat
[2024-06-01 00:27:26] [INFO ] [Nat]Absence check using state equation in 3161 ms returned sat
[2024-06-01 00:27:31] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4482 ms returned unsat
[2024-06-01 00:27:31] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-06-01 00:27:31] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 175 ms returned sat
[2024-06-01 00:27:34] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2024-06-01 00:27:35] [INFO ] [Real]Added 4402 Read/Feed constraints in 481 ms returned unsat
[2024-06-01 00:27:35] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2024-06-01 00:27:35] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 162 ms returned sat
[2024-06-01 00:27:38] [INFO ] [Real]Absence check using state equation in 2840 ms returned sat
[2024-06-01 00:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:27:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-06-01 00:27:39] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 167 ms returned sat
[2024-06-01 00:27:42] [INFO ] [Nat]Absence check using state equation in 3001 ms returned sat
[2024-06-01 00:27:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:27:47] [INFO ] [Nat]Added 4402 Read/Feed constraints in 4936 ms returned unsat
[2024-06-01 00:27:47] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-06-01 00:27:47] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 166 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 1] Max Struct:[0, 1, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00 0 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 10 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 163423 ms.
ITS solved all properties within timeout

BK_STOP 1717201667861

--------------------
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="MultiCrashLeafsetExtension-PT-S24C04"
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 MultiCrashLeafsetExtension-PT-S24C04, 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 r508-tall-171654350800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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