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.r169-tall-167838855900469.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 ltsminxred
Input is FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 141K 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 FlexibleBarrier-PT-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678550988992

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 16:09:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 16:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:09:50] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-11 16:09:50] [INFO ] Transformed 542 places.
[2023-03-11 16:09:50] [INFO ] Transformed 621 transitions.
[2023-03-11 16:09:50] [INFO ] Found NUPN structural information;
[2023-03-11 16:09:50] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 621 rows 542 cols
[2023-03-11 16:09:50] [INFO ] Computed 8 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 194 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :8
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
[2023-03-11 16:09:51] [INFO ] Invariant cache hit.
[2023-03-11 16:09:51] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 16:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:09:51] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-11 16:09:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:09:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-11 16:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:09:51] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-11 16:09:51] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 4 ms to minimize.
[2023-03-11 16:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-11 16:09:52] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 38 ms.
[2023-03-11 16:09:55] [INFO ] Deduced a trap composed of 250 places in 124 ms of which 1 ms to minimize.
[2023-03-11 16:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-11 16:09:55] [INFO ] Added : 477 causal constraints over 96 iterations in 3970 ms. Result :sat
Minimization took 184 ms.
[2023-03-11 16:09:56] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:09:56] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-11 16:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:09:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:09:56] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-11 16:09:56] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 32 ms.
[2023-03-11 16:10:00] [INFO ] Added : 499 causal constraints over 100 iterations in 3791 ms. Result :sat
Minimization took 217 ms.
[2023-03-11 16:10:00] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-11 16:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:00] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-11 16:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:10:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:01] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-11 16:10:01] [INFO ] Deduced a trap composed of 191 places in 123 ms of which 1 ms to minimize.
[2023-03-11 16:10:01] [INFO ] Deduced a trap composed of 188 places in 101 ms of which 2 ms to minimize.
[2023-03-11 16:10:01] [INFO ] Deduced a trap composed of 162 places in 96 ms of which 1 ms to minimize.
[2023-03-11 16:10:01] [INFO ] Deduced a trap composed of 158 places in 87 ms of which 1 ms to minimize.
[2023-03-11 16:10:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 503 ms
[2023-03-11 16:10:01] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 29 ms.
[2023-03-11 16:10:05] [INFO ] Deduced a trap composed of 246 places in 144 ms of which 0 ms to minimize.
[2023-03-11 16:10:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-11 16:10:05] [INFO ] Added : 480 causal constraints over 97 iterations in 3873 ms. Result :sat
Minimization took 174 ms.
[2023-03-11 16:10:05] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:06] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-11 16:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:10:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:06] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-11 16:10:06] [INFO ] Deduced a trap composed of 231 places in 147 ms of which 1 ms to minimize.
[2023-03-11 16:10:06] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 0 ms to minimize.
[2023-03-11 16:10:06] [INFO ] Deduced a trap composed of 217 places in 110 ms of which 1 ms to minimize.
[2023-03-11 16:10:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-03-11 16:10:06] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 29 ms.
[2023-03-11 16:10:10] [INFO ] Deduced a trap composed of 158 places in 104 ms of which 0 ms to minimize.
[2023-03-11 16:10:10] [INFO ] Deduced a trap composed of 171 places in 102 ms of which 0 ms to minimize.
[2023-03-11 16:10:10] [INFO ] Deduced a trap composed of 161 places in 101 ms of which 0 ms to minimize.
[2023-03-11 16:10:10] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 0 ms to minimize.
[2023-03-11 16:10:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 618 ms
[2023-03-11 16:10:11] [INFO ] Added : 472 causal constraints over 95 iterations in 4184 ms. Result :sat
Minimization took 103 ms.
[2023-03-11 16:10:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-11 16:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:11] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-11 16:10:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:10:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:11] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-11 16:10:11] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 1 ms to minimize.
[2023-03-11 16:10:11] [INFO ] Deduced a trap composed of 162 places in 116 ms of which 0 ms to minimize.
[2023-03-11 16:10:12] [INFO ] Deduced a trap composed of 162 places in 102 ms of which 0 ms to minimize.
[2023-03-11 16:10:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 462 ms
[2023-03-11 16:10:12] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 29 ms.
[2023-03-11 16:10:15] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2023-03-11 16:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-11 16:10:15] [INFO ] Added : 474 causal constraints over 95 iterations in 3799 ms. Result :sat
Minimization took 169 ms.
[2023-03-11 16:10:16] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:16] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-11 16:10:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:10:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-11 16:10:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:16] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-11 16:10:16] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2023-03-11 16:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-11 16:10:16] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 29 ms.
[2023-03-11 16:10:20] [INFO ] Added : 505 causal constraints over 101 iterations in 3897 ms. Result :sat
Minimization took 208 ms.
[2023-03-11 16:10:20] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 16:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:21] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-11 16:10:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 16:10:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 16:10:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 16:10:21] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-11 16:10:21] [INFO ] Deduced a trap composed of 186 places in 120 ms of which 0 ms to minimize.
[2023-03-11 16:10:21] [INFO ] Deduced a trap composed of 184 places in 101 ms of which 1 ms to minimize.
[2023-03-11 16:10:21] [INFO ] Deduced a trap composed of 157 places in 87 ms of which 0 ms to minimize.
[2023-03-11 16:10:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-03-11 16:10:21] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 27 ms.
[2023-03-11 16:10:25] [INFO ] Added : 475 causal constraints over 95 iterations in 3764 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 519 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 4 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 510 transition count 435
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 295 place count 363 transition count 435
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 295 place count 363 transition count 405
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 355 place count 333 transition count 405
Discarding 169 places :
Symmetric choice reduction at 2 with 169 rule applications. Total rules 524 place count 164 transition count 236
Iterating global reduction 2 with 169 rules applied. Total rules applied 693 place count 164 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 693 place count 164 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 709 place count 156 transition count 228
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 715 place count 156 transition count 222
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 740 place count 131 transition count 197
Iterating global reduction 3 with 25 rules applied. Total rules applied 765 place count 131 transition count 197
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 790 place count 131 transition count 172
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 844 place count 104 transition count 145
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 850 place count 104 transition count 139
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 854 place count 100 transition count 135
Iterating global reduction 5 with 4 rules applied. Total rules applied 858 place count 100 transition count 135
Free-agglomeration rule applied 62 times.
Iterating global reduction 5 with 62 rules applied. Total rules applied 920 place count 100 transition count 73
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 94 edges and 38 vertex of which 23 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 88 rules applied. Total rules applied 1008 place count 23 transition count 48
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1029 place count 23 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1030 place count 23 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1031 place count 22 transition count 26
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t536.t280.t281 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 19 vertex of which 10 / 19 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 6 rules applied. Total rules applied 1037 place count 14 transition count 21
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 8 with 15 rules applied. Total rules applied 1052 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1054 place count 9 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 1054 place count 9 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1060 place count 6 transition count 6
Applied a total of 1060 rules in 106 ms. Remains 6 /542 variables (removed 536) and now considering 6/621 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 6/542 places, 6/621 transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-11 16:10:26] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 3) seen :3
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36589 ms.
ITS solved all properties within timeout

BK_STOP 1678551028034

--------------------
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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-06b, 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 r169-tall-167838855900469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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