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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 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 450K 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-d1m04-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717242682873

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:51:24] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-06-01 11:51:24] [INFO ] Transformed 1295 places.
[2024-06-01 11:51:24] [INFO ] Transformed 749 transitions.
[2024-06-01 11:51:24] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 131 ms.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 243 transition count 525
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 297 place count 186 transition count 252
Iterating global reduction 1 with 57 rules applied. Total rules applied 354 place count 186 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 360 place count 186 transition count 246
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 398 place count 148 transition count 208
Iterating global reduction 2 with 38 rules applied. Total rules applied 436 place count 148 transition count 208
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 447 place count 148 transition count 197
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 470 place count 125 transition count 172
Iterating global reduction 3 with 23 rules applied. Total rules applied 493 place count 125 transition count 172
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 510 place count 125 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 512 place count 123 transition count 153
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 123 transition count 153
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 516 place count 121 transition count 151
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 121 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 519 place count 120 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 520 place count 120 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 522 place count 120 transition count 148
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 523 place count 119 transition count 147
Iterating global reduction 5 with 1 rules applied. Total rules applied 524 place count 119 transition count 147
Applied a total of 524 rules in 138 ms. Remains 119 /259 variables (removed 140) and now considering 147/749 (removed 602) transitions.
// Phase 1: matrix 147 rows 119 cols
[2024-06-01 11:51:25] [INFO ] Computed 5 invariants in 23 ms
[2024-06-01 11:51:25] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-01 11:51:25] [INFO ] Invariant cache hit.
[2024-06-01 11:51:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 11:51:26] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-06-01 11:51:26] [INFO ] Invariant cache hit.
[2024-06-01 11:51:26] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-01 11:51:29] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 31 ms to minimize.
[2024-06-01 11:51:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/118 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 3 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 3 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 3 ms to minimize.
[2024-06-01 11:51:32] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-01 11:51:32] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:51:32] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:51:32] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 3 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 9 (OVERLAPS) 147/265 variables, 118/139 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 68/207 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/207 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/266 variables, 1/208 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/208 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/266 variables, 0/208 constraints. Problems are: Problem set: 15 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 208 constraints, problems are : Problem set: 15 solved, 131 unsolved in 14618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 4/103 variables, 2/2 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/3 constraints. Problems are: Problem set: 15 solved, 131 unsolved
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/5 constraints. Problems are: Problem set: 15 solved, 131 unsolved
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 11/114 variables, 2/9 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 16/25 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 146/260 variables, 114/139 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 67/206 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 14/220 constraints. Problems are: Problem set: 15 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/220 constraints. Problems are: Problem set: 15 solved, 131 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 13 (OVERLAPS) 6/266 variables, 5/225 constraints. Problems are: Problem set: 16 solved, 130 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 1/226 constraints. Problems are: Problem set: 16 solved, 130 unsolved
Problem TDEAD128 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 117/343 constraints. Problems are: Problem set: 22 solved, 124 unsolved
[2024-06-01 11:51:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:51:57] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-01 11:51:57] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 3/346 constraints. Problems are: Problem set: 22 solved, 124 unsolved
[2024-06-01 11:52:02] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 1/347 constraints. Problems are: Problem set: 22 solved, 124 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/347 constraints. Problems are: Problem set: 22 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 347 constraints, problems are : Problem set: 22 solved, 124 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 131/146 constraints, Known Traps: 24/24 constraints]
After SMT, in 45347ms problems are : Problem set: 22 solved, 124 unsolved
Search for dead transitions found 22 dead transitions in 45375ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/259 places, 125/749 transitions.
Reduce places removed 35 places and 38 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 84 transition count 84
Reduce places removed 15 places and 18 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 53 place count 69 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 68 transition count 65
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 68 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 67 transition count 64
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 67 transition count 64
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 57 rules in 8 ms. Remains 67 /119 variables (removed 52) and now considering 64/125 (removed 61) transitions.
// Phase 1: matrix 64 rows 67 cols
[2024-06-01 11:52:11] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 11:52:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 11:52:11] [INFO ] Invariant cache hit.
[2024-06-01 11:52:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 11:52:12] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/259 places, 64/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46909 ms. Remains : 67/259 places, 64/749 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Support contains 2 out of 60 places after structural reductions.
[2024-06-01 11:52:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 11:52:12] [INFO ] Flatten gal took : 36 ms
[2024-06-01 11:52:12] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:52:12] [INFO ] Flatten gal took : 17 ms
[2024-06-01 11:52:12] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 1 out of 60 places (down from 2) after GAL structural reductions.
RANDOM walk for 40000 steps (8919 resets) in 1030 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4079 resets) in 746 ms. (53 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 166 steps, run visited all 1 properties in 15 ms. (steps per millisecond=11 )
Probabilistic random walk after 166 steps, saw 106 distinct states, run finished after 25 ms. (steps per millisecond=6 ) properties seen :1
[2024-06-01 11:52:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 14 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:52:13] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 64/64 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 53 transition count 55
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 53 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 53 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 50 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 48 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 47 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 47 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 46 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 46 transition count 44
Applied a total of 32 rules in 9 ms. Remains 46 /60 variables (removed 14) and now considering 44/64 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 46/60 places, 44/64 transitions.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:52:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 64/64 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 53 transition count 55
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 53 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 53 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 50 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 48 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 47 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 47 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 46 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 46 transition count 44
Applied a total of 32 rules in 6 ms. Remains 46 /60 variables (removed 14) and now considering 44/64 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 46/60 places, 44/64 transitions.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:52:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 64/64 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 53 transition count 55
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 53 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 53 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 50 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 48 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 47 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 47 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 46 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 46 transition count 44
Applied a total of 32 rules in 6 ms. Remains 46 /60 variables (removed 14) and now considering 44/64 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 46/60 places, 44/64 transitions.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:52:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 60/60 places, 64/64 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 57 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 55 transition count 58
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 55 transition count 58
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 55 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 53 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 53 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 51 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 51 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 50 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 50 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 49
Applied a total of 24 rules in 19 ms. Remains 49 /60 variables (removed 11) and now considering 49/64 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 49/60 places, 49/64 transitions.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:52:13] [INFO ] Input system was already deterministic with 49 transitions.
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:52:13] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:52:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:52:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 64 transitions and 250 arcs took 2 ms.
Total runtime 48820 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-d1m04-CTLCardinality-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-09

BK_STOP 1717242733767

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d1m04-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/594/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/594/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/594/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/594/ctl_3_
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-d1m04"
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-d1m04, 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-171683810600049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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