Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300403.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994300403
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749156376935

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-05 20:46:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:46:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:46:18] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-05 20:46:18] [INFO ] Transformed 1295 places.
[2025-06-05 20:46:18] [INFO ] Transformed 749 transitions.
[2025-06-05 20:46:18] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 249
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 249
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 243
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 423 place count 141 transition count 201
Iterating global reduction 2 with 42 rules applied. Total rules applied 465 place count 141 transition count 201
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 482 place count 141 transition count 184
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 505 place count 118 transition count 160
Iterating global reduction 3 with 23 rules applied. Total rules applied 528 place count 118 transition count 160
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 543 place count 118 transition count 145
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 550 place count 111 transition count 135
Iterating global reduction 4 with 7 rules applied. Total rules applied 557 place count 111 transition count 135
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 564 place count 104 transition count 128
Iterating global reduction 4 with 7 rules applied. Total rules applied 571 place count 104 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 575 place count 100 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 579 place count 100 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 581 place count 100 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 584 place count 97 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 587 place count 97 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 589 place count 95 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 591 place count 95 transition count 116
Applied a total of 591 rules in 75 ms. Remains 95 /259 variables (removed 164) and now considering 116/749 (removed 633) transitions.
// Phase 1: matrix 116 rows 95 cols
[2025-06-05 20:46:18] [INFO ] Computed 5 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:18] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-05 20:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:46:18] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 20:46:19] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-05 20:46:19] [INFO ] Invariant cache hit.
[2025-06-05 20:46:19] [INFO ] State equation strengthened by 52 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, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:21] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:21] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:21] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 8 (OVERLAPS) 116/211 variables, 95/109 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 52/161 constraints. Problems are: Problem set: 11 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:24] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 8 ms to minimize.
Problem TDEAD101 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/162 constraints. Problems are: Problem set: 12 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:25] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:25] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 2/164 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/211 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 164 constraints, problems are : Problem set: 12 solved, 103 unsolved in 10750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 103 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, 103 unsolved
At refinement iteration 1 (OVERLAPS) 4/83 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 5/8 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 8/91 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 4/14 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 115/206 variables, 91/105 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 51/156 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 10/166 constraints. Problems are: Problem set: 12 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:46:31] [INFO ] Deduced a trap along path composed of 20 places in 39 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 1/167 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 5/211 variables, 4/171 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 1/172 constraints. Problems are: Problem set: 12 solved, 103 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 93/265 constraints. Problems are: Problem set: 17 solved, 98 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 3/268 constraints. Problems are: Problem set: 17 solved, 98 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 0/268 constraints. Problems are: Problem set: 17 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/211 variables, and 268 constraints, problems are : Problem set: 17 solved, 98 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 103/115 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40909ms problems are : Problem set: 17 solved, 98 unsolved
Search for dead transitions found 17 dead transitions in 40918ms
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, 99/749 transitions.
Reduce places removed 28 places and 30 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 65
Reduce places removed 13 places and 14 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 45 place count 54 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 53 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 53 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 47 rules in 3 ms. Remains 53 /95 variables (removed 42) and now considering 50/99 (removed 49) transitions.
// Phase 1: matrix 50 rows 53 cols
[2025-06-05 20:47:00] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 20:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:47:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/259 places, 50/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41760 ms. Remains : 53/259 places, 50/749 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Support contains 2 out of 50 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:47:00] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-05 20:47:00] [INFO ] Flatten gal took : 19 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:47:00] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:47:00] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 1 out of 50 places (down from 2) after GAL structural reductions.
RANDOM walk for 40000 steps (8930 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4204 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137 steps, run visited all 1 properties in 5 ms. (steps per millisecond=27 )
Probabilistic random walk after 137 steps, saw 94 distinct states, run finished after 8 ms. (steps per millisecond=17 ) properties seen :1
Computed a total of 50 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2025-06-05 20:47:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 20:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:47:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2025-06-05 20:47:00] [INFO ] Invariant cache hit.
[2025-06-05 20:47:00] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 73 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1418 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 49/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 122 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4430ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4430ms
Finished structural reductions in LTL mode , in 1 iterations and 4544 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 50 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04 finished in 5340 ms.
All properties solved by simple procedures.
Total runtime 47923 ms.

BK_STOP 1749156426356

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994300403"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;