Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809600052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809600052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716887447322

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:10:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:10:50] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-05-28 09:10:50] [INFO ] Transformed 1295 places.
[2024-05-28 09:10:50] [INFO ] Transformed 749 transitions.
[2024-05-28 09:10:50] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 735 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 39 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 302 place count 197 transition count 408
Iterating global reduction 1 with 45 rules applied. Total rules applied 347 place count 197 transition count 408
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 354 place count 197 transition count 401
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 382 place count 169 transition count 373
Iterating global reduction 2 with 28 rules applied. Total rules applied 410 place count 169 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 420 place count 169 transition count 363
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 436 place count 153 transition count 346
Iterating global reduction 3 with 16 rules applied. Total rules applied 452 place count 153 transition count 346
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 500 place count 153 transition count 298
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 504 place count 149 transition count 291
Iterating global reduction 4 with 4 rules applied. Total rules applied 508 place count 149 transition count 291
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 512 place count 145 transition count 287
Iterating global reduction 4 with 4 rules applied. Total rules applied 516 place count 145 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 518 place count 143 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 143 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 142 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 142 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 523 place count 141 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 524 place count 141 transition count 283
Applied a total of 524 rules in 288 ms. Remains 141 /259 variables (removed 118) and now considering 283/749 (removed 466) transitions.
// Phase 1: matrix 283 rows 141 cols
[2024-05-28 09:10:51] [INFO ] Computed 5 invariants in 43 ms
[2024-05-28 09:10:52] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-28 09:10:52] [INFO ] Invariant cache hit.
[2024-05-28 09:10:52] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-05-28 09:10:53] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-28 09:10:53] [INFO ] Invariant cache hit.
[2024-05-28 09:10:53] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 21 ms to minimize.
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-05-28 09:10:59] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 3 ms to minimize.
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-28 09:11:03] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Problem TDEAD239 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 8 (OVERLAPS) 283/424 variables, 141/158 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 185/343 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 343 constraints, problems are : Problem set: 2 solved, 280 unsolved in 27019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 2 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/7 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 2/140 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 2 solved, 280 unsolved
[2024-05-28 09:11:24] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 3 ms to minimize.
[2024-05-28 09:11:25] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:11:25] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 3/20 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 282/422 variables, 140/160 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 184/344 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 41/385 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 280 unsolved
Problem TDEAD238 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
At refinement iteration 12 (OVERLAPS) 2/424 variables, 1/386 constraints. Problems are: Problem set: 29 solved, 253 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 1/387 constraints. Problems are: Problem set: 29 solved, 253 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 239/626 constraints. Problems are: Problem set: 29 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 626 constraints, problems are : Problem set: 29 solved, 253 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 280/282 constraints, Known Traps: 15/15 constraints]
After SMT, in 58274ms problems are : Problem set: 29 solved, 253 unsolved
Search for dead transitions found 29 dead transitions in 58307ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 141/259 places, 254/749 transitions.
Reduce places removed 38 places and 151 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 103 transition count 93
Reduce places removed 14 places and 16 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 62 place count 89 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 87 transition count 75
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 85 transition count 71
Reduce places removed 3 places and 4 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 82 transition count 67
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 81 transition count 66
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 81 transition count 66
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 71 rules in 7 ms. Remains 81 /141 variables (removed 60) and now considering 66/254 (removed 188) transitions.
// Phase 1: matrix 66 rows 81 cols
[2024-05-28 09:11:51] [INFO ] Computed 21 invariants in 3 ms
[2024-05-28 09:11:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 09:11:51] [INFO ] Invariant cache hit.
[2024-05-28 09:11:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 09:11:51] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/259 places, 66/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60610 ms. Remains : 81/259 places, 66/749 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Support contains 3 out of 63 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:11:52] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 09:11:52] [INFO ] Flatten gal took : 45 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:11:52] [INFO ] Flatten gal took : 18 ms
[2024-05-28 09:11:52] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 40000 steps (9034 resets) in 1186 ms. (33 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (4116 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 09:11:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 09:11:52] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/95 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/125 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/129 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/129 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/95 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/125 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/129 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/129 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 66/66 transitions.
Graph (complete) has 158 edges and 63 vertex of which 59 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 59 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 55 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 55 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 56
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 53 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 53 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 51 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 51 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 49 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 49 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 49 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 48 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 48 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 47 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 46 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 45 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 45 transition count 44
Applied a total of 35 rules in 32 ms. Remains 45 /63 variables (removed 18) and now considering 44/66 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 45/63 places, 44/66 transitions.
RANDOM walk for 40000 steps (8960 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4107 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 696 steps, run visited all 1 properties in 13 ms. (steps per millisecond=53 )
Probabilistic random walk after 696 steps, saw 326 distinct states, run finished after 18 ms. (steps per millisecond=38 ) properties seen :1
Computed a total of 63 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 66
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Graph (complete) has 184 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 58 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 58 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 56 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 56 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 54 transition count 55
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 54 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 52 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 52 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 52 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 51 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 51 transition count 51
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 50 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 49 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 48 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 48 transition count 47
Applied a total of 32 rules in 26 ms. Remains 48 /63 variables (removed 15) and now considering 47/66 (removed 19) transitions.
// Phase 1: matrix 47 rows 48 cols
[2024-05-28 09:11:53] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 09:11:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:11:53] [INFO ] Invariant cache hit.
[2024-05-28 09:11:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 09:11:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 09:11:53] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-28 09:11:53] [INFO ] Invariant cache hit.
[2024-05-28 09:11:53] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/95 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 68 constraints, problems are : Problem set: 0 solved, 46 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/95 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 46/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 114 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2130ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/63 places, 47/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2384 ms. Remains : 48/63 places, 47/66 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-02 finished in 2691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Graph (complete) has 184 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 58 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 58 transition count 59
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 55 transition count 56
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 55 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 52 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 52 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 52 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 50 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 49 transition count 48
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 48 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 48 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 47 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 47 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 46 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 46 transition count 44
Applied a total of 37 rules in 23 ms. Remains 46 /63 variables (removed 17) and now considering 44/66 (removed 22) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 09:11:56] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 09:11:56] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 09:11:56] [INFO ] Invariant cache hit.
[2024-05-28 09:11:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 09:11:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-28 09:11:56] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-28 09:11:56] [INFO ] Invariant cache hit.
[2024-05-28 09:11:56] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/90 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 65 constraints, problems are : Problem set: 0 solved, 43 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/90 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 43/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 108 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 2123ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/63 places, 44/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2352 ms. Remains : 46/63 places, 44/66 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-06
Product exploration explored 100000 steps with 22413 reset in 280 ms.
Product exploration explored 100000 steps with 22371 reset in 220 ms.
Computed a total of 46 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
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 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-06 finished in 2998 ms.
All properties solved by simple procedures.
Total runtime 69009 ms.
ITS solved all properties within timeout

BK_STOP 1716887519353

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d1m04, 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 r377-smll-171683809600052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;