Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K 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 49K 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 1.1M 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-d2m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749176197983

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 02:16:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 02:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:16:39] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-06-06 02:16:39] [INFO ] Transformed 2398 places.
[2025-06-06 02:16:39] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:16:39] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 32 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 946 place count 296 transition count 763
Iterating global reduction 1 with 93 rules applied. Total rules applied 1039 place count 296 transition count 763
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1050 place count 296 transition count 752
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 1117 place count 229 transition count 685
Iterating global reduction 2 with 67 rules applied. Total rules applied 1184 place count 229 transition count 685
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1219 place count 229 transition count 650
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1241 place count 207 transition count 626
Iterating global reduction 3 with 22 rules applied. Total rules applied 1263 place count 207 transition count 626
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 1339 place count 207 transition count 550
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1346 place count 200 transition count 538
Iterating global reduction 4 with 7 rules applied. Total rules applied 1353 place count 200 transition count 538
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1360 place count 193 transition count 531
Iterating global reduction 4 with 7 rules applied. Total rules applied 1367 place count 193 transition count 531
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1371 place count 189 transition count 526
Iterating global reduction 4 with 4 rules applied. Total rules applied 1375 place count 189 transition count 526
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1377 place count 187 transition count 524
Iterating global reduction 4 with 2 rules applied. Total rules applied 1379 place count 187 transition count 524
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1381 place count 185 transition count 522
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 185 transition count 522
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1384 place count 184 transition count 521
Iterating global reduction 4 with 1 rules applied. Total rules applied 1385 place count 184 transition count 521
Applied a total of 1385 rules in 113 ms. Remains 184 /414 variables (removed 230) and now considering 521/1954 (removed 1433) transitions.
// Phase 1: matrix 521 rows 184 cols
[2025-06-06 02:16:39] [INFO ] Computed 5 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:40] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-06 02:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:40] [INFO ] State equation strengthened by 379 read => feed constraints.
[2025-06-06 02:16:41] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2025-06-06 02:16:41] [INFO ] Invariant cache hit.
[2025-06-06 02:16:42] [INFO ] State equation strengthened by 379 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:46] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:46] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:49] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:56] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:56] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:56] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:00] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:00] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Problem TDEAD463 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
At refinement iteration 9 (OVERLAPS) 521/705 variables, 184/198 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 379/577 constraints. Problems are: Problem set: 5 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 705/705 variables, and 577 constraints, problems are : Problem set: 5 solved, 515 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 184/184 constraints, ReadFeed: 379/379 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 3/181 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 3/9 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 7 (OVERLAPS) 2/183 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 4/14 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 10 (OVERLAPS) 520/703 variables, 183/197 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/703 variables, 378/575 constraints. Problems are: Problem set: 5 solved, 515 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 52/627 constraints. Problems are: Problem set: 5 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:39] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:40] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/705 variables, and 629 constraints, problems are : Problem set: 5 solved, 515 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/184 constraints, ReadFeed: 378/379 constraints, PredecessorRefiner: 52/520 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60739ms problems are : Problem set: 5 solved, 515 unsolved
Search for dead transitions found 5 dead transitions in 60754ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 184/414 places, 516/1954 transitions.
Reduce places removed 7 places and 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 177 transition count 510
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 175 transition count 508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 174 transition count 507
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 15 places and 359 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 159 transition count 148
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 72 place count 135 transition count 126
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 125 transition count 116
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 125 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 99 place count 125 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 123 transition count 107
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 123 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 121 transition count 105
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 121 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 120 transition count 104
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 120 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 119 transition count 103
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 119 transition count 103
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 111 rules in 16 ms. Remains 119 /184 variables (removed 65) and now considering 103/516 (removed 413) transitions.
// Phase 1: matrix 103 rows 119 cols
[2025-06-06 02:17:42] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:17:42] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-06 02:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:17:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-06 02:17:43] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/414 places, 103/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63689 ms. Remains : 119/414 places, 103/1954 transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Support contains 4 out of 94 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:17:43] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2025-06-06 02:17:43] [INFO ] Flatten gal took : 25 ms
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:17:43] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:17:43] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 3 out of 94 places (down from 4) after GAL structural reductions.
RANDOM walk for 40000 steps (8947 resets) in 1145 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1864 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Probably explored full state space saw : 1068 states, properties seen :1
Probabilistic random walk after 2542 steps, saw 1068 distinct states, run finished after 16 ms. (steps per millisecond=158 ) properties seen :1
Explored full state space saw : 1068 states, properties seen :0
Exhaustive walk after 2542 steps, saw 1068 distinct states, run finished after 6 ms. (steps per millisecond=423 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 94 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 103
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(F(p0)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 91 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 88 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 88 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 85 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 85 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 84 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 83 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 83 transition count 88
Applied a total of 25 rules in 7 ms. Remains 83 /94 variables (removed 11) and now considering 88/103 (removed 15) transitions.
// Phase 1: matrix 88 rows 83 cols
[2025-06-06 02:17:44] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:17:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 02:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:17:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-06 02:17:44] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-06 02:17:44] [INFO ] Invariant cache hit.
[2025-06-06 02:17:44] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:45] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:45] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:45] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:45] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 5 (OVERLAPS) 88/171 variables, 83/90 constraints. Problems are: Problem set: 9 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 31/121 constraints. Problems are: Problem set: 9 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/121 constraints. Problems are: Problem set: 9 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:47] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:47] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 5 ms to minimize.
Problem TDEAD66 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/171 variables, 2/123 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/123 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/123 constraints. Problems are: Problem set: 10 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 123 constraints, problems are : Problem set: 10 solved, 77 unsolved in 6212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/9 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 87/163 variables, 76/85 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 30/115 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 8/123 constraints. Problems are: Problem set: 10 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:17:51] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 1/124 constraints. Problems are: Problem set: 10 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/124 constraints. Problems are: Problem set: 10 solved, 77 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 10 (OVERLAPS) 8/171 variables, 7/131 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 1/132 constraints. Problems are: Problem set: 12 solved, 75 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 69/201 constraints. Problems are: Problem set: 14 solved, 73 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/201 constraints. Problems are: Problem set: 14 solved, 73 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/201 constraints. Problems are: Problem set: 14 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 201 constraints, problems are : Problem set: 14 solved, 73 unsolved in 13955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 77/87 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20204ms problems are : Problem set: 14 solved, 73 unsolved
Search for dead transitions found 14 dead transitions in 20208ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 83/94 places, 74/103 transitions.
Reduce places removed 20 places and 6 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 63 transition count 64
Reduce places removed 8 places and 8 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 33 place count 55 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 53 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 51 transition count 51
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 49 transition count 50
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 47 transition count 48
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 46 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 45 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 45 transition count 46
Applied a total of 48 rules in 12 ms. Remains 45 /83 variables (removed 38) and now considering 46/74 (removed 28) transitions.
// Phase 1: matrix 46 rows 45 cols
[2025-06-06 02:18:04] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:18:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 02:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:18:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-06 02:18:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/94 places, 46/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20655 ms. Remains : 45/94 places, 46/103 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m04-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 46
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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m04-LTLFireability-02 finished in 21434 ms.
All properties solved by simple procedures.
Total runtime 86371 ms.

BK_STOP 1749176285821

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-d2m04"
export BK_EXAMINATION="LTLFireability"
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-d2m04, examination is LTLFireability"
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-174901994400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;