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.r103-tall-167814478300421.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 DES-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K 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 DES-PT-10b-UpperBounds-00
FORMULA_NAME DES-PT-10b-UpperBounds-01
FORMULA_NAME DES-PT-10b-UpperBounds-02
FORMULA_NAME DES-PT-10b-UpperBounds-03
FORMULA_NAME DES-PT-10b-UpperBounds-04
FORMULA_NAME DES-PT-10b-UpperBounds-05
FORMULA_NAME DES-PT-10b-UpperBounds-06
FORMULA_NAME DES-PT-10b-UpperBounds-07
FORMULA_NAME DES-PT-10b-UpperBounds-08
FORMULA_NAME DES-PT-10b-UpperBounds-09
FORMULA_NAME DES-PT-10b-UpperBounds-10
FORMULA_NAME DES-PT-10b-UpperBounds-11
FORMULA_NAME DES-PT-10b-UpperBounds-12
FORMULA_NAME DES-PT-10b-UpperBounds-13
FORMULA_NAME DES-PT-10b-UpperBounds-14
FORMULA_NAME DES-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678251359956

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=DES-PT-10b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:56:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 04:56:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:56:01] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 04:56:01] [INFO ] Transformed 320 places.
[2023-03-08 04:56:01] [INFO ] Transformed 271 transitions.
[2023-03-08 04:56:01] [INFO ] Found NUPN structural information;
[2023-03-08 04:56:01] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 271 rows 320 cols
[2023-03-08 04:56:01] [INFO ] Computed 65 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
FORMULA DES-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
[2023-03-08 04:56:01] [INFO ] Invariant cache hit.
[2023-03-08 04:56:02] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2023-03-08 04:56:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-08 04:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:02] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-08 04:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 04:56:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 04:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:02] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-08 04:56:02] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2023-03-08 04:56:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-08 04:56:02] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-03-08 04:56:02] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-08 04:56:02] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-08 04:56:03] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-08 04:56:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 883 ms
[2023-03-08 04:56:03] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 25 ms.
[2023-03-08 04:56:04] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2023-03-08 04:56:04] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-08 04:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-08 04:56:04] [INFO ] Added : 243 causal constraints over 49 iterations in 1428 ms. Result :sat
Minimization took 126 ms.
[2023-03-08 04:56:04] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 04:56:04] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-08 04:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-08 04:56:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 04:56:05] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-08 04:56:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:05] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 04:56:05] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-08 04:56:05] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2023-03-08 04:56:05] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-08 04:56:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-08 04:56:05] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-08 04:56:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2023-03-08 04:56:05] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 15 ms.
[2023-03-08 04:56:06] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-08 04:56:06] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2023-03-08 04:56:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-08 04:56:06] [INFO ] Added : 245 causal constraints over 50 iterations in 1331 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 309 transition count 243
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 288 transition count 243
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 288 transition count 234
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 279 transition count 234
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 260 transition count 215
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 260 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 260 transition count 214
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 259 transition count 214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 244 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 244 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 244 transition count 184
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 242 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 242 transition count 180
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 239 transition count 180
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 162 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 160 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 159 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 159 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 158 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 157 transition count 103
Applied a total of 320 rules in 112 ms. Remains 157 /320 variables (removed 163) and now considering 103/271 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 157/320 places, 103/271 transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-08 04:56:07] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47768 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9072 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9079 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 2) seen :0
[2023-03-08 04:56:10] [INFO ] Invariant cache hit.
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-08 04:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 04:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:11] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 04:56:11] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-08 04:56:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2023-03-08 04:56:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 04:56:11] [INFO ] Added : 77 causal constraints over 16 iterations in 212 ms. Result :sat
Minimization took 30 ms.
[2023-03-08 04:56:11] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:11] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 04:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:11] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:56:11] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-08 04:56:11] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-08 04:56:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 04:56:11] [INFO ] Added : 83 causal constraints over 18 iterations in 225 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
[2023-03-08 04:56:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
[2023-03-08 04:56:12] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 04:56:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
[2023-03-08 04:56:12] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 157/157 places, 103/103 transitions.
Starting property specific reduction for DES-PT-10b-UpperBounds-05
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 484 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
[2023-03-08 04:56:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:12] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-08 04:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 86 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:12] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:56:12] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-08 04:56:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2023-03-08 04:56:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 04:56:12] [INFO ] Added : 77 causal constraints over 16 iterations in 203 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 103/103 transitions.
[2023-03-08 04:56:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47831 resets, run finished after 1633 ms. (steps per millisecond=612 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9092 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 1) seen :0
[2023-03-08 04:56:15] [INFO ] Invariant cache hit.
[2023-03-08 04:56:15] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 04:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:15] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-08 04:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-08 04:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 04:56:15] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-08 04:56:15] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2023-03-08 04:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 04:56:15] [INFO ] Added : 77 causal constraints over 16 iterations in 202 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 19 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-08 04:56:15] [INFO ] Invariant cache hit.
[2023-03-08 04:56:16] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 04:56:16] [INFO ] Invariant cache hit.
[2023-03-08 04:56:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-08 04:56:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:56:16] [INFO ] Invariant cache hit.
[2023-03-08 04:56:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-05 in 3949 ms.
Starting property specific reduction for DES-PT-10b-UpperBounds-07
[2023-03-08 04:56:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 484 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 86 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 04:56:16] [INFO ] Invariant cache hit.
[2023-03-08 04:56:16] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-08 04:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 04:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 04:56:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2023-03-08 04:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:16] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 04:56:16] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 5 ms.
[2023-03-08 04:56:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2023-03-08 04:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 04:56:16] [INFO ] Added : 83 causal constraints over 18 iterations in 215 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
[2023-03-08 04:56:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47667 resets, run finished after 1568 ms. (steps per millisecond=637 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9018 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
[2023-03-08 04:56:19] [INFO ] Invariant cache hit.
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 04:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 86 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:19] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 04:56:19] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-08 04:56:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-08 04:56:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 04:56:19] [INFO ] Added : 83 causal constraints over 18 iterations in 218 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-08 04:56:19] [INFO ] Invariant cache hit.
[2023-03-08 04:56:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-08 04:56:19] [INFO ] Invariant cache hit.
[2023-03-08 04:56:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-08 04:56:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:56:20] [INFO ] Invariant cache hit.
[2023-03-08 04:56:20] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-07 in 3807 ms.
[2023-03-08 04:56:20] [INFO ] Flatten gal took : 36 ms
[2023-03-08 04:56:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 04:56:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 103 transitions and 521 arcs took 1 ms.
Total runtime 18919 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-10b
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA DES-PT-10b-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251381300

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 3 DES-PT-10b-UpperBounds-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 DES-PT-10b-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 DES-PT-10b-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type FNDP) for 0 DES-PT-10b-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 8 (type EXCL) for DES-PT-10b-UpperBounds-07
lola: markings : 2955
lola: fired transitions : 3172
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for DES-PT-10b-UpperBounds-07 (obsolete)
lola: CANCELED task # 7 (type EQUN) for DES-PT-10b-UpperBounds-07 (obsolete)
lola: LAUNCH task # 11 (type EXCL) for 0 DES-PT-10b-UpperBounds-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type EQUN) for 0 DES-PT-10b-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/374/UpperBounds-10.sara.
sara: try reading problem file /home/mcc/execution/374/UpperBounds-7.sara.
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for DES-PT-10b-UpperBounds-05
lola: markings : 4608
lola: fired transitions : 4985
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for DES-PT-10b-UpperBounds-05 (obsolete)
lola: CANCELED task # 10 (type EQUN) for DES-PT-10b-UpperBounds-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10b-UpperBounds-05: BOUND 1 state space
DES-PT-10b-UpperBounds-07: 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="DES-PT-10b"
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 DES-PT-10b, 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 r103-tall-167814478300421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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