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-171683810800137.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-d2m96, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 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 1.1M 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-d2m96-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717250550725

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:02:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:02:34] [INFO ] Load time of PNML (sax parser for PT used): 543 ms
[2024-06-01 14:02:34] [INFO ] Transformed 2398 places.
[2024-06-01 14:02:34] [INFO ] Transformed 1954 transitions.
[2024-06-01 14:02:34] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 830 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Deduced a syphon composed of 1984 places in 22 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 970 place count 272 transition count 408
Iterating global reduction 1 with 117 rules applied. Total rules applied 1087 place count 272 transition count 408
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1097 place count 272 transition count 398
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 1183 place count 186 transition count 312
Iterating global reduction 2 with 86 rules applied. Total rules applied 1269 place count 186 transition count 312
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1301 place count 186 transition count 280
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1337 place count 150 transition count 231
Iterating global reduction 3 with 36 rules applied. Total rules applied 1373 place count 150 transition count 231
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1400 place count 150 transition count 204
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1405 place count 145 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 1410 place count 145 transition count 197
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1414 place count 141 transition count 193
Iterating global reduction 4 with 4 rules applied. Total rules applied 1418 place count 141 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1419 place count 140 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 1420 place count 140 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1421 place count 139 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 1422 place count 139 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1423 place count 138 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 1424 place count 138 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1425 place count 137 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 1426 place count 137 transition count 188
Applied a total of 1426 rules in 155 ms. Remains 137 /414 variables (removed 277) and now considering 188/1954 (removed 1766) transitions.
// Phase 1: matrix 188 rows 137 cols
[2024-06-01 14:02:34] [INFO ] Computed 5 invariants in 22 ms
[2024-06-01 14:02:35] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 14:02:35] [INFO ] Invariant cache hit.
[2024-06-01 14:02:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 14:02:36] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-06-01 14:02:36] [INFO ] Invariant cache hit.
[2024-06-01 14:02:36] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 14:02:42] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 39 ms to minimize.
[2024-06-01 14:02:42] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/325 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 91/235 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 14:02:46] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 236 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/325 variables, 137/145 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 91/236 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 187/423 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 14:03:02] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:03:03] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/425 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/425 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/325 variables, 0/425 constraints. Problems are: Problem set: 3 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 425 constraints, problems are : Problem set: 3 solved, 184 unsolved in 25392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 44973ms problems are : Problem set: 3 solved, 184 unsolved
Search for dead transitions found 3 dead transitions in 45009ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/414 places, 185/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 134 transition count 185
Applied a total of 3 rules in 8 ms. Remains 134 /137 variables (removed 3) and now considering 185/185 (removed 0) transitions.
// Phase 1: matrix 185 rows 134 cols
[2024-06-01 14:03:21] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 14:03:21] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-06-01 14:03:21] [INFO ] Invariant cache hit.
[2024-06-01 14:03:21] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 14:03:22] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/414 places, 185/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47943 ms. Remains : 134/414 places, 185/1954 transitions.
Support contains 9 out of 134 places after structural reductions.
[2024-06-01 14:03:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:03:22] [INFO ] Flatten gal took : 86 ms
[2024-06-01 14:03:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:03:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:03:23] [INFO ] Flatten gal took : 40 ms
[2024-06-01 14:03:23] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 6 out of 134 places (down from 9) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9022 resets) in 2630 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4154 resets) in 721 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4059 resets) in 338 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4161 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 542022 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 3
Probabilistic random walk after 542022 steps, saw 257199 distinct states, run finished after 3006 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-01 14:03:27] [INFO ] Invariant cache hit.
[2024-06-01 14:03:27] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/78 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/104 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 165/269 variables, 104/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 70/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 8 (OVERLAPS) 50/319 variables, 30/208 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 228 constraints, problems are : Problem set: 2 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/104 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 165/269 variables, 104/108 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 70/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 319/319 variables, and 208 constraints, problems are : Problem set: 3 solved, 0 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 70/90 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 37 stabilizing places and 49 stable transitions
Graph (complete) has 454 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Total runtime 54186 ms.
ITS solved all properties within timeout

BK_STOP 1717250607824

--------------------
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 CTLCardinality -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-d2m96"
export BK_EXAMINATION="CTLCardinality"
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-d2m96, examination is CTLCardinality"
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-171683810800137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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