Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 19K 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 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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-d1m06-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749156898029

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 20:54:59] [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:54:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:54:59] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-05 20:54:59] [INFO ] Transformed 1295 places.
[2025-06-05 20:54:59] [INFO ] Transformed 749 transitions.
[2025-06-05 20:54:59] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 203 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 2 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-12 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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 315 place count 184 transition count 248
Iterating global reduction 1 with 58 rules applied. Total rules applied 373 place count 184 transition count 248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 380 place count 184 transition count 241
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 422 place count 142 transition count 199
Iterating global reduction 2 with 42 rules applied. Total rules applied 464 place count 142 transition count 199
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 478 place count 142 transition count 185
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 502 place count 118 transition count 159
Iterating global reduction 3 with 24 rules applied. Total rules applied 526 place count 118 transition count 159
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 545 place count 118 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 550 place count 113 transition count 134
Iterating global reduction 4 with 5 rules applied. Total rules applied 555 place count 113 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 560 place count 108 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 565 place count 108 transition count 129
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 568 place count 105 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 571 place count 105 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 573 place count 105 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 576 place count 102 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 579 place count 102 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 581 place count 100 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 583 place count 100 transition count 118
Applied a total of 583 rules in 77 ms. Remains 100 /259 variables (removed 159) and now considering 118/749 (removed 631) transitions.
// Phase 1: matrix 118 rows 100 cols
[2025-06-05 20:54:59] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:54:59] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-05 20:54:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:00] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 20:55:00] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-05 20:55:00] [INFO ] Invariant cache hit.
[2025-06-05 20:55:00] [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/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:01] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/218 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:05] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:05] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:08] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 10 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/218 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:09] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (OVERLAPS) 0/218 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 171 constraints, problems are : Problem set: 0 solved, 117 unsolved in 13433 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 1/100 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:14] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:14] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:14] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:14] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 118/218 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 52/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 117/292 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:22] [INFO ] Deduced a trap along path composed of 4 places in 38 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/218 variables, and 293 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43595ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 43603ms
Starting structural reductions in LTL mode, iteration 1 : 100/259 places, 118/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44250 ms. Remains : 100/259 places, 118/749 transitions.
Support contains 4 out of 100 places after structural reductions.
[2025-06-05 20:55:43] [INFO ] Flatten gal took : 27 ms
[2025-06-05 20:55:44] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:55:44] [INFO ] Input system was already deterministic with 118 transitions.
RANDOM walk for 40000 steps (8938 resets) in 1339 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4240 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4107 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4094 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Probably explored full state space saw : 79659 states, properties seen :2
Probabilistic random walk after 204012 steps, saw 79659 distinct states, run finished after 807 ms. (steps per millisecond=252 ) properties seen :2
Explored full state space saw : 79659 states, properties seen :0
Exhaustive walk after 204012 steps, saw 79659 distinct states, run finished after 190 ms. (steps per millisecond=1073 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 321 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
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(F(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 96 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 96 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 95 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 94 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 94 transition count 111
Applied a total of 12 rules in 7 ms. Remains 94 /100 variables (removed 6) and now considering 111/118 (removed 7) transitions.
// Phase 1: matrix 111 rows 94 cols
[2025-06-05 20:55:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-05 20:55:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:55:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-05 20:55:46] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-06-05 20:55:46] [INFO ] Invariant cache hit.
[2025-06-05 20:55:46] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:48] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 111/205 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 49/162 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:50] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:51] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:51] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:51] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:51] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:54] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 8 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/205 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:55] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:58] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:58] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:55:58] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/205 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 18 (OVERLAPS) 0/205 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 173 constraints, problems are : Problem set: 0 solved, 110 unsolved in 17946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:04] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:04] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 111/205 variables, 94/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 49/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 110/285 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 285 constraints, problems are : Problem set: 0 solved, 110 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48013ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 48014ms
Starting structural reductions in LTL mode, iteration 1 : 94/100 places, 111/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48364 ms. Remains : 94/100 places, 111/118 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 finished in 48616 ms.
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' '!(G(F(p0)))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 94 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 94 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 94 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 90 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 90 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 87 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 85 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 83 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 82 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 82 transition count 87
Applied a total of 40 rules in 26 ms. Remains 82 /100 variables (removed 18) and now considering 87/118 (removed 31) transitions.
// Phase 1: matrix 87 rows 82 cols
[2025-06-05 20:56:34] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 20:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:34] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 20:56:34] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:56:34] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-05 20:56:34] [INFO ] Invariant cache hit.
[2025-06-05 20:56:34] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:35] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/169 variables, 82/92 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 34/126 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:37] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:56:37] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 128 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/169 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 34/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 86 unsolved in 17298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23827ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 23827ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/100 places, 87/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24059 ms. Remains : 82/100 places, 87/118 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09
Product exploration explored 100000 steps with 22461 reset in 218 ms.
Product exploration explored 100000 steps with 22534 reset in 142 ms.
Computed a total of 18 stabilizing places and 22 stable transitions
Graph (complete) has 256 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/82 stabilizing places and 22/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9030 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4185 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 119316 steps, run visited all 1 properties in 145 ms. (steps per millisecond=822 )
Probabilistic random walk after 119316 steps, saw 47970 distinct states, run finished after 153 ms. (steps per millisecond=779 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 87/87 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2025-06-05 20:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 20:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:56:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 20:56:59] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:56:59] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-05 20:56:59] [INFO ] Invariant cache hit.
[2025-06-05 20:56:59] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:00] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:00] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:00] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:00] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/169 variables, 82/92 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 34/126 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:57:03] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 128 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/169 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 34/128 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 86 unsolved in 17226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24019ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 24019ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24246 ms. Remains : 82/82 places, 87/87 transitions.
Computed a total of 18 stabilizing places and 22 stable transitions
Graph (complete) has 256 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/82 stabilizing places and 22/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9054 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4102 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 119316 steps, run visited all 1 properties in 139 ms. (steps per millisecond=858 )
Probabilistic random walk after 119316 steps, saw 47970 distinct states, run finished after 139 ms. (steps per millisecond=858 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22482 reset in 100 ms.
Product exploration explored 100000 steps with 22415 reset in 103 ms.
Built C files in :
/tmp/ltsmin11244733183027540156
[2025-06-05 20:57:24] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2025-06-05 20:57:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:57:24] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2025-06-05 20:57:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:57:24] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2025-06-05 20:57:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:57:24] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11244733183027540156
Running compilation step : cd /tmp/ltsmin11244733183027540156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin11244733183027540156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11244733183027540156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15963489509858537560.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 finished in 50838 ms.
All properties solved by simple procedures.
Total runtime 145945 ms.

BK_STOP 1749157045190

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

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