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.r378-smll-171683810700060.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 itstools
Input is SieveSingleMsgMbox-PT-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 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-d1m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716896569443

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 11:42:51] [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]
[2024-05-28 11:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:42:52] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2024-05-28 11:42:52] [INFO ] Transformed 1295 places.
[2024-05-28 11:42:52] [INFO ] Transformed 749 transitions.
[2024-05-28 11:42:52] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 583 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 21 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 300 place count 199 transition count 414
Iterating global reduction 1 with 43 rules applied. Total rules applied 343 place count 199 transition count 414
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 349 place count 199 transition count 408
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 374 place count 174 transition count 383
Iterating global reduction 2 with 25 rules applied. Total rules applied 399 place count 174 transition count 383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 408 place count 174 transition count 374
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 421 place count 161 transition count 360
Iterating global reduction 3 with 13 rules applied. Total rules applied 434 place count 161 transition count 360
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 494 place count 161 transition count 300
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 496 place count 159 transition count 296
Iterating global reduction 4 with 2 rules applied. Total rules applied 498 place count 159 transition count 296
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 500 place count 157 transition count 294
Iterating global reduction 4 with 2 rules applied. Total rules applied 502 place count 157 transition count 294
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 503 place count 156 transition count 293
Iterating global reduction 4 with 1 rules applied. Total rules applied 504 place count 156 transition count 293
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 505 place count 155 transition count 292
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 155 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 507 place count 154 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 154 transition count 291
Applied a total of 508 rules in 155 ms. Remains 154 /259 variables (removed 105) and now considering 291/749 (removed 458) transitions.
// Phase 1: matrix 291 rows 154 cols
[2024-05-28 11:42:53] [INFO ] Computed 5 invariants in 40 ms
[2024-05-28 11:42:53] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-28 11:42:53] [INFO ] Invariant cache hit.
[2024-05-28 11:42:53] [INFO ] State equation strengthened by 184 read => feed constraints.
[2024-05-28 11:42:54] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-28 11:42:54] [INFO ] Invariant cache hit.
[2024-05-28 11:42:55] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-28 11:43:03] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 31 ms to minimize.
[2024-05-28 11:43:04] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 4 ms to minimize.
[2024-05-28 11:43:04] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-05-28 11:43:04] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
[2024-05-28 11:43:04] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-05-28 11:43:04] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 291/445 variables, 154/165 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-28 11:43:12] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 1/350 constraints. Problems are: Problem set: 3 solved, 287 unsolved
[2024-05-28 11:43:21] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 1/351 constraints. Problems are: Problem set: 3 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 351 constraints, problems are : Problem set: 3 solved, 287 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 154/154 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 4/154 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 6/13 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 291/445 variables, 154/167 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 184/351 constraints. Problems are: Problem set: 3 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 287/638 constraints. Problems are: Problem set: 3 solved, 287 unsolved
[2024-05-28 11:43:40] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:43:42] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 2/640 constraints. Problems are: Problem set: 3 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 640 constraints, problems are : Problem set: 3 solved, 287 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 154/154 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 287/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 61517ms problems are : Problem set: 3 solved, 287 unsolved
Search for dead transitions found 3 dead transitions in 61559ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 154/259 places, 288/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 151 transition count 288
Applied a total of 3 rules in 9 ms. Remains 151 /154 variables (removed 3) and now considering 288/288 (removed 0) transitions.
// Phase 1: matrix 288 rows 151 cols
[2024-05-28 11:43:56] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 11:43:56] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-28 11:43:56] [INFO ] Invariant cache hit.
[2024-05-28 11:43:56] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-28 11:43:57] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/259 places, 288/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65185 ms. Remains : 151/259 places, 288/749 transitions.
Support contains 28 out of 151 places after structural reductions.
[2024-05-28 11:43:58] [INFO ] Flatten gal took : 102 ms
[2024-05-28 11:43:58] [INFO ] Flatten gal took : 52 ms
[2024-05-28 11:43:58] [INFO ] Input system was already deterministic with 288 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (8964 resets) in 4597 ms. (8 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (182 resets) in 81 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (418 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (187 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (166 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (192 resets) in 75 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (184 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (192 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (181 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (178 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (203 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (195 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (198 resets) in 76 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (413 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (173 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (190 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (196 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (180 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (205 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (192 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (176 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (187 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 287083 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :18 out of 23
Probabilistic random walk after 287083 steps, saw 113521 distinct states, run finished after 3011 ms. (steps per millisecond=95 ) properties seen :18
[2024-05-28 11:44:03] [INFO ] Invariant cache hit.
[2024-05-28 11:44:03] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 164/277 variables, 113/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 59/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp22 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 162/439 variables, 38/215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 124/339 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/339 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/439 variables, 0/339 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 339 constraints, problems are : Problem set: 2 solved, 3 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 151/151 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/112 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 155/267 variables, 112/117 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 50/167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 172/439 variables, 39/206 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 133/339 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 3/342 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/439 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 342 constraints, problems are : Problem set: 2 solved, 3 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 151/151 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1662ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 333 ms.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 288/288 transitions.
Graph (complete) has 521 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 150 transition count 286
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 131 transition count 163
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 131 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 131 transition count 161
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 59 place count 115 transition count 145
Iterating global reduction 2 with 16 rules applied. Total rules applied 75 place count 115 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 84 place count 115 transition count 136
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 106 transition count 126
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 106 transition count 126
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 106 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 102 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 102 transition count 117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 98 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 98 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 96 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 96 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 96 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 131 place count 94 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 94 transition count 107
Applied a total of 133 rules in 85 ms. Remains 94 /151 variables (removed 57) and now considering 107/288 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 94/151 places, 107/288 transitions.
RANDOM walk for 40000 steps (8952 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1962 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1891 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1937 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 126313 steps, run visited all 3 properties in 934 ms. (steps per millisecond=135 )
Probabilistic random walk after 126313 steps, saw 50767 distinct states, run finished after 946 ms. (steps per millisecond=133 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 66 stable transitions
Graph (complete) has 578 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 131 transition count 165
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 113 transition count 146
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 113 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 113 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 102 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 102 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 115 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 98 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 94 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 92 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 90 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 88 transition count 103
Applied a total of 145 rules in 35 ms. Remains 88 /151 variables (removed 63) and now considering 103/288 (removed 185) transitions.
// Phase 1: matrix 103 rows 88 cols
[2024-05-28 11:44:07] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:44:07] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 11:44:07] [INFO ] Invariant cache hit.
[2024-05-28 11:44:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 11:44:07] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-28 11:44:07] [INFO ] Invariant cache hit.
[2024-05-28 11:44:07] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 11:44:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 11:44:11] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-28 11:44:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:44:11] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 142 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 11:44:16] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 103/191 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 46/143 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 102/245 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 245 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 5/5 constraints]
After SMT, in 17488ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 17493ms
Starting structural reductions in LTL mode, iteration 1 : 88/151 places, 103/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18042 ms. Remains : 88/151 places, 103/288 transitions.
Stuttering acceptance computed with spot in 478 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 finished in 18641 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' '!(X(X(F((G(p1)||p0)))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 131 transition count 165
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 114 transition count 147
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 114 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 114 transition count 139
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 95 place count 104 transition count 129
Iterating global reduction 2 with 10 rules applied. Total rules applied 105 place count 104 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 100 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 100 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 96 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 96 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 94 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 94 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 92 transition count 109
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 92 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 91 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 90 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 90 transition count 107
Applied a total of 140 rules in 29 ms. Remains 90 /151 variables (removed 61) and now considering 107/288 (removed 181) transitions.
// Phase 1: matrix 107 rows 90 cols
[2024-05-28 11:44:25] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:44:26] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 11:44:26] [INFO ] Invariant cache hit.
[2024-05-28 11:44:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 11:44:26] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-28 11:44:26] [INFO ] Invariant cache hit.
[2024-05-28 11:44:26] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 11:44:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/197 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 11:44:29] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:44:30] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:44:30] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 146 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 1/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 107/197 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 48/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 106/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 252 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints]
After SMT, in 16673ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16676ms
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 107/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17206 ms. Remains : 90/151 places, 107/288 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 522 ms.
Product exploration explored 100000 steps with 33333 reset in 421 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 288 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 22 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 finished in 18351 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' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 132 transition count 168
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 115 transition count 151
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 115 transition count 151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 115 transition count 143
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 105 transition count 132
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 105 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 105 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 102 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 99 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 99 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 98 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 98 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 98 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 97 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 97 transition count 116
Applied a total of 125 rules in 32 ms. Remains 97 /151 variables (removed 54) and now considering 116/288 (removed 172) transitions.
// Phase 1: matrix 116 rows 97 cols
[2024-05-28 11:44:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:44:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 11:44:44] [INFO ] Invariant cache hit.
[2024-05-28 11:44:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 11:44:44] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-28 11:44:44] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-28 11:44:44] [INFO ] Invariant cache hit.
[2024-05-28 11:44:44] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:44:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/213 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 53/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 155 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/213 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 53/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:44:55] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:44:55] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 272 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 3/3 constraints]
After SMT, in 19467ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 19469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/151 places, 116/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19836 ms. Remains : 97/151 places, 116/288 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 finished in 20038 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' '!(X(X(F(p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 130 transition count 164
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 62 place count 113 transition count 146
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 113 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 113 transition count 139
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 96 place count 103 transition count 128
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 103 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 103 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 100 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 100 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 97 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 97 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 96 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 96 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 95 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 94 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 94 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 93 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 93 transition count 112
Applied a total of 131 rules in 20 ms. Remains 93 /151 variables (removed 58) and now considering 112/288 (removed 176) transitions.
// Phase 1: matrix 112 rows 93 cols
[2024-05-28 11:45:04] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:45:04] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 11:45:04] [INFO ] Invariant cache hit.
[2024-05-28 11:45:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 11:45:04] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-28 11:45:04] [INFO ] Invariant cache hit.
[2024-05-28 11:45:04] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 11:45:07] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/205 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 51/149 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 11:45:08] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-28 11:45:09] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 151 constraints, problems are : Problem set: 0 solved, 111 unsolved in 8518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 112/205 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 262 constraints, problems are : Problem set: 0 solved, 111 unsolved in 9554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints]
After SMT, in 18249ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 18252ms
Starting structural reductions in LTL mode, iteration 1 : 93/151 places, 112/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18809 ms. Remains : 93/151 places, 112/288 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 298 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 finished in 19241 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' '!(X((F(G(p0))&&F(p1))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 161
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 130 transition count 157
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 64 place count 112 transition count 138
Iterating global reduction 1 with 18 rules applied. Total rules applied 82 place count 112 transition count 138
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 91 place count 112 transition count 129
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 102 place count 101 transition count 117
Iterating global reduction 2 with 11 rules applied. Total rules applied 113 place count 101 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 101 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 96 transition count 106
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 132 place count 93 transition count 103
Iterating global reduction 3 with 3 rules applied. Total rules applied 135 place count 93 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 92 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 92 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 92 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 91 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 91 transition count 100
Applied a total of 140 rules in 18 ms. Remains 91 /151 variables (removed 60) and now considering 100/288 (removed 188) transitions.
// Phase 1: matrix 100 rows 91 cols
[2024-05-28 11:45:23] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:45:23] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 11:45:23] [INFO ] Invariant cache hit.
[2024-05-28 11:45:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 11:45:23] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-28 11:45:23] [INFO ] Invariant cache hit.
[2024-05-28 11:45:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-28 11:45:25] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-28 11:45:25] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 100/191 variables, 91/97 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-28 11:45:27] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:45:27] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 11:45:27] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 141 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/191 variables, 91/100 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 99/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-28 11:45:34] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:45:35] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 242 constraints, problems are : Problem set: 0 solved, 99 unsolved in 12770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 7/7 constraints]
After SMT, in 20382ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 20383ms
Starting structural reductions in LTL mode, iteration 1 : 91/151 places, 100/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20742 ms. Remains : 91/151 places, 100/288 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-10
Stuttering criterion allowed to conclude after 20 steps with 4 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 finished in 21002 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' '!(X(X(F(((G(p1) U G(p2))||p0)))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 132 transition count 182
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 116 transition count 165
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 116 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 116 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 106 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 106 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 106 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 103 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 100 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 100 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 99 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 99 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 98 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 98 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 97 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 96 transition count 131
Applied a total of 125 rules in 14 ms. Remains 96 /151 variables (removed 55) and now considering 131/288 (removed 157) transitions.
// Phase 1: matrix 131 rows 96 cols
[2024-05-28 11:45:44] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:45:44] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 11:45:44] [INFO ] Invariant cache hit.
[2024-05-28 11:45:44] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 11:45:45] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-28 11:45:45] [INFO ] Invariant cache hit.
[2024-05-28 11:45:45] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 11:45:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/227 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 69/170 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 11:45:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 11 ms to minimize.
[2024-05-28 11:45:50] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 3 ms to minimize.
[2024-05-28 11:45:51] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 173 constraints, problems are : Problem set: 0 solved, 130 unsolved in 10605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 1/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 131/227 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 69/173 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 130/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 303 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 4/4 constraints]
After SMT, in 23495ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 23497ms
Starting structural reductions in LTL mode, iteration 1 : 96/151 places, 131/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24080 ms. Remains : 96/151 places, 131/288 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 233 ms.
Product exploration explored 100000 steps with 33333 reset in 256 ms.
Computed a total of 16 stabilizing places and 23 stable transitions
Graph (complete) has 321 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 finished in 24777 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' '!(X(G((G(p0)||X(F(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 131 transition count 173
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 114 transition count 155
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 114 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 114 transition count 148
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 104 transition count 137
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 104 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 104 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 101 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 101 transition count 129
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 98 transition count 126
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 98 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 96 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 96 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 96 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 92 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 92 transition count 116
Applied a total of 136 rules in 11 ms. Remains 92 /151 variables (removed 59) and now considering 116/288 (removed 172) transitions.
// Phase 1: matrix 116 rows 92 cols
[2024-05-28 11:46:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:46:09] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 11:46:09] [INFO ] Invariant cache hit.
[2024-05-28 11:46:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 11:46:09] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-28 11:46:09] [INFO ] Invariant cache hit.
[2024-05-28 11:46:09] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-28 11:46:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 116/208 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 56/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 271 constraints, problems are : Problem set: 0 solved, 115 unsolved in 14283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints]
After SMT, in 20632ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 20635ms
Starting structural reductions in LTL mode, iteration 1 : 92/151 places, 116/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21148 ms. Remains : 92/151 places, 116/288 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-13
Product exploration explored 100000 steps with 22369 reset in 226 ms.
Product exploration explored 100000 steps with 22415 reset in 245 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 300 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8951 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1980 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2688 steps, run visited all 2 properties in 37 ms. (steps per millisecond=72 )
Probabilistic random walk after 2688 steps, saw 1339 distinct states, run finished after 38 ms. (steps per millisecond=70 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-28 11:46:31] [INFO ] Invariant cache hit.
[2024-05-28 11:46:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 11:46:31] [INFO ] Invariant cache hit.
[2024-05-28 11:46:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 11:46:32] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-28 11:46:32] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-28 11:46:32] [INFO ] Invariant cache hit.
[2024-05-28 11:46:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:33] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 116/208 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 56/155 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 11:46:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 271 constraints, problems are : Problem set: 0 solved, 115 unsolved in 13395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints]
After SMT, in 21011ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 21012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21363 ms. Remains : 92/92 places, 116/116 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 300 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8982 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1959 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2688 steps, run visited all 2 properties in 22 ms. (steps per millisecond=122 )
Probabilistic random walk after 2688 steps, saw 1339 distinct states, run finished after 23 ms. (steps per millisecond=116 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22416 reset in 223 ms.
Product exploration explored 100000 steps with 22505 reset in 237 ms.
Built C files in :
/tmp/ltsmin13100947291026300481
[2024-05-28 11:46:54] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-28 11:46:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:46:54] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-28 11:46:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:46:54] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-28 11:46:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:46:54] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13100947291026300481
Running compilation step : cd /tmp/ltsmin13100947291026300481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1004 ms.
Running link step : cd /tmp/ltsmin13100947291026300481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin13100947291026300481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15514194208620254061.hoa' '--buchi-type=spotba'
LTSmin run took 609 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 finished in 46963 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 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 288/288 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 130 transition count 164
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 112 transition count 145
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 112 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 112 transition count 137
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 100 place count 101 transition count 125
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 101 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 117 place count 101 transition count 119
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 97 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 97 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 93 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 93 transition count 111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 91 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 89 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 87 transition count 102
Applied a total of 147 rules in 44 ms. Remains 87 /151 variables (removed 64) and now considering 102/288 (removed 186) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 11:46:56] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:46:56] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 11:46:56] [INFO ] Invariant cache hit.
[2024-05-28 11:46:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 11:46:56] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-28 11:46:56] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 11:46:56] [INFO ] Invariant cache hit.
[2024-05-28 11:46:56] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 11:46:58] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 11:46:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:47:00] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:47:00] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints]
After SMT, in 15143ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 15146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/151 places, 102/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15596 ms. Remains : 87/151 places, 102/288 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 finished in 15671 ms.
All properties solved by simple procedures.
Total runtime 260134 ms.

BK_STOP 1716896832054

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d1m06"
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-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r378-smll-171683810700060"
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 [ "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 ;