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

About the Execution of LoLa+red for SieveSingleMsgMbox-PT-d2m96

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
627.491 21962.00 42958.00 78.90 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976800493.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SieveSingleMsgMbox-PT-d2m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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 SieveSingleMsgMbox-PT-d2m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679250009621

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=SieveSingleMsgMbox-PT-d2m96
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 18:20:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 18:20:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:20:11] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-19 18:20:11] [INFO ] Transformed 2398 places.
[2023-03-19 18:20:11] [INFO ] Transformed 1954 transitions.
[2023-03-19 18:20:11] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 35 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-19 18:20:11] [INFO ] Computed 6 place invariants in 110 ms
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
[2023-03-19 18:20:12] [INFO ] Invariant cache hit.
[2023-03-19 18:20:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-19 18:20:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 18:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:13] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2023-03-19 18:20:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:20:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 18:20:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:14] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2023-03-19 18:20:14] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-19 18:20:15] [INFO ] [Nat]Added 1674 Read/Feed constraints in 684 ms returned sat
[2023-03-19 18:20:17] [INFO ] Deduced a trap composed of 112 places in 2400 ms of which 43 ms to minimize.
[2023-03-19 18:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2612 ms
[2023-03-19 18:20:18] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 379 ms.
[2023-03-19 18:20:18] [INFO ] Added : 15 causal constraints over 3 iterations in 820 ms. Result :unknown
[2023-03-19 18:20:18] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2023-03-19 18:20:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 28 ms returned sat
[2023-03-19 18:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:21] [INFO ] [Real]Absence check using state equation in 2444 ms returned sat
[2023-03-19 18:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:20:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 18:20:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 18:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:21] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-19 18:20:21] [INFO ] [Nat]Added 1674 Read/Feed constraints in 338 ms returned sat
[2023-03-19 18:20:22] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 1 ms to minimize.
[2023-03-19 18:20:22] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 1 ms to minimize.
[2023-03-19 18:20:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 782 ms
[2023-03-19 18:20:23] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 271 ms.
[2023-03-19 18:20:23] [INFO ] Added : 19 causal constraints over 4 iterations in 1226 ms. Result :sat
Minimization took 392 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1171 place count 177 transition count 270
Iterating global reduction 2 with 92 rules applied. Total rules applied 1263 place count 177 transition count 270
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1298 place count 177 transition count 235
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1337 place count 138 transition count 181
Iterating global reduction 3 with 39 rules applied. Total rules applied 1376 place count 138 transition count 181
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1400 place count 138 transition count 157
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 129 transition count 144
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 129 transition count 144
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1427 place count 120 transition count 135
Iterating global reduction 4 with 9 rules applied. Total rules applied 1436 place count 120 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1441 place count 115 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 1446 place count 115 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1448 place count 115 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1453 place count 110 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 1458 place count 110 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1461 place count 107 transition count 119
Iterating global reduction 5 with 3 rules applied. Total rules applied 1464 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1465 place count 106 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 1466 place count 106 transition count 118
Applied a total of 1466 rules in 199 ms. Remains 106 /414 variables (removed 308) and now considering 118/1954 (removed 1836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 106/414 places, 118/1954 transitions.
// Phase 1: matrix 118 rows 106 cols
[2023-03-19 18:20:24] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224380 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103292 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :0
[2023-03-19 18:20:26] [INFO ] Invariant cache hit.
[2023-03-19 18:20:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:26] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-19 18:20:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:20:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:26] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-19 18:20:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:20:26] [INFO ] [Nat]Added 44 Read/Feed constraints in 27 ms returned sat
[2023-03-19 18:20:26] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-19 18:20:26] [INFO ] Added : 18 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-19 18:20:26] [INFO ] Invariant cache hit.
[2023-03-19 18:20:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-19 18:20:26] [INFO ] Invariant cache hit.
[2023-03-19 18:20:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:20:27] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2023-03-19 18:20:27] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 18:20:27] [INFO ] Invariant cache hit.
[2023-03-19 18:20:27] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 106/106 places, 118/118 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
[2023-03-19 18:20:27] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-19 18:20:27] [INFO ] Invariant cache hit.
[2023-03-19 18:20:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:27] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-19 18:20:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:20:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:28] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-19 18:20:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:20:28] [INFO ] [Nat]Added 44 Read/Feed constraints in 10 ms returned sat
[2023-03-19 18:20:28] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 32 ms.
[2023-03-19 18:20:28] [INFO ] Added : 18 causal constraints over 4 iterations in 143 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 106/106 places, 118/118 transitions.
[2023-03-19 18:20:28] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224417 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103458 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :0
[2023-03-19 18:20:29] [INFO ] Invariant cache hit.
[2023-03-19 18:20:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 18:20:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-19 18:20:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:20:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:20:30] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-19 18:20:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:20:30] [INFO ] [Nat]Added 44 Read/Feed constraints in 9 ms returned sat
[2023-03-19 18:20:30] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 10 ms.
[2023-03-19 18:20:30] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-19 18:20:30] [INFO ] Invariant cache hit.
[2023-03-19 18:20:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 18:20:30] [INFO ] Invariant cache hit.
[2023-03-19 18:20:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:20:30] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-19 18:20:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 18:20:30] [INFO ] Invariant cache hit.
[2023-03-19 18:20:30] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 106/106 places, 118/118 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 in 3214 ms.
[2023-03-19 18:20:31] [INFO ] Flatten gal took : 62 ms
[2023-03-19 18:20:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 13 ms.
[2023-03-19 18:20:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 118 transitions and 470 arcs took 3 ms.
Total runtime 19856 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d2m96
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
Upper Bounds

FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679250031583

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
lola: markings : 59
lola: fired transitions : 58
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 (obsolete)
lola: CANCELED task # 4 (type EQUN) for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m96-UpperBounds-08: BOUND 1 state space


Time elapsed: 0 secs. Pages in use: 1

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="SieveSingleMsgMbox-PT-d2m96"
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 SieveSingleMsgMbox-PT-d2m96, 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 r423-tajo-167905976800493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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