Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300401.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
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 r212-tall-174901994300401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
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
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749156230121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 20:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:43:51] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-05 20:43:51] [INFO ] Transformed 1295 places.
[2025-06-05 20:43:51] [INFO ] Transformed 749 transitions.
[2025-06-05 20:43:51] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 1036 places in 10 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-11 FALSE 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 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 246
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 246
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 381 place count 183 transition count 240
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 424 place count 140 transition count 197
Iterating global reduction 2 with 43 rules applied. Total rules applied 467 place count 140 transition count 197
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 481 place count 140 transition count 183
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 506 place count 115 transition count 156
Iterating global reduction 3 with 25 rules applied. Total rules applied 531 place count 115 transition count 156
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 548 place count 115 transition count 139
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 554 place count 109 transition count 131
Iterating global reduction 4 with 6 rules applied. Total rules applied 560 place count 109 transition count 131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 566 place count 103 transition count 125
Iterating global reduction 4 with 6 rules applied. Total rules applied 572 place count 103 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 575 place count 100 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 578 place count 100 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 580 place count 100 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 583 place count 97 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 586 place count 97 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 588 place count 95 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 590 place count 95 transition count 114
Applied a total of 590 rules in 84 ms. Remains 95 /259 variables (removed 164) and now considering 114/749 (removed 635) transitions.
// Phase 1: matrix 114 rows 95 cols
[2025-06-05 20:43:51] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:43:51] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-06-05 20:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:43:52] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 20:43:52] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-05 20:43:52] [INFO ] Invariant cache hit.
[2025-06-05 20:43:52] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:53] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:54] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:55] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 9 (OVERLAPS) 114/209 variables, 95/108 constraints. Problems are: Problem set: 11 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 51/159 constraints. Problems are: Problem set: 11 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:57] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:43:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 7 ms to minimize.
Problem TDEAD99 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 2/161 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/161 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/161 constraints. Problems are: Problem set: 12 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 161 constraints, problems are : Problem set: 12 solved, 101 unsolved in 10756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 3/82 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/3 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 9/91 variables, 2/5 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 9/14 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 113/204 variables, 91/105 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 50/155 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 10/165 constraints. Problems are: Problem set: 12 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:04] [INFO ] Deduced a trap along path composed of 4 places in 37 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:44:04] [INFO ] Deduced a trap along path composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 2/167 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 5/209 variables, 4/171 constraints. Problems are: Problem set: 12 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 1/172 constraints. Problems are: Problem set: 12 solved, 101 unsolved
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 91/263 constraints. Problems are: Problem set: 17 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 1/264 constraints. Problems are: Problem set: 17 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/264 constraints. Problems are: Problem set: 17 solved, 96 unsolved
At refinement iteration 17 (OVERLAPS) 0/209 variables, 0/264 constraints. Problems are: Problem set: 17 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 264 constraints, problems are : Problem set: 17 solved, 96 unsolved in 28958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 101/113 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39844ms problems are : Problem set: 17 solved, 96 unsolved
Search for dead transitions found 17 dead transitions in 39853ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/259 places, 97/749 transitions.
Reduce places removed 28 places and 30 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 67 transition count 64
Reduce places removed 13 places and 15 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 44 place count 54 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 53 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 52 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 52 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 51 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 51 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 50 transition count 45
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 50 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 50 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 53 rules in 7 ms. Remains 50 /95 variables (removed 45) and now considering 44/97 (removed 53) transitions.
// Phase 1: matrix 44 rows 50 cols
[2025-06-05 20:44:32] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 20:44:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:44:32] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/259 places, 44/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40614 ms. Remains : 50/259 places, 44/749 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 0 out of 46 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:44:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-06-05 20:44:32] [INFO ] Flatten gal took : 19 ms
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-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:44:32] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:44:32] [INFO ] Input system was already deterministic with 44 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-05 20:44:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:44:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:44:32] [INFO ] Input system was already deterministic with 44 transitions.
Computed a total of 46 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 46 cols
[2025-06-05 20:44:32] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 20:44:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:44:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 20:44:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2025-06-05 20:44:32] [INFO ] Invariant cache hit.
[2025-06-05 20:44:32] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/90 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 65 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/90 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 43/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 108 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3292ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 3292ms
Finished structural reductions in LTL mode , in 1 iterations and 3407 ms. Remains : 46/46 places, 44/44 transitions.
[2025-06-05 20:44:35] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:44:35] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:44:35] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-05 20:44:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:44:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:44:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11221860268792623963.gal : 2 ms
[2025-06-05 20:44:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality8391749068579639127.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11221860268792623963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8391749068579639127.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,627,0.025391,4492,2,534,5,2793,6,0,230,2180,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.026261,4492,1,0,6,2793,7,1,310,2180,1
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-05 20:44:35] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:44:35] [INFO ] Flatten gal took : 4 ms
Total runtime 44680 ms.

BK_STOP 1749156276039

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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-5832"
echo " Executing tool itstools"
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 r212-tall-174901994300401"
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.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 ;