fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r231-tall-167856416700901
Last Updated
May 14, 2023

About the Execution of LoLa+red for MultiCrashLeafsetExtension-PT-S32C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2249.147 255258.00 284052.00 723.40 1 0 1 0 1 0 1 1 0 0 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416700901.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-S32C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416700901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 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 18M 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-S32C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679511024018

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-S32C03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 18:50:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 18:50:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:50:26] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2023-03-22 18:50:26] [INFO ] Transformed 15862 places.
[2023-03-22 18:50:26] [INFO ] Transformed 25109 transitions.
[2023-03-22 18:50:26] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 723 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 24053 out of 25109 initially.
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-22 18:50:28] [INFO ] Computed 1403 place invariants in 1977 ms
Incomplete random walk after 10000 steps, including 319 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 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 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :2
[2023-03-22 18:50:29] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-22 18:50:31] [INFO ] Computed 1403 place invariants in 1829 ms
[2023-03-22 18:50:33] [INFO ] [Real]Absence check using 76 positive place invariants in 397 ms returned sat
[2023-03-22 18:50:34] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 592 ms returned unsat
[2023-03-22 18:50:35] [INFO ] [Real]Absence check using 76 positive place invariants in 385 ms returned sat
[2023-03-22 18:50:36] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 858 ms returned sat
[2023-03-22 18:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:50:39] [INFO ] [Real]Absence check using state equation in 2301 ms returned unknown
[2023-03-22 18:50:40] [INFO ] [Real]Absence check using 76 positive place invariants in 366 ms returned sat
[2023-03-22 18:50:41] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 596 ms returned unsat
[2023-03-22 18:50:43] [INFO ] [Real]Absence check using 76 positive place invariants in 368 ms returned sat
[2023-03-22 18:50:44] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 814 ms returned sat
[2023-03-22 18:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:50:46] [INFO ] [Real]Absence check using state equation in 2408 ms returned unknown
[2023-03-22 18:50:48] [INFO ] [Real]Absence check using 76 positive place invariants in 385 ms returned sat
[2023-03-22 18:50:48] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 624 ms returned unsat
[2023-03-22 18:50:50] [INFO ] [Real]Absence check using 76 positive place invariants in 374 ms returned sat
[2023-03-22 18:50:51] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 805 ms returned sat
[2023-03-22 18:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:50:53] [INFO ] [Real]Absence check using state equation in 2450 ms returned unknown
[2023-03-22 18:50:55] [INFO ] [Real]Absence check using 76 positive place invariants in 364 ms returned sat
[2023-03-22 18:50:56] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 553 ms returned unsat
[2023-03-22 18:50:58] [INFO ] [Real]Absence check using 76 positive place invariants in 375 ms returned sat
[2023-03-22 18:50:58] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 590 ms returned unsat
[2023-03-22 18:51:00] [INFO ] [Real]Absence check using 76 positive place invariants in 367 ms returned sat
[2023-03-22 18:51:01] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 844 ms returned sat
[2023-03-22 18:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:51:03] [INFO ] [Real]Absence check using state equation in 2394 ms returned unknown
[2023-03-22 18:51:05] [INFO ] [Real]Absence check using 76 positive place invariants in 361 ms returned sat
[2023-03-22 18:51:06] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 851 ms returned sat
[2023-03-22 18:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:51:08] [INFO ] [Real]Absence check using state equation in 2392 ms returned unknown
[2023-03-22 18:51:10] [INFO ] [Real]Absence check using 76 positive place invariants in 357 ms returned sat
[2023-03-22 18:51:11] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 827 ms returned sat
[2023-03-22 18:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:51:13] [INFO ] [Real]Absence check using state equation in 2420 ms returned unknown
[2023-03-22 18:51:15] [INFO ] [Real]Absence check using 76 positive place invariants in 367 ms returned sat
[2023-03-22 18:51:16] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 603 ms returned unsat
[2023-03-22 18:51:17] [INFO ] [Real]Absence check using 76 positive place invariants in 372 ms returned sat
[2023-03-22 18:51:18] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 600 ms returned unsat
[2023-03-22 18:51:20] [INFO ] [Real]Absence check using 76 positive place invariants in 362 ms returned sat
[2023-03-22 18:51:20] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 603 ms returned unsat
[2023-03-22 18:51:22] [INFO ] [Real]Absence check using 76 positive place invariants in 366 ms returned sat
[2023-03-22 18:51:23] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 607 ms returned unsat
[2023-03-22 18:51:25] [INFO ] [Real]Absence check using 76 positive place invariants in 359 ms returned sat
[2023-03-22 18:51:25] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 614 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 99, 1, 1, 1, 1, 1] Max seen :[1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.50 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3167 transitions
Trivial Post-agglo rules discarded 3167 transitions
Performed 3167 trivial Post agglomeration. Transition count delta: 3167
Iterating post reduction 0 with 3167 rules applied. Total rules applied 3168 place count 15820 transition count 21942
Reduce places removed 3167 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3168 rules applied. Total rules applied 6336 place count 12653 transition count 21941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6337 place count 12652 transition count 21941
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 6337 place count 12652 transition count 21743
Deduced a syphon composed of 198 places in 26 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 6733 place count 12454 transition count 21743
Discarding 2969 places :
Symmetric choice reduction at 3 with 2969 rule applications. Total rules 9702 place count 9485 transition count 18774
Iterating global reduction 3 with 2969 rules applied. Total rules applied 12671 place count 9485 transition count 18774
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12671 place count 9485 transition count 18769
Deduced a syphon composed of 5 places in 16 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 12681 place count 9480 transition count 18769
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 13670 place count 8491 transition count 15802
Iterating global reduction 3 with 989 rules applied. Total rules applied 14659 place count 8491 transition count 15802
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 22 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 14725 place count 8458 transition count 15769
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 15302 place count 8458 transition count 17170
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 15879 place count 7881 transition count 17170
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 15912 place count 7881 transition count 17170
Applied a total of 15912 rules in 15217 ms. Remains 7881 /15862 variables (removed 7981) and now considering 17170/25109 (removed 7939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15222 ms. Remains : 7881/15862 places, 17170/25109 transitions.
Normalized transition count is 15604 out of 17170 initially.
// Phase 1: matrix 15604 rows 7881 cols
[2023-03-22 18:51:41] [INFO ] Computed 1361 place invariants in 698 ms
Interrupted random walk after 871153 steps, including 45616 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4422 ms. (steps per millisecond=226 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4344 ms. (steps per millisecond=230 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4253 ms. (steps per millisecond=235 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4306 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4278 ms. (steps per millisecond=233 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4339 ms. (steps per millisecond=230 ) properties (out of 6) seen :1
[2023-03-22 18:52:37] [INFO ] Flow matrix only has 15604 transitions (discarded 1566 similar events)
// Phase 1: matrix 15604 rows 7881 cols
[2023-03-22 18:52:38] [INFO ] Computed 1361 place invariants in 645 ms
[2023-03-22 18:52:39] [INFO ] [Real]Absence check using 65 positive place invariants in 182 ms returned sat
[2023-03-22 18:52:39] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 457 ms returned sat
[2023-03-22 18:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:52:49] [INFO ] [Real]Absence check using state equation in 9938 ms returned sat
[2023-03-22 18:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:52:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 194 ms returned sat
[2023-03-22 18:52:51] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 439 ms returned sat
[2023-03-22 18:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:02] [INFO ] [Nat]Absence check using state equation in 10391 ms returned sat
[2023-03-22 18:53:02] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-22 18:53:03] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1517 ms returned unsat
[2023-03-22 18:53:04] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2023-03-22 18:53:04] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 426 ms returned sat
[2023-03-22 18:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:13] [INFO ] [Real]Absence check using state equation in 8742 ms returned sat
[2023-03-22 18:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:53:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-22 18:53:15] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 409 ms returned sat
[2023-03-22 18:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:24] [INFO ] [Nat]Absence check using state equation in 9161 ms returned sat
[2023-03-22 18:53:25] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1385 ms returned unsat
[2023-03-22 18:53:26] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-22 18:53:27] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2023-03-22 18:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:36] [INFO ] [Real]Absence check using state equation in 9510 ms returned sat
[2023-03-22 18:53:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:53:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-22 18:53:38] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 414 ms returned sat
[2023-03-22 18:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:47] [INFO ] [Nat]Absence check using state equation in 9266 ms returned sat
[2023-03-22 18:53:49] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2253 ms returned unsat
[2023-03-22 18:53:50] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-22 18:53:50] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 417 ms returned sat
[2023-03-22 18:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:53:59] [INFO ] [Real]Absence check using state equation in 8840 ms returned sat
[2023-03-22 18:54:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:54:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2023-03-22 18:54:01] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 422 ms returned sat
[2023-03-22 18:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:54:10] [INFO ] [Nat]Absence check using state equation in 9426 ms returned sat
[2023-03-22 18:54:13] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2739 ms returned unsat
[2023-03-22 18:54:14] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2023-03-22 18:54:14] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 442 ms returned sat
[2023-03-22 18:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:54:24] [INFO ] [Real]Absence check using state equation in 9999 ms returned sat
[2023-03-22 18:54:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:54:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 188 ms returned sat
[2023-03-22 18:54:26] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 432 ms returned sat
[2023-03-22 18:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:54:36] [INFO ] [Nat]Absence check using state equation in 9912 ms returned sat
[2023-03-22 18:54:37] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1123 ms returned unsat
[2023-03-22 18:54:38] [INFO ] [Real]Absence check using 65 positive place invariants in 162 ms returned sat
[2023-03-22 18:54:38] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 84 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 1] Max seen :[0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 252951 ms.
ITS solved all properties within timeout

BK_STOP 1679511279276

--------------------
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-S32C03"
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-S32C03, 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-167856416700901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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