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.r532-smll-171683810600011.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 SieveSingleMsgMbox-PT-d0m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 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 SieveSingleMsgMbox-PT-d0m06-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717241572815

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:32:55] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-01 11:32:55] [INFO ] Transformed 262 places.
[2024-06-01 11:32:55] [INFO ] Transformed 73 transitions.
[2024-06-01 11:32:55] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 62 transition count 65
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 60 transition count 62
Applied a total of 23 rules in 82 ms. Remains 60 /72 variables (removed 12) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:32:55] [INFO ] Computed 5 invariants in 21 ms
[2024-06-01 11:32:56] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 11:32:56] [INFO ] Invariant cache hit.
[2024-06-01 11:32:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:32:56] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-06-01 11:32:56] [INFO ] Invariant cache hit.
[2024-06-01 11:32:56] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 26 ms to minimize.
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:32:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 7735ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7763ms
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8694 ms. Remains : 60/72 places, 62/73 transitions.
Support contains 2 out of 60 places after structural reductions.
[2024-06-01 11:33:04] [INFO ] Flatten gal took : 50 ms
[2024-06-01 11:33:04] [INFO ] Flatten gal took : 26 ms
[2024-06-01 11:33:04] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (8944 resets) in 1904 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4174 resets) in 538 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4095 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
Probably explored full state space saw : 23705 states, properties seen :1
Probabilistic random walk after 61230 steps, saw 23705 distinct states, run finished after 195 ms. (steps per millisecond=314 ) properties seen :1
Explored full state space saw : 23705 states, properties seen :0
Exhaustive walk after 61230 steps, saw 23705 distinct states, run finished after 96 ms. (steps per millisecond=637 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 17 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-01 11:33:06] [INFO ] Invariant cache hit.
[2024-06-01 11:33:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 11:33:06] [INFO ] Invariant cache hit.
[2024-06-01 11:33:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:33:06] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-01 11:33:06] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 11:33:06] [INFO ] Invariant cache hit.
[2024-06-01 11:33:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:33:08] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
[2024-06-01 11:33:08] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:33:08] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 7489ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7868 ms. Remains : 60/60 places, 62/62 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12 finished in 8220 ms.
All properties solved by simple procedures.
Total runtime 19437 ms.
ITS solved all properties within timeout

BK_STOP 1717241594428

--------------------
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 LTLCardinality -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="SieveSingleMsgMbox-PT-d0m06"
export BK_EXAMINATION="LTLCardinality"
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 SieveSingleMsgMbox-PT-d0m06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;