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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716903601243

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-d1m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 13:40:03] [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 13:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:40:03] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-05-28 13:40:03] [INFO ] Transformed 1295 places.
[2024-05-28 13:40:03] [INFO ] Transformed 749 transitions.
[2024-05-28 13:40:03] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 370
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 361 place count 193 transition count 364
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 392 place count 162 transition count 333
Iterating global reduction 2 with 31 rules applied. Total rules applied 423 place count 162 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 436 place count 162 transition count 320
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 453 place count 145 transition count 302
Iterating global reduction 3 with 17 rules applied. Total rules applied 470 place count 145 transition count 302
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 519 place count 145 transition count 253
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 522 place count 142 transition count 249
Iterating global reduction 4 with 3 rules applied. Total rules applied 525 place count 142 transition count 249
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 139 transition count 246
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 139 transition count 246
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 533 place count 137 transition count 243
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 137 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 536 place count 136 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 537 place count 136 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 538 place count 135 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 135 transition count 241
Applied a total of 539 rules in 172 ms. Remains 135 /259 variables (removed 124) and now considering 241/749 (removed 508) transitions.
// Phase 1: matrix 241 rows 135 cols
[2024-05-28 13:40:04] [INFO ] Computed 5 invariants in 25 ms
[2024-05-28 13:40:04] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 13:40:04] [INFO ] Invariant cache hit.
[2024-05-28 13:40:04] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-28 13:40:05] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-28 13:40:05] [INFO ] Invariant cache hit.
[2024-05-28 13:40:05] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 27 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/376 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 148/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 290 constraints, problems are : Problem set: 0 solved, 240 unsolved in 19475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/376 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 148/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 240/530 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 13:40:35] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 531 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 3/3 constraints]
After SMT, in 50374ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 50408ms
Starting structural reductions in LTL mode, iteration 1 : 135/259 places, 241/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52005 ms. Remains : 135/259 places, 241/749 transitions.
Support contains 26 out of 135 places after structural reductions.
[2024-05-28 13:40:56] [INFO ] Flatten gal took : 100 ms
[2024-05-28 13:40:56] [INFO ] Flatten gal took : 49 ms
[2024-05-28 13:40:56] [INFO ] Input system was already deterministic with 241 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8915 resets) in 3724 ms. (10 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4004 steps (210 resets) in 68 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (186 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (200 resets) in 77 ms. (51 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (174 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (391 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (194 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (188 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (360 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (197 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (190 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (406 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (189 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (191 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (181 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (198 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (186 resets) in 57 ms. (68 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (180 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (211 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (190 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (190 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
[2024-05-28 13:40:58] [INFO ] Invariant cache hit.
[2024-05-28 13:40:58] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 31/117 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-28 13:40:58] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 226/343 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 33/376 variables, 18/274 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 15/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 289 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 31/117 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 226/343 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 33/376 variables, 18/275 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 15/290 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 19/309 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-28 13:41:01] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/376 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 310 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 6597ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 2 properties in 9758 ms.
Support contains 21 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 241/241 transitions.
Graph (complete) has 454 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 239
Applied a total of 3 rules in 61 ms. Remains 134 /135 variables (removed 1) and now considering 239/241 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 134/135 places, 239/241 transitions.
RANDOM walk for 40000 steps (8998 resets) in 656 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (177 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (181 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (203 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (192 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (438 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (191 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (395 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (175 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (182 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (192 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (160 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (181 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (190 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (190 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (199 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (192 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (189 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 313255 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :12 out of 18
Probabilistic random walk after 313255 steps, saw 143957 distinct states, run finished after 3006 ms. (steps per millisecond=104 ) properties seen :12
// Phase 1: matrix 239 rows 134 cols
[2024-05-28 13:41:18] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 13:41:18] [INFO ] State equation strengthened by 146 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 163/251 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 70/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 122/373 variables, 46/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 76/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/373 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 284 constraints, problems are : Problem set: 0 solved, 6 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 163/251 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 70/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 122/373 variables, 46/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 76/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 13:41:20] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/373 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/373 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 291 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3448ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 7056 ms.
Support contains 7 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 123 transition count 170
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 123 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 123 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 113 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 113 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 113 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 107 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 107 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 103 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 103 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 101 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 101 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 101 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 100 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 100 transition count 134
Applied a total of 80 rules in 43 ms. Remains 100 /134 variables (removed 34) and now considering 134/239 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 100/134 places, 134/239 transitions.
RANDOM walk for 40000 steps (8937 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4154 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1926 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 534888 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :2 out of 5
Probabilistic random walk after 534888 steps, saw 226307 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :2
// Phase 1: matrix 134 rows 100 cols
[2024-05-28 13:41:31] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 13:41:31] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/68 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 115/183 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 51/234 variables, 32/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 19/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:41:32] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/68 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:41:32] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-28 13:41:32] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 115/183 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 47/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 51/234 variables, 32/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 19/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1135ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4569 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 96 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 96 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 95 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 95 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 94 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 93 transition count 116
Applied a total of 17 rules in 31 ms. Remains 93 /100 variables (removed 7) and now considering 116/134 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 93/100 places, 116/134 transitions.
RANDOM walk for 40000 steps (8948 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 532099 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 3
Probabilistic random walk after 532099 steps, saw 239805 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 116 rows 93 cols
[2024-05-28 13:41:40] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 13:41:40] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/65 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:41:40] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 105/170 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 44/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 39/209 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/65 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 105/170 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 44/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 39/209 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1008ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2131 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 93/93 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-28 13:41:43] [INFO ] Invariant cache hit.
[2024-05-28 13:41:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 13:41:44] [INFO ] Invariant cache hit.
[2024-05-28 13:41:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 13:41:44] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-28 13:41:44] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-28 13:41:44] [INFO ] Invariant cache hit.
[2024-05-28 13:41:44] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/209 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 55/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 152 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/209 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 55/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 115/267 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 13:41:53] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 268 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
After SMT, in 17913ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 17917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18402 ms. Remains : 93/93 places, 116/116 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 110
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 66 transition count 88
Applied a total of 55 rules in 22 ms. Remains 66 /93 variables (removed 27) and now considering 88/116 (removed 28) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 88 rows 66 cols
[2024-05-28 13:42:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:42:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 13:42:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:42:02] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 13:42:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:42:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:42:02] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 13:42:02] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 13:42:02] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 478 ms.
Computed a total of 27 stabilizing places and 45 stable transitions
Graph (complete) has 504 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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)||G(p1))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 42 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:42:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:42:03] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 13:42:03] [INFO ] Invariant cache hit.
[2024-05-28 13:42:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:42:03] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-28 13:42:03] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:42:03] [INFO ] Invariant cache hit.
[2024-05-28 13:42:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:42:05] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:42:05] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 13810ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14239 ms. Remains : 91/135 places, 117/241 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00
Product exploration explored 100000 steps with 22333 reset in 427 ms.
Product exploration explored 100000 steps with 22440 reset in 340 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 179 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8990 resets) in 335 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 363 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1905 resets) in 415 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 369 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1996 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1937 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1918 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 529899 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :4 out of 6
Probabilistic random walk after 529899 steps, saw 240564 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :4
[2024-05-28 13:42:22] [INFO ] Invariant cache hit.
[2024-05-28 13:42:22] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 296 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 90 transition count 115
Applied a total of 3 rules in 7 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (8971 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2287124 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :0 out of 1
Probabilistic random walk after 2287124 steps, saw 1014241 distinct states, run finished after 3001 ms. (steps per millisecond=762 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 13:42:26] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 13:42:26] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 13:42:26] [INFO ] Invariant cache hit.
[2024-05-28 13:42:26] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 13:42:26] [INFO ] Invariant cache hit.
[2024-05-28 13:42:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 13:42:27] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-28 13:42:27] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 13:42:27] [INFO ] Invariant cache hit.
[2024-05-28 13:42:27] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3772 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 264 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 11455ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11967 ms. Remains : 90/90 places, 115/115 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 18 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 13:42:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 13:42:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 13:42:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:42:38] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 13:42:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 13:42:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 13:42:38] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 13:42:38] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 13:42:38] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 397 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:42:39] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 13:42:39] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 13:42:39] [INFO ] Invariant cache hit.
[2024-05-28 13:42:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:42:40] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-28 13:42:40] [INFO ] Redundant transitions in 5 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:42:40] [INFO ] Invariant cache hit.
[2024-05-28 13:42:40] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14947ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15557 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9015 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4289 steps, run visited all 1 properties in 57 ms. (steps per millisecond=75 )
Probabilistic random walk after 4289 steps, saw 1916 distinct states, run finished after 66 ms. (steps per millisecond=64 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22268 reset in 504 ms.
Product exploration explored 100000 steps with 22431 reset in 182 ms.
Built C files in :
/tmp/ltsmin3505898395802430211
[2024-05-28 13:42:56] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 13:42:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:56] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 13:42:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:56] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 13:42:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:56] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3505898395802430211
Running compilation step : cd /tmp/ltsmin3505898395802430211;'/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 822 ms.
Running link step : cd /tmp/ltsmin3505898395802430211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin3505898395802430211;'/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/stateBased14773294215159875958.hoa' '--buchi-type=spotba'
LTSmin run took 606 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 54710 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)&&(G(p1)||X(p2)))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 145
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 130
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 108 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 101 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 101 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 101 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 97 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 97 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 93 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 93 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 90 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 90 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 90 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 88 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 88 transition count 97
Applied a total of 108 rules in 12 ms. Remains 88 /135 variables (removed 47) and now considering 97/241 (removed 144) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-28 13:42:57] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:42:58] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 13:42:58] [INFO ] Invariant cache hit.
[2024-05-28 13:42:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 13:42:58] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 13:42:58] [INFO ] Invariant cache hit.
[2024-05-28 13:42:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 13:43:00] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:43:00] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/185 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 135 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/185 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 96/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 13:43:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 232 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 13441ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13443ms
Starting structural reductions in LTL mode, iteration 1 : 88/135 places, 97/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13927 ms. Remains : 88/135 places, 97/241 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 14320 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(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 152
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 152
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 108 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 108 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 108 transition count 132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 101 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 101 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 98 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 95 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 94 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 94 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 93 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 93 transition count 110
Applied a total of 97 rules in 30 ms. Remains 93 /135 variables (removed 42) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 93 cols
[2024-05-28 13:43:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:43:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 13:43:12] [INFO ] Invariant cache hit.
[2024-05-28 13:43:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 13:43:12] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-28 13:43:12] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-28 13:43:12] [INFO ] Invariant cache hit.
[2024-05-28 13:43:12] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:43:14] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:43:14] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:43:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6412 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 13848ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 13851ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14428 ms. Remains : 93/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 166 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
Product exploration explored 100000 steps with 22475 reset in 229 ms.
Product exploration explored 100000 steps with 22412 reset in 273 ms.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8956 resets) in 372 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1883 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1934441 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :2 out of 3
Probabilistic random walk after 1934441 steps, saw 901202 distinct states, run finished after 3001 ms. (steps per millisecond=644 ) properties seen :2
[2024-05-28 13:43:30] [INFO ] Invariant cache hit.
[2024-05-28 13:43:30] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/173 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 203/203 variables, and 134 constraints, problems are : Problem set: 1 solved, 0 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 36/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 221 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p1 p0), p0]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-28 13:43:31] [INFO ] Invariant cache hit.
[2024-05-28 13:43:31] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-28 13:43:31] [INFO ] Invariant cache hit.
[2024-05-28 13:43:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 13:43:32] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-28 13:43:32] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-28 13:43:32] [INFO ] Invariant cache hit.
[2024-05-28 13:43:32] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 12989ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 12991ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13427 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8986 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1980650 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :2 out of 3
Probabilistic random walk after 1980650 steps, saw 921790 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :2
[2024-05-28 13:43:48] [INFO ] Invariant cache hit.
[2024-05-28 13:43:48] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/173 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 203/203 variables, and 134 constraints, problems are : Problem set: 1 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 36/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 233 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 146 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 135 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 22380 reset in 246 ms.
Product exploration explored 100000 steps with 22514 reset in 278 ms.
Built C files in :
/tmp/ltsmin6916212877332049898
[2024-05-28 13:43:49] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-28 13:43:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:49] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-28 13:43:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:49] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-28 13:43:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6916212877332049898
Running compilation step : cd /tmp/ltsmin6916212877332049898;'/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 613 ms.
Running link step : cd /tmp/ltsmin6916212877332049898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6916212877332049898;'/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/stateBased1796857292314192451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-28 13:44:04] [INFO ] Invariant cache hit.
[2024-05-28 13:44:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 13:44:04] [INFO ] Invariant cache hit.
[2024-05-28 13:44:05] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 13:44:05] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-28 13:44:05] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-28 13:44:05] [INFO ] Invariant cache hit.
[2024-05-28 13:44:05] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 13783ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 13786ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14152 ms. Remains : 93/93 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin15347226836941935429
[2024-05-28 13:44:19] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-28 13:44:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:44:19] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-28 13:44:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:44:19] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-28 13:44:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:44:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347226836941935429
Running compilation step : cd /tmp/ltsmin15347226836941935429;'/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 709 ms.
Running link step : cd /tmp/ltsmin15347226836941935429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15347226836941935429;'/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/stateBased1747694612710381471.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:44:34] [INFO ] Flatten gal took : 11 ms
[2024-05-28 13:44:34] [INFO ] Flatten gal took : 16 ms
[2024-05-28 13:44:34] [INFO ] Time to serialize gal into /tmp/LTL15463264001959268181.gal : 7 ms
[2024-05-28 13:44:34] [INFO ] Time to serialize properties into /tmp/LTL4887514440216392982.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15463264001959268181.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10252302924945355460.hoa' '-atoms' '/tmp/LTL4887514440216392982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4887514440216392982.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10252302924945355460.hoa
Detected timeout of ITS tools.
[2024-05-28 13:44:49] [INFO ] Flatten gal took : 16 ms
[2024-05-28 13:44:49] [INFO ] Flatten gal took : 15 ms
[2024-05-28 13:44:49] [INFO ] Time to serialize gal into /tmp/LTL3031196504672975790.gal : 5 ms
[2024-05-28 13:44:49] [INFO ] Time to serialize properties into /tmp/LTL11633526570969066748.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3031196504672975790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11633526570969066748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((s1<1)||(l125<1))")))||((F("((s1<1)||(l125<1))"))&&((X(G("((s1<1)||(l125<1))")))||(G("((s1<1)||(l1190<1))")))))))
Formula 0 simplified : G(FG!"((s1<1)||(l125<1))" & (G!"((s1<1)||(l125<1))" | (XF!"((s1<1)||(l125<1))" & F!"((s1<1)||(l1190<1))")))
Detected timeout of ITS tools.
[2024-05-28 13:45:04] [INFO ] Flatten gal took : 16 ms
[2024-05-28 13:45:04] [INFO ] Applying decomposition
[2024-05-28 13:45:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4899504316525784925.txt' '-o' '/tmp/graph4899504316525784925.bin' '-w' '/tmp/graph4899504316525784925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4899504316525784925.bin' '-l' '-1' '-v' '-w' '/tmp/graph4899504316525784925.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:04] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:04] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-28 13:45:04] [INFO ] Flatten gal took : 96 ms
[2024-05-28 13:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 18 ms.
[2024-05-28 13:45:04] [INFO ] Time to serialize gal into /tmp/LTL11587737471607801027.gal : 8 ms
[2024-05-28 13:45:04] [INFO ] Time to serialize properties into /tmp/LTL15152989036900845500.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11587737471607801027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15152989036900845500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i0.u0.s1<1)||(i2.u6.l125<1))")))||((F("((i0.u0.s1<1)||(i2.u6.l125<1))"))&&((X(G("((i0.u0.s1<1)||(i2.u6.l125<1))")))||(G("...195
Formula 0 simplified : G(FG!"((i0.u0.s1<1)||(i2.u6.l125<1))" & (G!"((i0.u0.s1<1)||(i2.u6.l125<1))" | (XF!"((i0.u0.s1<1)||(i2.u6.l125<1))" & F!"((i0.u0.s1<1...179
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 127609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G((F(p3)&&p2))))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 153
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 122 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 109 transition count 138
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 109 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 93 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 93 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 93 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 91 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 90 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 89 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 89 transition count 106
Applied a total of 104 rules in 23 ms. Remains 89 /135 variables (removed 46) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-05-28 13:45:19] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 13:45:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 13:45:20] [INFO ] Invariant cache hit.
[2024-05-28 13:45:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 13:45:20] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 13:45:20] [INFO ] Invariant cache hit.
[2024-05-28 13:45:20] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 13:45:21] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:45:21] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 47/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 143 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 47/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 105/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 248 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7698 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
After SMT, in 14044ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 14046ms
Starting structural reductions in LTL mode, iteration 1 : 89/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14528 ms. Remains : 89/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 14703 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((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 99 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 99 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 92 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 91 transition count 106
Applied a total of 102 rules in 12 ms. Remains 91 /135 variables (removed 44) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 91 cols
[2024-05-28 13:45:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:45:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 13:45:34] [INFO ] Invariant cache hit.
[2024-05-28 13:45:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 13:45:35] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 13:45:35] [INFO ] Invariant cache hit.
[2024-05-28 13:45:35] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 13:45:36] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-28 13:45:37] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/197 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 46/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 144 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5848 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/197 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 46/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 105/249 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 250 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7997 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints]
After SMT, in 13995ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 13997ms
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14505 ms. Remains : 91/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 400 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
Product exploration explored 100000 steps with 22465 reset in 229 ms.
Product exploration explored 100000 steps with 22358 reset in 228 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 291 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9011 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4134 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1571289 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :2 out of 3
Probabilistic random walk after 1571289 steps, saw 658537 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :2
[2024-05-28 13:45:53] [INFO ] Invariant cache hit.
[2024-05-28 13:45:53] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 74/197 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 18940 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))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 119 transition count 141
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 105 transition count 126
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 105 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 105 transition count 119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 97 transition count 111
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 97 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 97 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 93 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 85 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 85 transition count 91
Applied a total of 116 rules in 25 ms. Remains 85 /135 variables (removed 50) and now considering 91/241 (removed 150) transitions.
// Phase 1: matrix 91 rows 85 cols
[2024-05-28 13:45:53] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 13:45:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 13:45:53] [INFO ] Invariant cache hit.
[2024-05-28 13:45:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 13:45:53] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-28 13:45:53] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-28 13:45:53] [INFO ] Invariant cache hit.
[2024-05-28 13:45:53] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-28 13:45:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:45:54] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/176 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-28 13:45:56] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/176 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 129 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/176 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 90/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 219 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
After SMT, in 9493ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/135 places, 91/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9822 ms. Remains : 85/135 places, 91/241 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 9896 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 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 13 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:46:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:46:03] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 13:46:03] [INFO ] Invariant cache hit.
[2024-05-28 13:46:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:46:03] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 13:46:03] [INFO ] Invariant cache hit.
[2024-05-28 13:46:03] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 9143ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9145ms
Starting structural reductions in LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9510 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 9632 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))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 24 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:46:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:46:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 13:46:13] [INFO ] Invariant cache hit.
[2024-05-28 13:46:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:46:13] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-28 13:46:13] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:46:13] [INFO ] Invariant cache hit.
[2024-05-28 13:46:13] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5709 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 12612ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12614ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13106 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 13172 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 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 24 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 13:46:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:46:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 13:46:26] [INFO ] Invariant cache hit.
[2024-05-28 13:46:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:46:26] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-28 13:46:26] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:46:26] [INFO ] Invariant cache hit.
[2024-05-28 13:46:26] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:46:27] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:46:27] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11934ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12402 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
Product exploration explored 100000 steps with 22344 reset in 162 ms.
Product exploration explored 100000 steps with 22463 reset in 227 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9020 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1548 ms. (steps per millisecond=723 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1548 ms. (steps per millisecond=723 ) properties seen :1
Knowledge obtained : [p0, (X 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 13:46:40] [INFO ] Invariant cache hit.
[2024-05-28 13:46:41] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 13:46:41] [INFO ] Invariant cache hit.
[2024-05-28 13:46:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:46:41] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-28 13:46:41] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:46:41] [INFO ] Invariant cache hit.
[2024-05-28 13:46:41] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 9369ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9372ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9765 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 40000 steps (8958 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1669 ms. (steps per millisecond=671 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1670 ms. (steps per millisecond=670 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22525 reset in 212 ms.
Product exploration explored 100000 steps with 22566 reset in 227 ms.
Built C files in :
/tmp/ltsmin14854221655867727846
[2024-05-28 13:46:53] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 13:46:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:46:53] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 13:46:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:46:53] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 13:46:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:46:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14854221655867727846
Running compilation step : cd /tmp/ltsmin14854221655867727846;'/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 430 ms.
Running link step : cd /tmp/ltsmin14854221655867727846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14854221655867727846;'/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/stateBased18016447367265197635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 13:47:08] [INFO ] Invariant cache hit.
[2024-05-28 13:47:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 13:47:08] [INFO ] Invariant cache hit.
[2024-05-28 13:47:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 13:47:08] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-28 13:47:08] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 13:47:08] [INFO ] Invariant cache hit.
[2024-05-28 13:47:08] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 13:47:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:47:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 10823ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11201 ms. Remains : 84/84 places, 98/98 transitions.
Built C files in :
/tmp/ltsmin13106958755355022737
[2024-05-28 13:47:19] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 13:47:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:47:19] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 13:47:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:47:19] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 13:47:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:47:19] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13106958755355022737
Running compilation step : cd /tmp/ltsmin13106958755355022737;'/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 391 ms.
Running link step : cd /tmp/ltsmin13106958755355022737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13106958755355022737;'/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/stateBased13185587529678920737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:47:34] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:47:34] [INFO ] Flatten gal took : 8 ms
[2024-05-28 13:47:34] [INFO ] Time to serialize gal into /tmp/LTL1477436874014537110.gal : 2 ms
[2024-05-28 13:47:34] [INFO ] Time to serialize properties into /tmp/LTL2068206431031228980.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1477436874014537110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut834090687340918065.hoa' '-atoms' '/tmp/LTL2068206431031228980.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2068206431031228980.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut834090687340918065.hoa
Detected timeout of ITS tools.
[2024-05-28 13:47:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 13:47:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 13:47:49] [INFO ] Time to serialize gal into /tmp/LTL14004815242888739743.gal : 2 ms
[2024-05-28 13:47:49] [INFO ] Time to serialize properties into /tmp/LTL305216969996080588.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14004815242888739743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL305216969996080588.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l1196<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l1196<1))"
Detected timeout of ITS tools.
[2024-05-28 13:48:04] [INFO ] Flatten gal took : 14 ms
[2024-05-28 13:48:04] [INFO ] Applying decomposition
[2024-05-28 13:48:04] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11608361979433879165.txt' '-o' '/tmp/graph11608361979433879165.bin' '-w' '/tmp/graph11608361979433879165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11608361979433879165.bin' '-l' '-1' '-v' '-w' '/tmp/graph11608361979433879165.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:48:05] [INFO ] Decomposing Gal with order
[2024-05-28 13:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:48:05] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-28 13:48:05] [INFO ] Flatten gal took : 29 ms
[2024-05-28 13:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 8 ms.
[2024-05-28 13:48:05] [INFO ] Time to serialize gal into /tmp/LTL16503301568365306950.gal : 6 ms
[2024-05-28 13:48:05] [INFO ] Time to serialize properties into /tmp/LTL2015700029354015497.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16503301568365306950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2015700029354015497.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u1.s1<1)||(u0.l1196<1))"))))
Formula 0 simplified : GF!"((i1.u1.s1<1)||(u0.l1196<1))"
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 113963 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(p1)||p0))||F(p2)))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 122 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 110 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 110 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 110 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 103 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 103 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 101 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 99 transition count 127
Applied a total of 82 rules in 8 ms. Remains 99 /135 variables (removed 36) and now considering 127/241 (removed 114) transitions.
// Phase 1: matrix 127 rows 99 cols
[2024-05-28 13:48:20] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:48:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 13:48:20] [INFO ] Invariant cache hit.
[2024-05-28 13:48:20] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 13:48:20] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-28 13:48:20] [INFO ] Invariant cache hit.
[2024-05-28 13:48:20] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 13:48:22] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:48:23] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/226 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 168 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8069 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/226 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 295 constraints, problems are : Problem set: 0 solved, 126 unsolved in 11831 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
After SMT, in 20025ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 20027ms
Starting structural reductions in LTL mode, iteration 1 : 99/135 places, 127/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20438 ms. Remains : 99/135 places, 127/241 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 493 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 326 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 21679 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((G(p1)||p0))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 119 transition count 141
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 48 place count 104 transition count 124
Iterating global reduction 1 with 15 rules applied. Total rules applied 63 place count 104 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 104 transition count 117
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 95 transition count 108
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 95 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 95 transition count 102
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 90 transition count 97
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 90 transition count 97
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 85 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 85 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 82 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 82 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 82 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 79 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 77 transition count 81
Applied a total of 132 rules in 19 ms. Remains 77 /135 variables (removed 58) and now considering 81/241 (removed 160) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-05-28 13:48:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:48:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 13:48:41] [INFO ] Invariant cache hit.
[2024-05-28 13:48:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 13:48:42] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-28 13:48:42] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-28 13:48:42] [INFO ] Invariant cache hit.
[2024-05-28 13:48:42] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 8649ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 8650ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/135 places, 81/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8916 ms. Remains : 77/135 places, 81/241 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
Product exploration explored 100000 steps with 23027 reset in 207 ms.
Product exploration explored 100000 steps with 23006 reset in 600 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8994 resets) in 57 ms. (689 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-28 13:48:51] [INFO ] Invariant cache hit.
[2024-05-28 13:48:51] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 62/158 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 258 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-28 13:48:52] [INFO ] Invariant cache hit.
[2024-05-28 13:48:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 13:48:52] [INFO ] Invariant cache hit.
[2024-05-28 13:48:52] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 13:48:52] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-28 13:48:52] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-28 13:48:52] [INFO ] Invariant cache hit.
[2024-05-28 13:48:52] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 7369ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7760 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (35 resets) in 4 ms. (33 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22906 reset in 173 ms.
Product exploration explored 100000 steps with 23035 reset in 379 ms.
Built C files in :
/tmp/ltsmin15819493262752735447
[2024-05-28 13:49:01] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-28 13:49:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:01] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-28 13:49:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:01] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-28 13:49:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15819493262752735447
Running compilation step : cd /tmp/ltsmin15819493262752735447;'/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 358 ms.
Running link step : cd /tmp/ltsmin15819493262752735447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15819493262752735447;'/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/stateBased11947640734249620725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 17 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-28 13:49:16] [INFO ] Invariant cache hit.
[2024-05-28 13:49:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 13:49:16] [INFO ] Invariant cache hit.
[2024-05-28 13:49:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 13:49:16] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-28 13:49:16] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-28 13:49:16] [INFO ] Invariant cache hit.
[2024-05-28 13:49:16] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 13:49:18] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-05-28 13:49:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 8210ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 8212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8540 ms. Remains : 77/77 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin18175880910946165001
[2024-05-28 13:49:25] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-28 13:49:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:25] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-28 13:49:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:25] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-28 13:49:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:49:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18175880910946165001
Running compilation step : cd /tmp/ltsmin18175880910946165001;'/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 529 ms.
Running link step : cd /tmp/ltsmin18175880910946165001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18175880910946165001;'/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/stateBased8993065920219416166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:49:40] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:49:40] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:49:40] [INFO ] Time to serialize gal into /tmp/LTL7165115228743920524.gal : 2 ms
[2024-05-28 13:49:40] [INFO ] Time to serialize properties into /tmp/LTL12047203770288486894.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7165115228743920524.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12319075420283311054.hoa' '-atoms' '/tmp/LTL12047203770288486894.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12047203770288486894.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12319075420283311054.hoa
Detected timeout of ITS tools.
[2024-05-28 13:49:55] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:49:55] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:49:55] [INFO ] Time to serialize gal into /tmp/LTL6736224445202484828.gal : 1 ms
[2024-05-28 13:49:55] [INFO ] Time to serialize properties into /tmp/LTL840006829399082710.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6736224445202484828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL840006829399082710.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
Detected timeout of ITS tools.
[2024-05-28 13:50:10] [INFO ] Flatten gal took : 6 ms
[2024-05-28 13:50:10] [INFO ] Applying decomposition
[2024-05-28 13:50:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4003165236520521371.txt' '-o' '/tmp/graph4003165236520521371.bin' '-w' '/tmp/graph4003165236520521371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4003165236520521371.bin' '-l' '-1' '-v' '-w' '/tmp/graph4003165236520521371.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:50:10] [INFO ] Decomposing Gal with order
[2024-05-28 13:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:50:10] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 13:50:10] [INFO ] Flatten gal took : 12 ms
[2024-05-28 13:50:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2024-05-28 13:50:10] [INFO ] Time to serialize gal into /tmp/LTL8009637669482592759.gal : 3 ms
[2024-05-28 13:50:10] [INFO ] Time to serialize properties into /tmp/LTL12700630139619763710.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8009637669482592759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12700630139619763710.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.u0.s1<1)||(i1.u2.l5<1))")||(G("((i1.u2.s4>=1)&&(i0.u0.l0>=1))"))))))
Formula 0 simplified : G(F!"((i1.u2.s4>=1)&&(i0.u0.l0>=1))" & FG!"((i0.u0.s1<1)||(i1.u2.l5<1))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 103532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 8 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:50:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:50:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 13:50:25] [INFO ] Invariant cache hit.
[2024-05-28 13:50:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:50:25] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 13:50:25] [INFO ] Invariant cache hit.
[2024-05-28 13:50:25] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:50:27] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 16436ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 16443ms
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16817 ms. Remains : 91/135 places, 117/241 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22435 reset in 190 ms.
Product exploration explored 100000 steps with 22301 reset in 213 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8954 resets) in 552 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 345 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 408 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 584 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 537 ms. (74 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 880268 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :4 out of 5
Probabilistic random walk after 880268 steps, saw 392458 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :4
[2024-05-28 13:50:47] [INFO ] Invariant cache hit.
[2024-05-28 13:50:47] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 13:50:47] [INFO ] Invariant cache hit.
[2024-05-28 13:50:47] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 13:50:47] [INFO ] Invariant cache hit.
[2024-05-28 13:50:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:50:48] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-28 13:50:48] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:50:48] [INFO ] Invariant cache hit.
[2024-05-28 13:50:48] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-28 13:50:50] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7493 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14646ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15127 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8928 resets) in 1113 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1951 resets) in 400 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1859 resets) in 374 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 456 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1950 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 527 ms. (75 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1309366 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :4 out of 5
Probabilistic random walk after 1309366 steps, saw 577297 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :4
[2024-05-28 13:51:07] [INFO ] Invariant cache hit.
[2024-05-28 13:51:07] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 401 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22428 reset in 163 ms.
Product exploration explored 100000 steps with 22350 reset in 171 ms.
Built C files in :
/tmp/ltsmin6383979026098933817
[2024-05-28 13:51:09] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 13:51:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:09] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 13:51:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:09] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 13:51:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6383979026098933817
Running compilation step : cd /tmp/ltsmin6383979026098933817;'/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 510 ms.
Running link step : cd /tmp/ltsmin6383979026098933817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6383979026098933817;'/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/stateBased2105726414021761143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 13:51:24] [INFO ] Invariant cache hit.
[2024-05-28 13:51:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 13:51:24] [INFO ] Invariant cache hit.
[2024-05-28 13:51:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:51:24] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-28 13:51:24] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:51:24] [INFO ] Invariant cache hit.
[2024-05-28 13:51:24] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:51:26] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:51:26] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 8514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 16537ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 16539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17089 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin15120796926427399754
[2024-05-28 13:51:41] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 13:51:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:41] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 13:51:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:41] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 13:51:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:51:41] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15120796926427399754
Running compilation step : cd /tmp/ltsmin15120796926427399754;'/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 736 ms.
Running link step : cd /tmp/ltsmin15120796926427399754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15120796926427399754;'/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/stateBased206617538512422999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:51:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 13:51:56] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:51:56] [INFO ] Time to serialize gal into /tmp/LTL4588660011150371462.gal : 2 ms
[2024-05-28 13:51:56] [INFO ] Time to serialize properties into /tmp/LTL5960505195951478120.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4588660011150371462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut944872498993428171.hoa' '-atoms' '/tmp/LTL5960505195951478120.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5960505195951478120.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut944872498993428171.hoa
Detected timeout of ITS tools.
[2024-05-28 13:52:11] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:52:11] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:52:11] [INFO ] Time to serialize gal into /tmp/LTL9141710295751629324.gal : 1 ms
[2024-05-28 13:52:11] [INFO ] Time to serialize properties into /tmp/LTL312806620871967597.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9141710295751629324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL312806620871967597.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2024-05-28 13:52:26] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:52:26] [INFO ] Applying decomposition
[2024-05-28 13:52:26] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2087102089925517500.txt' '-o' '/tmp/graph2087102089925517500.bin' '-w' '/tmp/graph2087102089925517500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2087102089925517500.bin' '-l' '-1' '-v' '-w' '/tmp/graph2087102089925517500.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:52:26] [INFO ] Decomposing Gal with order
[2024-05-28 13:52:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:52:26] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-28 13:52:26] [INFO ] Flatten gal took : 14 ms
[2024-05-28 13:52:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2024-05-28 13:52:26] [INFO ] Time to serialize gal into /tmp/LTL399462541132129986.gal : 3 ms
[2024-05-28 13:52:26] [INFO ] Time to serialize properties into /tmp/LTL16609867077450635097.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL399462541132129986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16609867077450635097.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i0.u0.s1<1)||(i0.u0.l1186<1))&&((i0.u0.s1<1)||(i0.u0.l1189<1)))")))||("((i0.u0.s1>=1)&&(i0.u0.l1189>=1))")))))
Formula 0 simplified : XG(!"((i0.u0.s1>=1)&&(i0.u0.l1189>=1))" & FG!"(((i0.u0.s1<1)||(i0.u0.l1186<1))&&((i0.u0.s1<1)||(i0.u0.l1189<1)))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 136239 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' '!((p0 U G((!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 109 transition count 146
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 109 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 97 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 93 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 91 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 91 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 89 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 88 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 87 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 87 transition count 110
Applied a total of 110 rules in 17 ms. Remains 87 /135 variables (removed 48) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-28 13:52:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:52:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 13:52:41] [INFO ] Invariant cache hit.
[2024-05-28 13:52:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 13:52:41] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-28 13:52:41] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-28 13:52:41] [INFO ] Invariant cache hit.
[2024-05-28 13:52:41] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 13:52:43] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:52:43] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 147 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 109/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 256 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7767 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 14589ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 14590ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14943 ms. Remains : 87/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, true, (AND p1 p2), p1, (AND p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-15
Product exploration explored 100000 steps with 22364 reset in 238 ms.
Product exploration explored 100000 steps with 22455 reset in 267 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 286 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 245 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, p1]
RANDOM walk for 40000 steps (8982 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1903 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4088 steps, run visited all 1 properties in 12 ms. (steps per millisecond=340 )
Probabilistic random walk after 4088 steps, saw 1897 distinct states, run finished after 13 ms. (steps per millisecond=314 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 25 factoid took 238 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 finished in 16281 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(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
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)))'
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((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 22 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 13:52:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 13:52:59] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 13:52:59] [INFO ] Invariant cache hit.
[2024-05-28 13:52:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:52:59] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 13:52:59] [INFO ] Invariant cache hit.
[2024-05-28 13:52:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:53:01] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-28 13:53:01] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14216ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14221ms
Starting structural reductions in LI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14799 ms. Remains : 91/135 places, 117/241 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22546 reset in 180 ms.
Product exploration explored 100000 steps with 22521 reset in 200 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8958 resets) in 1015 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 608 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 401 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1898 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1206548 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :4 out of 5
Probabilistic random walk after 1206548 steps, saw 534356 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :4
[2024-05-28 13:53:18] [INFO ] Invariant cache hit.
[2024-05-28 13:53:18] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 236 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 13:53:19] [INFO ] Invariant cache hit.
[2024-05-28 13:53:19] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 13:53:19] [INFO ] Invariant cache hit.
[2024-05-28 13:53:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:53:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-28 13:53:19] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:53:19] [INFO ] Invariant cache hit.
[2024-05-28 13:53:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7421 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 13549ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13551ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13964 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8891 resets) in 982 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1962 resets) in 352 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1895 resets) in 396 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 305 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1135773 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :4 out of 5
Probabilistic random walk after 1135773 steps, saw 505729 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :4
[2024-05-28 13:53:37] [INFO ] Invariant cache hit.
[2024-05-28 13:53:37] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 306 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22347 reset in 281 ms.
Product exploration explored 100000 steps with 22434 reset in 292 ms.
Built C files in :
/tmp/ltsmin2531874705161628473
[2024-05-28 13:53:39] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 13:53:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:53:39] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 13:53:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:53:39] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 13:53:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:53:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2531874705161628473
Running compilation step : cd /tmp/ltsmin2531874705161628473;'/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 713 ms.
Running link step : cd /tmp/ltsmin2531874705161628473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2531874705161628473;'/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/stateBased7626646653507131229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 13:53:54] [INFO ] Invariant cache hit.
[2024-05-28 13:53:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 13:53:54] [INFO ] Invariant cache hit.
[2024-05-28 13:53:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 13:53:54] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-28 13:53:54] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 13:53:54] [INFO ] Invariant cache hit.
[2024-05-28 13:53:54] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 8891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14884ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14887ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15306 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin16578391637500536074
[2024-05-28 13:54:09] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 13:54:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:54:09] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 13:54:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:54:09] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 13:54:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:54:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16578391637500536074
Running compilation step : cd /tmp/ltsmin16578391637500536074;'/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 759 ms.
Running link step : cd /tmp/ltsmin16578391637500536074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16578391637500536074;'/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/stateBased13899862810872806635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:54:24] [INFO ] Flatten gal took : 9 ms
[2024-05-28 13:54:24] [INFO ] Flatten gal took : 6 ms
[2024-05-28 13:54:24] [INFO ] Time to serialize gal into /tmp/LTL4820496495266940148.gal : 2 ms
[2024-05-28 13:54:24] [INFO ] Time to serialize properties into /tmp/LTL1005544665089637862.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4820496495266940148.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15024186729814528654.hoa' '-atoms' '/tmp/LTL1005544665089637862.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1005544665089637862.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15024186729814528654.hoa
Detected timeout of ITS tools.
[2024-05-28 13:54:39] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:54:39] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:54:39] [INFO ] Time to serialize gal into /tmp/LTL18060284668727858351.gal : 1 ms
[2024-05-28 13:54:39] [INFO ] Time to serialize properties into /tmp/LTL2101117043690986187.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18060284668727858351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2101117043690986187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2024-05-28 13:54:54] [INFO ] Flatten gal took : 8 ms
[2024-05-28 13:54:54] [INFO ] Applying decomposition
[2024-05-28 13:54:55] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4474010855909895787.txt' '-o' '/tmp/graph4474010855909895787.bin' '-w' '/tmp/graph4474010855909895787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4474010855909895787.bin' '-l' '-1' '-v' '-w' '/tmp/graph4474010855909895787.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:54:55] [INFO ] Decomposing Gal with order
[2024-05-28 13:54:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:54:55] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-28 13:54:55] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:54:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 6 ms.
[2024-05-28 13:54:55] [INFO ] Time to serialize gal into /tmp/LTL17316246914449701850.gal : 3 ms
[2024-05-28 13:54:55] [INFO ] Time to serialize properties into /tmp/LTL5606909790853846348.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17316246914449701850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5606909790853846348.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i0.u0.s1<1)||(i6.u14.l1186<1))&&((i0.u0.s1<1)||(i6.u16.l1189<1)))")))||("((i0.u0.s1>=1)&&(i6.u16.l1189>=1))")))))
Formula 0 simplified : XG(!"((i0.u0.s1>=1)&&(i6.u16.l1189>=1))" & FG!"(((i0.u0.s1<1)||(i6.u14.l1186<1))&&((i0.u0.s1<1)||(i6.u16.l1189<1)))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 131448 ms.
[2024-05-28 13:55:10] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8346026730085696417
[2024-05-28 13:55:10] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 13:55:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:10] [INFO ] Applying decomposition
[2024-05-28 13:55:10] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 13:55:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:10] [INFO ] Flatten gal took : 9 ms
[2024-05-28 13:55:10] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 13:55:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8346026730085696417
Running compilation step : cd /tmp/ltsmin8346026730085696417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14801449566213941260.txt' '-o' '/tmp/graph14801449566213941260.bin' '-w' '/tmp/graph14801449566213941260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14801449566213941260.bin' '-l' '-1' '-v' '-w' '/tmp/graph14801449566213941260.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:55:10] [INFO ] Decomposing Gal with order
[2024-05-28 13:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:55:10] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-28 13:55:10] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 17 ms.
[2024-05-28 13:55:10] [INFO ] Time to serialize gal into /tmp/LTLFireability3219747485999632946.gal : 5 ms
[2024-05-28 13:55:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14256150350297614967.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3219747485999632946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14256150350297614967.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((F((G(F(!("((u0.s1>=1)&&(i1.u13.l125>=1))"))))||((F(!("((u0.s1>=1)&&(i1.u13.l125>=1))")))&&((X(G(!("((u0.s1>=1)&&(i1.u13.l125>=1))")...202
Formula 0 simplified : G(FG"((u0.s1>=1)&&(i1.u13.l125>=1))" & (G"((u0.s1>=1)&&(i1.u13.l125>=1))" | (XF"((u0.s1>=1)&&(i1.u13.l125>=1))" & F"((u0.s1>=1)&&(u0...170
Compilation finished in 1166 ms.
Running link step : cd /tmp/ltsmin8346026730085696417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 1017 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' 'X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' 'X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: LTL layer: formula: <>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.012: "<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.066: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.122: DFS-FIFO for weak LTL, using special progress label 249
pins2lts-mc-linux64( 0/ 8), 0.122: There are 250 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.122: State length is 136, there are 248 groups
pins2lts-mc-linux64( 0/ 8), 0.122: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.122: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.122: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.122: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.127: ~1 levels ~960 states ~1888 transitions
pins2lts-mc-linux64( 3/ 8), 0.132: ~1 levels ~1920 states ~3768 transitions
pins2lts-mc-linux64( 3/ 8), 0.144: ~1 levels ~3840 states ~7960 transitions
pins2lts-mc-linux64( 3/ 8), 0.203: ~1 levels ~7680 states ~17432 transitions
pins2lts-mc-linux64( 3/ 8), 0.292: ~1 levels ~15360 states ~33048 transitions
pins2lts-mc-linux64( 3/ 8), 0.558: ~1 levels ~30720 states ~69776 transitions
pins2lts-mc-linux64( 3/ 8), 1.086: ~1 levels ~61440 states ~146360 transitions
pins2lts-mc-linux64( 3/ 8), 1.946: ~1 levels ~122880 states ~284296 transitions
pins2lts-mc-linux64( 3/ 8), 3.467: ~1 levels ~245760 states ~582632 transitions
pins2lts-mc-linux64( 3/ 8), 5.793: ~1 levels ~491520 states ~1204040 transitions
pins2lts-mc-linux64( 0/ 8), 9.178: ~1 levels ~983040 states ~2578136 transitions
pins2lts-mc-linux64( 3/ 8), 14.089: ~1 levels ~1966080 states ~4837968 transitions
pins2lts-mc-linux64( 0/ 8), 24.994: ~1 levels ~3932160 states ~10283880 transitions
pins2lts-mc-linux64( 3/ 8), 46.571: ~1 levels ~7864320 states ~20837008 transitions
pins2lts-mc-linux64( 5/ 8), 88.904: ~1 levels ~15728640 states ~40852584 transitions
pins2lts-mc-linux64( 5/ 8), 171.116: ~1 levels ~31457280 states ~78509280 transitions
pins2lts-mc-linux64( 1/ 8), 342.538: ~1 levels ~62914560 states ~163017520 transitions
pins2lts-mc-linux64( 1/ 8), 701.609: ~1 levels ~125829120 states ~337398928 transitions
pins2lts-mc-linux64( 1/ 8), 724.448: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 724.541:
pins2lts-mc-linux64( 0/ 8), 724.541: mean standard work distribution: 0.4% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 724.541:
pins2lts-mc-linux64( 0/ 8), 724.541: Explored 126729545 states 346529817 transitions, fanout: 2.734
pins2lts-mc-linux64( 0/ 8), 724.541: Total exploration time 724.390 sec (724.320 sec minimum, 724.351 sec on average)
pins2lts-mc-linux64( 0/ 8), 724.541: States per second: 174947, Transitions per second: 478375
pins2lts-mc-linux64( 0/ 8), 724.541:
pins2lts-mc-linux64( 0/ 8), 724.541: Progress states detected: 134217072
pins2lts-mc-linux64( 0/ 8), 724.541: Redundant explorations: -5.5787
pins2lts-mc-linux64( 0/ 8), 724.541:
pins2lts-mc-linux64( 0/ 8), 724.541: Queue width: 8B, total height: 16004676, memory: 122.11MB
pins2lts-mc-linux64( 0/ 8), 724.541: Tree memory: 1036.7MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 724.542: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 724.542: Stored 241 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 724.542: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 724.542: Est. total memory use: 1158.9MB (~1146.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8346026730085696417;'/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' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(X([](!(LTLAPp0==true)))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-28 14:20:12] [INFO ] Flatten gal took : 9 ms
[2024-05-28 14:20:12] [INFO ] Time to serialize gal into /tmp/LTLFireability13591538814599644227.gal : 7 ms
[2024-05-28 14:20:12] [INFO ] Time to serialize properties into /tmp/LTLFireability4134406143643194048.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13591538814599644227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4134406143643194048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F((G(F(!("((s1>=1)&&(l125>=1))"))))||((F(!("((s1>=1)&&(l125>=1))")))&&((X(G(!("((s1>=1)&&(l125>=1))"))))||(G(!("((s1>=1)&&(l1190>=1...166
Formula 0 simplified : G(FG"((s1>=1)&&(l125>=1))" & (G"((s1>=1)&&(l125>=1))" | (XF"((s1>=1)&&(l125>=1))" & F"((s1>=1)&&(l1190>=1))")))

BK_TIME_CONFINEMENT_REACHED

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

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