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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 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-d0m36-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717241931097

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-d0m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:38:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:38:53] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 11:38:53] [INFO ] Transformed 262 places.
[2024-06-01 11:38:53] [INFO ] Transformed 73 transitions.
[2024-06-01 11:38:53] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 63 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 63 transition count 66
Applied a total of 16 rules in 46 ms. Remains 63 /72 variables (removed 9) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-06-01 11:38:53] [INFO ] Computed 5 invariants in 24 ms
[2024-06-01 11:38:54] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-06-01 11:38:54] [INFO ] Invariant cache hit.
[2024-06-01 11:38:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 11:38:54] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-06-01 11:38:54] [INFO ] Invariant cache hit.
[2024-06-01 11:38:54] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 11:38:56] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 20 ms to minimize.
[2024-06-01 11:38:56] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 97 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 162 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
After SMT, in 6375ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6398ms
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 66/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7293 ms. Remains : 63/72 places, 66/73 transitions.
Support contains 18 out of 63 places after structural reductions.
[2024-06-01 11:39:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 11:39:01] [INFO ] Flatten gal took : 57 ms
[2024-06-01 11:39:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:39:01] [INFO ] Flatten gal took : 26 ms
[2024-06-01 11:39:01] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 12 out of 63 places (down from 18) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8944 resets) in 2172 ms. (18 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (3992 resets) in 489 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (3775 resets) in 383 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (4189 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4188 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (4066 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4100 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4168 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4173 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
[2024-06-01 11:39:03] [INFO ] Invariant cache hit.
[2024-06-01 11:39:03] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/42 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/53 variables, 3/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 59/112 variables, 53/58 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 20/78 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/78 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/129 variables, 10/88 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 7/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 95 constraints, problems are : Problem set: 8 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/52 variables, 3/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-06-01 11:39:03] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:39:03] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/111 variables, 52/59 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/79 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/129 variables, 11/90 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 7/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/129 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 98 constraints, problems are : Problem set: 8 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 544ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 66/66 transitions.
Graph (complete) has 174 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 60 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 58 transition count 59
Applied a total of 12 rules in 56 ms. Remains 58 /63 variables (removed 5) and now considering 59/66 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 58/63 places, 59/66 transitions.
RANDOM walk for 40000 steps (8923 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4094 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 318 steps, run visited all 1 properties in 12 ms. (steps per millisecond=26 )
Probabilistic random walk after 318 steps, saw 176 distinct states, run finished after 20 ms. (steps per millisecond=15 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 5 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 14 ms
[2024-06-01 11:39:03] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 196 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 18 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 59/63 places, 61/66 transitions.
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:39:03] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 16 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 59/63 places, 61/66 transitions.
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:39:03] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:39:03] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 16 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 59/63 places, 61/66 transitions.
[2024-06-01 11:39:04] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:39:04] [INFO ] Flatten gal took : 11 ms
[2024-06-01 11:39:04] [INFO ] Input system was already deterministic with 61 transitions.
[2024-06-01 11:39:04] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:39:04] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:39:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 11:39:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 66 transitions and 261 arcs took 4 ms.
Total runtime 10895 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-15

BK_STOP 1717241944523

--------------------
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
mcc2024
ctl formula name SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/530/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/530/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/530/ctl_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d0m36"
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-d0m36, 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-171683810600025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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