Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416600821.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r231-tall-167856416600821
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 10M Mar 5 18:22 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 1679494751018

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 14:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 14:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:19:12] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2023-03-22 14:19:12] [INFO ] Transformed 9748 places.
[2023-03-22 14:19:13] [INFO ] Transformed 14659 transitions.
[2023-03-22 14:19:13] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 14059 out of 14659 initially.
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-22 14:19:14] [INFO ] Computed 921 place invariants in 856 ms
Incomplete random walk after 10000 steps, including 240 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :0
[2023-03-22 14:19:15] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-22 14:19:15] [INFO ] Computed 921 place invariants in 647 ms
[2023-03-22 14:19:16] [INFO ] [Real]Absence check using 62 positive place invariants in 158 ms returned sat
[2023-03-22 14:19:17] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 419 ms returned sat
[2023-03-22 14:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:20] [INFO ] [Real]Absence check using state equation in 3406 ms returned unknown
[2023-03-22 14:19:21] [INFO ] [Real]Absence check using 62 positive place invariants in 149 ms returned sat
[2023-03-22 14:19:21] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 172 ms returned unsat
[2023-03-22 14:19:22] [INFO ] [Real]Absence check using 62 positive place invariants in 137 ms returned sat
[2023-03-22 14:19:23] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 155 ms returned unsat
[2023-03-22 14:19:24] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2023-03-22 14:19:24] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 173 ms returned unsat
[2023-03-22 14:19:25] [INFO ] [Real]Absence check using 62 positive place invariants in 127 ms returned sat
[2023-03-22 14:19:25] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 409 ms returned sat
[2023-03-22 14:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:29] [INFO ] [Real]Absence check using state equation in 3635 ms returned unknown
[2023-03-22 14:19:30] [INFO ] [Real]Absence check using 62 positive place invariants in 126 ms returned sat
[2023-03-22 14:19:30] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 412 ms returned sat
[2023-03-22 14:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:34] [INFO ] [Real]Absence check using state equation in 3655 ms returned unknown
[2023-03-22 14:19:35] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2023-03-22 14:19:35] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 420 ms returned sat
[2023-03-22 14:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:39] [INFO ] [Real]Absence check using state equation in 3659 ms returned unknown
[2023-03-22 14:19:40] [INFO ] [Real]Absence check using 62 positive place invariants in 129 ms returned sat
[2023-03-22 14:19:40] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 171 ms returned unsat
[2023-03-22 14:19:41] [INFO ] [Real]Absence check using 62 positive place invariants in 133 ms returned sat
[2023-03-22 14:19:41] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 277 ms returned unsat
[2023-03-22 14:19:42] [INFO ] [Real]Absence check using 62 positive place invariants in 125 ms returned sat
[2023-03-22 14:19:42] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 430 ms returned sat
[2023-03-22 14:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:46] [INFO ] [Real]Absence check using state equation in 3646 ms returned unknown
[2023-03-22 14:19:47] [INFO ] [Real]Absence check using 62 positive place invariants in 126 ms returned sat
[2023-03-22 14:19:47] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 164 ms returned unsat
[2023-03-22 14:19:48] [INFO ] [Real]Absence check using 62 positive place invariants in 130 ms returned sat
[2023-03-22 14:19:49] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 392 ms returned sat
[2023-03-22 14:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:52] [INFO ] [Real]Absence check using state equation in 3666 ms returned unknown
[2023-03-22 14:19:53] [INFO ] [Real]Absence check using 62 positive place invariants in 129 ms returned sat
[2023-03-22 14:19:54] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 419 ms returned sat
[2023-03-22 14:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:19:57] [INFO ] [Real]Absence check using state equation in 3657 ms returned unknown
[2023-03-22 14:19:58] [INFO ] [Real]Absence check using 62 positive place invariants in 128 ms returned sat
[2023-03-22 14:19:58] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 155 ms returned unsat
[2023-03-22 14:19:59] [INFO ] [Real]Absence check using 62 positive place invariants in 134 ms returned sat
[2023-03-22 14:19:59] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 163 ms returned unsat
[2023-03-22 14:20:00] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2023-03-22 14:20:01] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 434 ms returned sat
[2023-03-22 14:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:20:04] [INFO ] [Real]Absence check using state equation in 3632 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 75, 1, 1, 1] Max seen :[0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0]
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-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 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-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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.33 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2399 place count 9712 transition count 12261
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4798 place count 7314 transition count 12260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 13 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 2198 places :
Symmetric choice reduction at 3 with 2198 rule applications. Total rules 7397 place count 4915 transition count 9862
Iterating global reduction 3 with 2198 rules applied. Total rules applied 9595 place count 4915 transition count 9862
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 9595 place count 4915 transition count 9856
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9607 place count 4909 transition count 9856
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 10155 place count 4361 transition count 7664
Iterating global reduction 3 with 548 rules applied. Total rules applied 10703 place count 4361 transition count 7664
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10753 place count 4336 transition count 7639
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 11091 place count 4336 transition count 8945
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 11429 place count 3998 transition count 8945
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 11479 place count 3998 transition count 8945
Applied a total of 11479 rules in 4331 ms. Remains 3998 /9748 variables (removed 5750) and now considering 8945/14659 (removed 5714) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4334 ms. Remains : 3998/9748 places, 8945/14659 transitions.
Normalized transition count is 8059 out of 8945 initially.
// Phase 1: matrix 8059 rows 3998 cols
[2023-03-22 14:20:09] [INFO ] Computed 885 place invariants in 215 ms
Incomplete random walk after 1000000 steps, including 39716 resets, run finished after 22592 ms. (steps per millisecond=44 ) properties (out of 8) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3503 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3517 ms. (steps per millisecond=284 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3536 ms. (steps per millisecond=282 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3534 ms. (steps per millisecond=282 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3533 ms. (steps per millisecond=283 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3536 ms. (steps per millisecond=282 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3531 ms. (steps per millisecond=283 ) properties (out of 7) seen :1
[2023-03-22 14:20:56] [INFO ] Flow matrix only has 8059 transitions (discarded 886 similar events)
// Phase 1: matrix 8059 rows 3998 cols
[2023-03-22 14:20:57] [INFO ] Computed 885 place invariants in 191 ms
[2023-03-22 14:20:57] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-22 14:20:57] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 192 ms returned sat
[2023-03-22 14:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:00] [INFO ] [Real]Absence check using state equation in 2653 ms returned sat
[2023-03-22 14:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-22 14:21:01] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 194 ms returned sat
[2023-03-22 14:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:04] [INFO ] [Nat]Absence check using state equation in 3016 ms returned sat
[2023-03-22 14:21:04] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-22 14:21:05] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1039 ms returned unsat
[2023-03-22 14:21:05] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 14:21:06] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 206 ms returned sat
[2023-03-22 14:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:08] [INFO ] [Real]Absence check using state equation in 2987 ms returned sat
[2023-03-22 14:21:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-22 14:21:09] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 202 ms returned sat
[2023-03-22 14:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:12] [INFO ] [Nat]Absence check using state equation in 2988 ms returned sat
[2023-03-22 14:21:13] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1113 ms returned unsat
[2023-03-22 14:21:14] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-22 14:21:14] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 202 ms returned sat
[2023-03-22 14:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:17] [INFO ] [Real]Absence check using state equation in 2826 ms returned sat
[2023-03-22 14:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:17] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 14:21:18] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 197 ms returned sat
[2023-03-22 14:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:21] [INFO ] [Nat]Absence check using state equation in 3034 ms returned sat
[2023-03-22 14:21:22] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1335 ms returned unsat
[2023-03-22 14:21:22] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2023-03-22 14:21:23] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 204 ms returned sat
[2023-03-22 14:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:26] [INFO ] [Real]Absence check using state equation in 3165 ms returned sat
[2023-03-22 14:21:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 14:21:27] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 197 ms returned sat
[2023-03-22 14:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:30] [INFO ] [Nat]Absence check using state equation in 3133 ms returned sat
[2023-03-22 14:21:31] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1006 ms returned unsat
[2023-03-22 14:21:31] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-22 14:21:31] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 195 ms returned sat
[2023-03-22 14:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:34] [INFO ] [Real]Absence check using state equation in 2956 ms returned sat
[2023-03-22 14:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-22 14:21:35] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 196 ms returned sat
[2023-03-22 14:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:38] [INFO ] [Nat]Absence check using state equation in 3326 ms returned sat
[2023-03-22 14:21:40] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1925 ms returned unsat
[2023-03-22 14:21:41] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2023-03-22 14:21:41] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 52 ms returned unsat
[2023-03-22 14:21:41] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2023-03-22 14:21:41] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 189 ms returned sat
[2023-03-22 14:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:44] [INFO ] [Real]Absence check using state equation in 3063 ms returned sat
[2023-03-22 14:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:21:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-22 14:21:45] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 193 ms returned sat
[2023-03-22 14:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:21:48] [INFO ] [Nat]Absence check using state equation in 2836 ms returned sat
[2023-03-22 14:21:51] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2825 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 1, 0] Max seen :[0, 0, 0, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 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-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 158906 ms.
ITS solved all properties within timeout

BK_STOP 1679494912270

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r231-tall-167856416600821"
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 ;