Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602500030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717181906187

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:58:27] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-31 18:58:27] [INFO ] Transformed 542 places.
[2024-05-31 18:58:27] [INFO ] Transformed 621 transitions.
[2024-05-31 18:58:27] [INFO ] Found NUPN structural information;
[2024-05-31 18:58:27] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (778 resets) in 1992 ms. (20 steps per ms) remains 4/10 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (107 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
// Phase 1: matrix 621 rows 542 cols
[2024-05-31 18:58:28] [INFO ] Computed 8 invariants in 51 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 473/542 variables, 8/77 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 473/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 621/1163 variables, 542/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 1092 constraints, problems are : Problem set: 1 solved, 3 unsolved in 695 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 499/542 variables, 8/51 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 499/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 18:58:29] [INFO ] Deduced a trap composed of 96 places in 232 ms of which 40 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 200 places in 227 ms of which 4 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 189 places in 174 ms of which 3 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 189 places in 160 ms of which 4 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 3 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 224 places in 153 ms of which 3 ms to minimize.
[2024-05-31 18:58:30] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 4 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 189 places in 194 ms of which 3 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 224 places in 157 ms of which 3 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 221 places in 157 ms of which 3 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 256 places in 156 ms of which 3 ms to minimize.
[2024-05-31 18:58:31] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 3 ms to minimize.
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 187 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 4 ms to minimize.
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 161 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 190 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 18/568 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 18:58:32] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 4 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 243 places in 178 ms of which 4 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 3 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 187 places in 137 ms of which 3 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 208 places in 164 ms of which 3 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 192 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 6/574 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 190 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 158 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 3/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5872ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 427 edges and 542 vertex of which 24 / 542 are part of one of the 4 SCC in 10 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 522 transition count 481
Reduce places removed 116 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 127 rules applied. Total rules applied 244 place count 406 transition count 470
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 256 place count 395 transition count 469
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 256 place count 395 transition count 443
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 308 place count 369 transition count 443
Discarding 141 places :
Symmetric choice reduction at 3 with 141 rule applications. Total rules 449 place count 228 transition count 302
Iterating global reduction 3 with 141 rules applied. Total rules applied 590 place count 228 transition count 302
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 590 place count 228 transition count 300
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 594 place count 226 transition count 300
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 609 place count 211 transition count 285
Iterating global reduction 3 with 15 rules applied. Total rules applied 624 place count 211 transition count 285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 634 place count 211 transition count 275
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 700 place count 178 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 707 place count 178 transition count 235
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 711 place count 174 transition count 231
Iterating global reduction 5 with 4 rules applied. Total rules applied 715 place count 174 transition count 231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 721 place count 171 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 724 place count 171 transition count 237
Free-agglomeration rule applied 64 times.
Iterating global reduction 5 with 64 rules applied. Total rules applied 788 place count 171 transition count 173
Reduce places removed 64 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 860 place count 107 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 864 place count 107 transition count 161
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 870 place count 107 transition count 161
Applied a total of 870 rules in 173 ms. Remains 107 /542 variables (removed 435) and now considering 161/621 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 107/542 places, 161/621 transitions.
RANDOM walk for 40000 steps (868 resets) in 429 ms. (93 steps per ms) remains 1/3 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (132 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2024-05-31 18:58:34] [INFO ] Flow matrix only has 159 transitions (discarded 2 similar events)
// Phase 1: matrix 159 rows 107 cols
[2024-05-31 18:58:34] [INFO ] Computed 8 invariants in 5 ms
[2024-05-31 18:58:34] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/107 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 159/266 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 71/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:58:35] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/266 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 71/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
All properties solved without resorting to model-checking.
Total runtime 7844 ms.
ITS solved all properties within timeout

BK_STOP 1717181915202

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ReachabilityCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602500030"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;