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-171683810600012.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-d0m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 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 57K 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-d0m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716876631088

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 06:10:33] [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 06:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:10:34] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-28 06:10:34] [INFO ] Transformed 262 places.
[2024-05-28 06:10:34] [INFO ] Transformed 73 transitions.
[2024-05-28 06:10:34] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 53 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-05-28 06:10:34] [INFO ] Computed 5 invariants in 25 ms
[2024-05-28 06:10:35] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 06:10:35] [INFO ] Invariant cache hit.
[2024-05-28 06:10:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:10:35] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-28 06:10:35] [INFO ] Invariant cache hit.
[2024-05-28 06:10:35] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 19 ms to minimize.
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:10:37] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-28 06:10:37] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:10:38] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 108 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5857 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 10996ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 11031ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11866 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 29 out of 68 places after structural reductions.
[2024-05-28 06:10:46] [INFO ] Flatten gal took : 68 ms
[2024-05-28 06:10:46] [INFO ] Flatten gal took : 22 ms
[2024-05-28 06:10:46] [INFO ] Input system was already deterministic with 71 transitions.
RANDOM walk for 40000 steps (8994 resets) in 2731 ms. (14 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4004 steps (196 resets) in 63 ms. (62 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (191 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (123 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (417 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (392 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (199 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (424 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (184 resets) in 76 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (164 resets) in 79 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (430 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (196 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (197 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (124 resets) in 15 ms. (250 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (395 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (399 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (204 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (203 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2024-05-28 06:10:48] [INFO ] Invariant cache hit.
[2024-05-28 06:10:48] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/55 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/63 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 70/133 variables, 63/69 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 28/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/139 variables, 5/102 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 103 constraints, problems are : Problem set: 3 solved, 12 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/62 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 70/132 variables, 62/68 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 28/96 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 3/99 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 7/139 variables, 6/105 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/106 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 9/115 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-05-28 06:10:49] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/139 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 116 constraints, problems are : Problem set: 3 solved, 12 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 1984ms problems are : Problem set: 3 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 3531 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 69
Applied a total of 4 rules in 13 ms. Remains 66 /68 variables (removed 2) and now considering 69/71 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 66/68 places, 69/71 transitions.
RANDOM walk for 40000 steps (8969 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1236 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4106 resets) in 285 ms. (139 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1940 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4164 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4105 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4213 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4070 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1889 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
Probably explored full state space saw : 24707 states, properties seen :11
Probabilistic random walk after 63878 steps, saw 24707 distinct states, run finished after 184 ms. (steps per millisecond=347 ) properties seen :11
Explored full state space saw : 24707 states, properties seen :0
Exhaustive walk after 63878 steps, saw 24707 distinct states, run finished after 83 ms. (steps per millisecond=769 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 29 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:10:55] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 06:10:55] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 06:10:55] [INFO ] Invariant cache hit.
[2024-05-28 06:10:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:55] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-28 06:10:55] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:10:55] [INFO ] Invariant cache hit.
[2024-05-28 06:10:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:56] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 06:10:56] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:10:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:10:56] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-28 06:10:56] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:10:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7065ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7491 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 finished in 7896 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(X((G(p0) U !p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 9 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 06:11:03] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 06:11:03] [INFO ] Invariant cache hit.
[2024-05-28 06:11:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:11:03] [INFO ] Invariant cache hit.
[2024-05-28 06:11:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-28 06:11:05] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:11:05] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:05] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:07] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 7122ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7124ms
Starting structural reductions in LTL mode, iteration 1 : 62/68 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7444 ms. Remains : 62/68 places, 65/71 transitions.
Stuttering acceptance computed with spot in 239 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
Product exploration explored 100000 steps with 28580 reset in 492 ms.
Product exploration explored 100000 steps with 28589 reset in 316 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[p1, p1, p1, p1, true, (NOT p0)]
RANDOM walk for 40000 steps (8954 resets) in 590 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4067 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4049 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4112 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4137 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
Probably explored full state space saw : 19961 states, properties seen :3
Probabilistic random walk after 50793 steps, saw 19961 distinct states, run finished after 94 ms. (steps per millisecond=540 ) properties seen :3
Explored full state space saw : 19961 states, properties seen :0
Exhaustive walk after 50793 steps, saw 19961 distinct states, run finished after 60 ms. (steps per millisecond=846 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:13] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:15] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:11:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:15] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3487 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 7636ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7638ms
Finished structural reductions in LTL mode , in 1 iterations and 7926 ms. Remains : 62/62 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (8950 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31724 steps (3294 resets) in 96 ms. (327 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 28605 reset in 159 ms.
Product exploration explored 100000 steps with 28572 reset in 396 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 220 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 60 transition count 62
Applied a total of 5 rules in 20 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-05-28 06:11:23] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:11:23] [INFO ] Computed 5 invariants in 5 ms
[2024-05-28 06:11:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 157 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 6648ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 6650ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6679 ms. Remains : 60/62 places, 62/65 transitions.
Built C files in :
/tmp/ltsmin9449927940475048358
[2024-05-28 06:11:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9449927940475048358
Running compilation step : cd /tmp/ltsmin9449927940475048358;'/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 724 ms.
Running link step : cd /tmp/ltsmin9449927940475048358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin9449927940475048358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4246349964942178733.hoa' '--buchi-type=spotba'
LTSmin run took 190 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 28479 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(p0)&&X((G(p1)||X(X(F(p2))))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 61 transition count 63
Applied a total of 15 rules in 11 ms. Remains 61 /68 variables (removed 7) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:11:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:11:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 06:11:31] [INFO ] Invariant cache hit.
[2024-05-28 06:11:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:31] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:11:31] [INFO ] Invariant cache hit.
[2024-05-28 06:11:31] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:11:32] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:11:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 99 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 62/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 161 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
After SMT, in 6923ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6925ms
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 63/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7253 ms. Remains : 61/68 places, 63/71 transitions.
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 7795 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(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 11 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:11:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:11:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 06:11:39] [INFO ] Invariant cache hit.
[2024-05-28 06:11:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:39] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:39] [INFO ] Invariant cache hit.
[2024-05-28 06:11:39] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:40] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:11:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:11:40] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:11:40] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:11:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 06:11:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7142ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7144ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7524 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 finished in 7633 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 11 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:11:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:11:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 06:11:47] [INFO ] Invariant cache hit.
[2024-05-28 06:11:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:47] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-28 06:11:47] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:11:47] [INFO ] Invariant cache hit.
[2024-05-28 06:11:47] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7717ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8033 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
Product exploration explored 100000 steps with 22445 reset in 307 ms.
Product exploration explored 100000 steps with 22412 reset in 360 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8863 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29138 steps (1391 resets) in 46 ms. (619 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 06:11:56] [INFO ] Invariant cache hit.
[2024-05-28 06:11:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 06:11:56] [INFO ] Invariant cache hit.
[2024-05-28 06:11:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:56] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-28 06:11:56] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:11:56] [INFO ] Invariant cache hit.
[2024-05-28 06:11:56] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7802ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7804ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8084 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8947 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1935 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 144 steps, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Probabilistic random walk after 144 steps, saw 85 distinct states, run finished after 18 ms. (steps per millisecond=8 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22381 reset in 125 ms.
Product exploration explored 100000 steps with 22287 reset in 218 ms.
Built C files in :
/tmp/ltsmin17711178939400202230
[2024-05-28 06:12:05] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-28 06:12:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:05] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-28 06:12:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:05] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-28 06:12:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:05] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17711178939400202230
Running compilation step : cd /tmp/ltsmin17711178939400202230;'/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 408 ms.
Running link step : cd /tmp/ltsmin17711178939400202230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17711178939400202230;'/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/stateBased15964080874101400942.hoa' '--buchi-type=spotba'
LTSmin run took 291 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 finished in 18895 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&&X(F(p1)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 3 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:12:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:12:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 06:12:05] [INFO ] Invariant cache hit.
[2024-05-28 06:12:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:06] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:12:06] [INFO ] Invariant cache hit.
[2024-05-28 06:12:06] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:12:06] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2922 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3510 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 6468ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 6468ms
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6672 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 finished in 6838 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((p0||X(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:12:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:12:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 06:12:12] [INFO ] Invariant cache hit.
[2024-05-28 06:12:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:13] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-28 06:12:13] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:12:13] [INFO ] Invariant cache hit.
[2024-05-28 06:12:13] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:13] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7004ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7005ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7293 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 7426 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)) U (p1 U p2)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 13 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:12:20] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:12:20] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 06:12:20] [INFO ] Invariant cache hit.
[2024-05-28 06:12:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:20] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-28 06:12:20] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:12:20] [INFO ] Invariant cache hit.
[2024-05-28 06:12:20] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:22] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:12:24] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:12:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints]
After SMT, in 7869ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7870ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8227 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 finished in 8376 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)&&F(p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Applied a total of 14 rules in 7 ms. Remains 61 /68 variables (removed 7) and now considering 64/71 (removed 7) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-28 06:12:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:12:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 06:12:28] [INFO ] Invariant cache hit.
[2024-05-28 06:12:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:12:28] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-28 06:12:28] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-28 06:12:28] [INFO ] Invariant cache hit.
[2024-05-28 06:12:28] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:12:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:12:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:12:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:12:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:12:29] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:12:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 98 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 63/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 161 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
After SMT, in 5990ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5991ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 64/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6234 ms. Remains : 61/68 places, 64/71 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 6408 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 17 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:12:34] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 06:12:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 06:12:35] [INFO ] Invariant cache hit.
[2024-05-28 06:12:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:35] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-28 06:12:35] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:12:35] [INFO ] Invariant cache hit.
[2024-05-28 06:12:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:12:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6470ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6472ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6819 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
Product exploration explored 100000 steps with 22395 reset in 158 ms.
Product exploration explored 100000 steps with 22310 reset in 359 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:12:42] [INFO ] Invariant cache hit.
[2024-05-28 06:12:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 06:12:42] [INFO ] Invariant cache hit.
[2024-05-28 06:12:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:43] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-28 06:12:43] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:12:43] [INFO ] Invariant cache hit.
[2024-05-28 06:12:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:43] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:12:43] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:12:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:12:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:12:44] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:12:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2997 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6749ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7019 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22432 reset in 104 ms.
Product exploration explored 100000 steps with 22329 reset in 126 ms.
Built C files in :
/tmp/ltsmin16039214820415298188
[2024-05-28 06:12:50] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-28 06:12:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:50] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-28 06:12:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:50] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-28 06:12:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:12:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16039214820415298188
Running compilation step : cd /tmp/ltsmin16039214820415298188;'/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 283 ms.
Running link step : cd /tmp/ltsmin16039214820415298188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16039214820415298188;'/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/stateBased14419243450212553268.hoa' '--buchi-type=spotba'
LTSmin run took 1857 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 17771 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)&&F(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-05-28 06:12:52] [INFO ] Invariant cache hit.
[2024-05-28 06:12:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 06:12:52] [INFO ] Invariant cache hit.
[2024-05-28 06:12:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:12:52] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-28 06:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:12:52] [INFO ] Invariant cache hit.
[2024-05-28 06:12:52] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:12:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:12:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-28 06:12:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-28 06:12:53] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:12:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:12:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7379ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7577 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-15
Product exploration explored 100000 steps with 22535 reset in 303 ms.
Product exploration explored 100000 steps with 22312 reset in 357 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8910 resets) in 92 ms. (430 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-05-28 06:13:01] [INFO ] Invariant cache hit.
[2024-05-28 06:13:01] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:13:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 58 transition count 59
Applied a total of 3 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8950 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 10 ms. (steps per millisecond=116 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 11 ms. (steps per millisecond=105 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:13:02] [INFO ] Invariant cache hit.
[2024-05-28 06:13:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 06:13:02] [INFO ] Invariant cache hit.
[2024-05-28 06:13:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:13:02] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-28 06:13:02] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:13:02] [INFO ] Invariant cache hit.
[2024-05-28 06:13:02] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6449ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6781 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8960 resets) in 43 ms. (909 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-28 06:13:09] [INFO ] Invariant cache hit.
[2024-05-28 06:13:09] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:13:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 58 transition count 59
Applied a total of 3 rules in 9 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8943 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1993 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 7 ms. (steps per millisecond=165 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22378 reset in 114 ms.
Product exploration explored 100000 steps with 22409 reset in 124 ms.
Built C files in :
/tmp/ltsmin15309953606587403565
[2024-05-28 06:13:10] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-28 06:13:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:13:10] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-28 06:13:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:13:10] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-28 06:13:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:13:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15309953606587403565
Running compilation step : cd /tmp/ltsmin15309953606587403565;'/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 359 ms.
Running link step : cd /tmp/ltsmin15309953606587403565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15309953606587403565;'/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/stateBased15339417013733965552.hoa' '--buchi-type=spotba'
LTSmin run took 537 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 finished in 18912 ms.
All properties solved by simple procedures.
Total runtime 157908 ms.

BK_STOP 1716876791689

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

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