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.r092-tall-171624189400484.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 DBSingleClientW-PT-d0m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189400484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 DBSingleClientW-PT-d0m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716318706204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 19:11:47] [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-21 19:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:11:47] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 19:11:47] [INFO ] Transformed 553 places.
[2024-05-21 19:11:47] [INFO ] Transformed 150 transitions.
[2024-05-21 19:11:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 115
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 113
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 82 transition count 107
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 82 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 82 transition count 106
Applied a total of 61 rules in 35 ms. Remains 82 /109 variables (removed 27) and now considering 106/150 (removed 44) transitions.
// Phase 1: matrix 106 rows 82 cols
[2024-05-21 19:11:47] [INFO ] Computed 2 invariants in 16 ms
[2024-05-21 19:11:47] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 19:11:47] [INFO ] Invariant cache hit.
[2024-05-21 19:11:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:11:47] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:11:48] [INFO ] Invariant cache hit.
[2024-05-21 19:11:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/188 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 38/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/188 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 38/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 6080ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6095ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 106/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6474 ms. Remains : 82/109 places, 106/150 transitions.
Support contains 24 out of 82 places after structural reductions.
[2024-05-21 19:11:54] [INFO ] Flatten gal took : 26 ms
[2024-05-21 19:11:54] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:11:54] [INFO ] Input system was already deterministic with 106 transitions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (9233 resets) in 1474 ms. (27 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40001 steps (1973 resets) in 133 ms. (298 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (2537 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2008 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2018 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4112 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (4050 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1987 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3998 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
[2024-05-21 19:11:55] [INFO ] Invariant cache hit.
[2024-05-21 19:11:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 21/63 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 84/147 variables, 63/65 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 16/81 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 41/188 variables, 19/100 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 22/122 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 122 constraints, problems are : Problem set: 1 solved, 7 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 22/62 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 83/145 variables, 62/64 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 15/79 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 43/188 variables, 20/99 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 23/122 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 7/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 129 constraints, problems are : Problem set: 1 solved, 7 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 730 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 106/106 transitions.
Graph (complete) has 248 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 74 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 74 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 72 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 72 transition count 90
Applied a total of 20 rules in 27 ms. Remains 72 /82 variables (removed 10) and now considering 90/106 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 72/82 places, 90/106 transitions.
RANDOM walk for 40000 steps (9236 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1955 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2002 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4169 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4168 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1953 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4031 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 10002 steps, run visited all 6 properties in 64 ms. (steps per millisecond=156 )
Probabilistic random walk after 10002 steps, saw 4385 distinct states, run finished after 67 ms. (steps per millisecond=149 ) properties seen :6
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 273 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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) U X(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 15 ms. Remains 61 /82 variables (removed 21) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 19:11:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:11:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:11:57] [INFO ] Invariant cache hit.
[2024-05-21 19:11:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:11:57] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-21 19:11:57] [INFO ] Invariant cache hit.
[2024-05-21 19:11:57] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3010ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3011ms
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 71/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3148 ms. Remains : 61/82 places, 71/106 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-00 finished in 3513 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 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 66 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 64 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 66
Applied a total of 51 rules in 24 ms. Remains 59 /82 variables (removed 23) and now considering 66/106 (removed 40) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 19:12:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:12:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:12:00] [INFO ] Invariant cache hit.
[2024-05-21 19:12:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:12:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-21 19:12:00] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 19:12:00] [INFO ] Invariant cache hit.
[2024-05-21 19:12:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2270ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/82 places, 66/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2412 ms. Remains : 59/82 places, 66/106 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-02 finished in 2463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 66 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 78
Applied a total of 37 rules in 10 ms. Remains 64 /82 variables (removed 18) and now considering 78/106 (removed 28) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 19:12:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:12:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:12:03] [INFO ] Invariant cache hit.
[2024-05-21 19:12:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:12:03] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-21 19:12:03] [INFO ] Invariant cache hit.
[2024-05-21 19:12:03] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 89 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/166 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 166 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3192ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3193ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 78/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3317 ms. Remains : 64/82 places, 78/106 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-04 finished in 3436 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(((p1&&X(p1))||p0)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 68 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 81
Applied a total of 35 rules in 11 ms. Remains 66 /82 variables (removed 16) and now considering 81/106 (removed 25) transitions.
// Phase 1: matrix 81 rows 66 cols
[2024-05-21 19:12:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:12:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 19:12:06] [INFO ] Invariant cache hit.
[2024-05-21 19:12:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 19:12:06] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-21 19:12:06] [INFO ] Invariant cache hit.
[2024-05-21 19:12:06] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 97 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 80/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 177 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3728ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3729ms
Starting structural reductions in LTL mode, iteration 1 : 66/82 places, 81/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3863 ms. Remains : 66/82 places, 81/106 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-05 finished in 4482 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 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 63 transition count 73
Applied a total of 42 rules in 7 ms. Remains 63 /82 variables (removed 19) and now considering 73/106 (removed 33) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 19:12:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:12:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:12:11] [INFO ] Invariant cache hit.
[2024-05-21 19:12:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:12:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 19:12:11] [INFO ] Invariant cache hit.
[2024-05-21 19:12:11] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2808ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 73/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2922 ms. Remains : 63/82 places, 73/106 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-06 finished in 3005 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(F(p1)))||(X(!p0)&&G(p2)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 63 transition count 74
Applied a total of 40 rules in 3 ms. Remains 63 /82 variables (removed 19) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 19:12:14] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:12:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:12:14] [INFO ] Invariant cache hit.
[2024-05-21 19:12:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:12:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:14] [INFO ] Invariant cache hit.
[2024-05-21 19:12:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 87 constraints, problems are : Problem set: 0 solved, 73 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 73/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 160 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2702ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2703ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 74/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2811 ms. Remains : 63/82 places, 74/106 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-07
Product exploration explored 100000 steps with 31245 reset in 207 ms.
Product exploration explored 100000 steps with 31293 reset in 185 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 111 ms. Reduced automaton from 6 states, 29 edges and 3 AP (stutter sensitive) to 6 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9210 resets) in 323 ms. (123 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (4102 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2012 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4110 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (4042 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1993 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
[2024-05-21 19:12:18] [INFO ] Invariant cache hit.
[2024-05-21 19:12:18] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 19:12:18] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 19/46 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 59/105 variables, 46/49 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 7/56 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 30/135 variables, 16/72 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 14/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/137 variables, 1/87 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 1/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 88 constraints, problems are : Problem set: 2 solved, 3 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 19/46 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 59/105 variables, 46/49 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 7/56 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 30/135 variables, 16/72 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 14/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 3/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/137 variables, 1/90 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 1/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/137 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 91 constraints, problems are : Problem set: 2 solved, 3 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 282ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Applied a total of 2 rules in 4 ms. Remains 62 /63 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/63 places, 73/74 transitions.
RANDOM walk for 40000 steps (9120 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3958 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4063 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3979 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 6232 steps, run visited all 3 properties in 57 ms. (steps per millisecond=109 )
Probabilistic random walk after 6232 steps, saw 2819 distinct states, run finished after 57 ms. (steps per millisecond=109 ) properties seen :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (G (OR p1 p2 (NOT p0))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1)]
Knowledge based reduction with 25 factoid took 400 ms. Reduced automaton from 6 states, 29 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:12:19] [INFO ] Invariant cache hit.
[2024-05-21 19:12:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:12:19] [INFO ] Invariant cache hit.
[2024-05-21 19:12:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:12:19] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:19] [INFO ] Invariant cache hit.
[2024-05-21 19:12:19] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 87 constraints, problems are : Problem set: 0 solved, 73 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 73/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 160 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2786ms
Finished structural reductions in LTL mode , in 1 iterations and 2900 ms. Remains : 63/63 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 132 ms. Reduced automaton from 6 states, 22 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9231 resets) in 250 ms. (159 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (4165 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1992 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4056 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1986 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2044 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2044 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
[2024-05-21 19:12:23] [INFO ] Invariant cache hit.
[2024-05-21 19:12:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 19:12:23] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 59/105 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 30/135 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/137 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 88 constraints, problems are : Problem set: 0 solved, 6 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 59/105 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 30/135 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/137 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/137 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 94 constraints, problems are : Problem set: 0 solved, 6 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 129 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Applied a total of 2 rules in 4 ms. Remains 62 /63 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 62/63 places, 73/74 transitions.
RANDOM walk for 40000 steps (9190 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4066 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4018 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6232 steps, run visited all 2 properties in 29 ms. (steps per millisecond=214 )
Probabilistic random walk after 6232 steps, saw 2819 distinct states, run finished after 29 ms. (steps per millisecond=214 ) properties seen :2
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F p1)]
Knowledge based reduction with 17 factoid took 387 ms. Reduced automaton from 6 states, 22 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 31498 reset in 205 ms.
Product exploration explored 100000 steps with 31420 reset in 183 ms.
Built C files in :
/tmp/ltsmin5607002633830265660
[2024-05-21 19:12:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5607002633830265660
Running compilation step : cd /tmp/ltsmin5607002633830265660;'/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 289 ms.
Running link step : cd /tmp/ltsmin5607002633830265660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5607002633830265660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12353369345999535944.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-07 finished in 12276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&G(!p2)))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 69 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 74
Applied a total of 38 rules in 9 ms. Remains 65 /82 variables (removed 17) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 65 cols
[2024-05-21 19:12:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:12:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:12:26] [INFO ] Invariant cache hit.
[2024-05-21 19:12:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:12:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:26] [INFO ] Invariant cache hit.
[2024-05-21 19:12:26] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2736ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2737ms
Starting structural reductions in LTL mode, iteration 1 : 65/82 places, 74/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2864 ms. Remains : 65/82 places, 74/106 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-08
Product exploration explored 100000 steps with 22855 reset in 95 ms.
Product exploration explored 100000 steps with 22946 reset in 95 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
RANDOM walk for 40000 steps (9090 resets) in 83 ms. (476 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (2036 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2029 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2024-05-21 19:12:29] [INFO ] Invariant cache hit.
[2024-05-21 19:12:29] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 73
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 64/65 places, 73/74 transitions.
RANDOM walk for 40000 steps (9097 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2059 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2030 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7757 steps, run visited all 2 properties in 17 ms. (steps per millisecond=456 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 17 ms. (steps per millisecond=456 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p2), (F (NOT (AND (OR p2 p1) (OR (NOT p0) p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 487 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 191 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:12:31] [INFO ] Invariant cache hit.
[2024-05-21 19:12:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 19:12:31] [INFO ] Invariant cache hit.
[2024-05-21 19:12:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:12:31] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:31] [INFO ] Invariant cache hit.
[2024-05-21 19:12:31] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2729ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2730ms
Finished structural reductions in LTL mode , in 1 iterations and 2850 ms. Remains : 65/65 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
RANDOM walk for 40000 steps (9168 resets) in 108 ms. (366 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (2047 resets) in 33 ms. (1176 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (2098 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2057 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-05-21 19:12:34] [INFO ] Invariant cache hit.
[2024-05-21 19:12:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 981 steps, including 99 resets, run visited all 1 properties in 1 ms. (steps per millisecond=981 )
Parikh walk visited 2 properties in 17 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p2), (F (NOT (AND (OR p2 p1) (OR (NOT p0) p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 194 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 209 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Product exploration explored 100000 steps with 22859 reset in 90 ms.
Product exploration explored 100000 steps with 22867 reset in 94 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 188 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:12:36] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:36] [INFO ] Invariant cache hit.
[2024-05-21 19:12:36] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2739ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2740ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2750 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin1462694599026430070
[2024-05-21 19:12:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1462694599026430070
Running compilation step : cd /tmp/ltsmin1462694599026430070;'/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 173 ms.
Running link step : cd /tmp/ltsmin1462694599026430070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1462694599026430070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11508880871643346362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:12:53] [INFO ] Invariant cache hit.
[2024-05-21 19:12:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:12:54] [INFO ] Invariant cache hit.
[2024-05-21 19:12:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:12:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:12:54] [INFO ] Invariant cache hit.
[2024-05-21 19:12:54] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2761ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2763ms
Finished structural reductions in LTL mode , in 1 iterations and 2872 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin15561365763354728976
[2024-05-21 19:12:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15561365763354728976
Running compilation step : cd /tmp/ltsmin15561365763354728976;'/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 174 ms.
Running link step : cd /tmp/ltsmin15561365763354728976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15561365763354728976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15730197061402573321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:13:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:13:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:13:12] [INFO ] Time to serialize gal into /tmp/LTL12814526210108515571.gal : 2 ms
[2024-05-21 19:13:12] [INFO ] Time to serialize properties into /tmp/LTL17771381827432460379.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/LTL12814526210108515571.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2120381112274034250.hoa' '-atoms' '/tmp/LTL17771381827432460379.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/LTL17771381827432460379.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2120381112274034250.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:13:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:13:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:13:27] [INFO ] Time to serialize gal into /tmp/LTL8226492529407418780.gal : 2 ms
[2024-05-21 19:13:27] [INFO ] Time to serialize properties into /tmp/LTL16452015239814720120.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/LTL8226492529407418780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16452015239814720120.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(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...311
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F!"((s1<1)||(l133<1))" | G("((s1>=1)&&(l34...221
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Detected timeout of ITS tools.
[2024-05-21 19:13:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:13:42] [INFO ] Applying decomposition
[2024-05-21 19:13:42] [INFO ] Flatten gal took : 4 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/graph7390708946990371706.txt' '-o' '/tmp/graph7390708946990371706.bin' '-w' '/tmp/graph7390708946990371706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7390708946990371706.bin' '-l' '-1' '-v' '-w' '/tmp/graph7390708946990371706.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:13:42] [INFO ] Decomposing Gal with order
[2024-05-21 19:13:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:13:42] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 19:13:42] [INFO ] Flatten gal took : 40 ms
[2024-05-21 19:13:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 8 ms.
[2024-05-21 19:13:42] [INFO ] Time to serialize gal into /tmp/LTL7025129138208689226.gal : 3 ms
[2024-05-21 19:13:42] [INFO ] Time to serialize properties into /tmp/LTL13220775325541800726.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/LTL7025129138208689226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13220775325541800726.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(X(F((G(F((!("((i0.u0.s1>=1)&&(i5.u2.l345>=1))"))U(("((!((i0.u0.s1>=1)&&(i1.u11.l484>=1)))&&(!((i0.u0.s1>=1)&&(i5.u2.l345>=1))))")...421
Formula 0 simplified : XXG(FG("((i0.u0.s1>=1)&&(i5.u2.l345>=1))" M !"((!((i0.u0.s1>=1)&&(i1.u11.l484>=1)))&&(!((i0.u0.s1>=1)&&(i5.u2.l345>=1))))") & (F!"((...307
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-08 finished in 90975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((G(!p0)||F((!p0&&F(p1))))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 67 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 60 transition count 69
Applied a total of 49 rules in 5 ms. Remains 60 /82 variables (removed 22) and now considering 69/106 (removed 37) transitions.
// Phase 1: matrix 69 rows 60 cols
[2024-05-21 19:13:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:13:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:13:57] [INFO ] Invariant cache hit.
[2024-05-21 19:13:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:13:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-21 19:13:57] [INFO ] Invariant cache hit.
[2024-05-21 19:13:57] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 85 constraints, problems are : Problem set: 0 solved, 68 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 153 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2891ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2891ms
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 69/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3015 ms. Remains : 60/82 places, 69/106 transitions.
Stuttering acceptance computed with spot in 137 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-10
Product exploration explored 100000 steps with 23012 reset in 91 ms.
Product exploration explored 100000 steps with 22928 reset in 89 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 11490 steps (2633 resets) in 30 ms. (370 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 19:14:01] [INFO ] Invariant cache hit.
[2024-05-21 19:14:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:14:01] [INFO ] Invariant cache hit.
[2024-05-21 19:14:01] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:14:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-21 19:14:01] [INFO ] Invariant cache hit.
[2024-05-21 19:14:01] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 85 constraints, problems are : Problem set: 0 solved, 68 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 153 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2941ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2941ms
Finished structural reductions in LTL mode , in 1 iterations and 3063 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 7296 steps (1677 resets) in 24 ms. (291 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23095 reset in 85 ms.
Product exploration explored 100000 steps with 22962 reset in 83 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 19:14:05] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 19:14:05] [INFO ] Invariant cache hit.
[2024-05-21 19:14:05] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 85 constraints, problems are : Problem set: 0 solved, 68 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 153 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2913ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2926 ms. Remains : 60/60 places, 69/69 transitions.
Built C files in :
/tmp/ltsmin2510947077306713717
[2024-05-21 19:14:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2510947077306713717
Running compilation step : cd /tmp/ltsmin2510947077306713717;'/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 172 ms.
Running link step : cd /tmp/ltsmin2510947077306713717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2510947077306713717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13020869985289007898.hoa' '--buchi-type=spotba'
LTSmin run took 557 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-10 finished in 12329 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 U (p1||G(!p0)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 60 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 60 transition count 71
Applied a total of 49 rules in 17 ms. Remains 60 /82 variables (removed 22) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 19:14:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:14:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 19:14:09] [INFO ] Invariant cache hit.
[2024-05-21 19:14:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:14:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 19:14:09] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:14:09] [INFO ] Invariant cache hit.
[2024-05-21 19:14:09] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2491ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/82 places, 71/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2615 ms. Remains : 60/82 places, 71/106 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-11
Product exploration explored 100000 steps with 23091 reset in 101 ms.
Product exploration explored 100000 steps with 22966 reset in 106 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND p0 (NOT p1))]
RANDOM walk for 26453 steps (6024 resets) in 63 ms. (413 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 19:14:12] [INFO ] Invariant cache hit.
[2024-05-21 19:14:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:14:13] [INFO ] Invariant cache hit.
[2024-05-21 19:14:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:14:13] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-21 19:14:13] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:14:13] [INFO ] Invariant cache hit.
[2024-05-21 19:14:13] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2481ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2590 ms. Remains : 60/60 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND p0 (NOT p1))]
RANDOM walk for 28301 steps (6444 resets) in 72 ms. (387 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22908 reset in 94 ms.
Product exploration explored 100000 steps with 22874 reset in 97 ms.
Built C files in :
/tmp/ltsmin2623925240025386942
[2024-05-21 19:14:16] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 19:14:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:16] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 19:14:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:16] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 19:14:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2623925240025386942
Running compilation step : cd /tmp/ltsmin2623925240025386942;'/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 180 ms.
Running link step : cd /tmp/ltsmin2623925240025386942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2623925240025386942;'/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/stateBased11310952529782455460.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-11 finished in 6919 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)&&p1))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 12 ms. Remains 61 /82 variables (removed 21) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 19:14:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:14:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:14:16] [INFO ] Invariant cache hit.
[2024-05-21 19:14:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:14:16] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-21 19:14:16] [INFO ] Redundant transitions in 0 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:14:16] [INFO ] Invariant cache hit.
[2024-05-21 19:14:16] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2982ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2982ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 71/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3105 ms. Remains : 61/82 places, 71/106 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-13
Product exploration explored 100000 steps with 22850 reset in 85 ms.
Product exploration explored 100000 steps with 22887 reset in 88 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 28285 steps (6465 resets) in 55 ms. (505 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, p0]
Stuttering acceptance computed with spot in 50 ms :[p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 19:14:20] [INFO ] Invariant cache hit.
[2024-05-21 19:14:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:14:20] [INFO ] Invariant cache hit.
[2024-05-21 19:14:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:14:20] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 19:14:20] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:14:20] [INFO ] Invariant cache hit.
[2024-05-21 19:14:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2947ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3064 ms. Remains : 61/61 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 10851 steps (2487 resets) in 17 ms. (602 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Product exploration explored 100000 steps with 22869 reset in 87 ms.
Product exploration explored 100000 steps with 22942 reset in 88 ms.
Built C files in :
/tmp/ltsmin7295678225743835740
[2024-05-21 19:14:24] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 19:14:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:24] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 19:14:24] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:24] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 19:14:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7295678225743835740
Running compilation step : cd /tmp/ltsmin7295678225743835740;'/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 191 ms.
Running link step : cd /tmp/ltsmin7295678225743835740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7295678225743835740;'/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/stateBased66307726470747096.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 19:14:39] [INFO ] Invariant cache hit.
[2024-05-21 19:14:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:14:39] [INFO ] Invariant cache hit.
[2024-05-21 19:14:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:14:39] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 19:14:39] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:14:39] [INFO ] Invariant cache hit.
[2024-05-21 19:14:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 70 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2958ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2958ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3075 ms. Remains : 61/61 places, 71/71 transitions.
Built C files in :
/tmp/ltsmin7195935683156951787
[2024-05-21 19:14:42] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 19:14:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:42] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 19:14:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:42] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 19:14:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:14:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7195935683156951787
Running compilation step : cd /tmp/ltsmin7195935683156951787;'/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 191 ms.
Running link step : cd /tmp/ltsmin7195935683156951787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7195935683156951787;'/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/stateBased2632491314293139696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:14:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:14:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:14:57] [INFO ] Time to serialize gal into /tmp/LTL8395930076467662430.gal : 1 ms
[2024-05-21 19:14:57] [INFO ] Time to serialize properties into /tmp/LTL13597032282735565558.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/LTL8395930076467662430.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11229684901419666833.hoa' '-atoms' '/tmp/LTL13597032282735565558.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/LTL13597032282735565558.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11229684901419666833.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t62, t75, t76, t77, t78, t80, t81, t82, t83, t84, t85, t86, t87, t8...294
Detected timeout of ITS tools.
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:15:12] [INFO ] Time to serialize gal into /tmp/LTL3013902841489894416.gal : 1 ms
[2024-05-21 19:15:12] [INFO ] Time to serialize properties into /tmp/LTL4528153688401633689.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/LTL3013902841489894416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4528153688401633689.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(F("((s1<1)||(l510<1))")))||(("((s1>=1)&&(l510>=1))")&&(F("((s1<1)||(l510<1))"))))))
Formula 0 simplified : G(FG!"((s1<1)||(l510<1))" & (!"((s1>=1)&&(l510>=1))" | G!"((s1<1)||(l510<1))"))
Detected timeout of ITS tools.
[2024-05-21 19:15:27] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:15:27] [INFO ] Applying decomposition
[2024-05-21 19:15:27] [INFO ] Flatten gal took : 4 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/graph12901459176351899584.txt' '-o' '/tmp/graph12901459176351899584.bin' '-w' '/tmp/graph12901459176351899584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12901459176351899584.bin' '-l' '-1' '-v' '-w' '/tmp/graph12901459176351899584.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:15:27] [INFO ] Decomposing Gal with order
[2024-05-21 19:15:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:15:27] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-21 19:15:27] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:15:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 2 ms.
[2024-05-21 19:15:27] [INFO ] Time to serialize gal into /tmp/LTL7463483765541749010.gal : 1 ms
[2024-05-21 19:15:27] [INFO ] Time to serialize properties into /tmp/LTL268610106658413815.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/LTL7463483765541749010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL268610106658413815.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...253
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i0.u0.s1<1)||(i0.u0.l510<1))")))||(("((i0.u0.s1>=1)&&(i0.u0.l510>=1))")&&(F("((i0.u0.s1<1)||(i0.u0.l510<1))"))))))
Formula 0 simplified : G(FG!"((i0.u0.s1<1)||(i0.u0.l510<1))" & (!"((i0.u0.s1>=1)&&(i0.u0.l510>=1))" | G!"((i0.u0.s1<1)||(i0.u0.l510<1))"))
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-13 finished in 86251 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 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 89
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 89
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 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 64 transition count 75
Applied a total of 40 rules in 18 ms. Remains 64 /82 variables (removed 18) and now considering 75/106 (removed 31) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 19:15:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:15:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:15:42] [INFO ] Invariant cache hit.
[2024-05-21 19:15:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:15:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 19:15:42] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-21 19:15:42] [INFO ] Invariant cache hit.
[2024-05-21 19:15:42] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3018ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 75/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3170 ms. Remains : 64/82 places, 75/106 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-14 finished in 3225 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 (!F((F(p0)||F(G(p0))))||!p1)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 79
Applied a total of 35 rules in 10 ms. Remains 65 /82 variables (removed 17) and now considering 79/106 (removed 27) transitions.
// Phase 1: matrix 79 rows 65 cols
[2024-05-21 19:15:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:15:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 19:15:46] [INFO ] Invariant cache hit.
[2024-05-21 19:15:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:15:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 19:15:46] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-21 19:15:46] [INFO ] Invariant cache hit.
[2024-05-21 19:15:46] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/144 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 90 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/144 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 78/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 168 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 79/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3254 ms. Remains : 65/82 places, 79/106 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-15 finished in 3336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&G(!p2)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m10-LTLFireability-08
Stuttering acceptance computed with spot in 208 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 69 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 74
Applied a total of 38 rules in 11 ms. Remains 65 /82 variables (removed 17) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 65 cols
[2024-05-21 19:15:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:15:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:15:49] [INFO ] Invariant cache hit.
[2024-05-21 19:15:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:15:49] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:15:49] [INFO ] Invariant cache hit.
[2024-05-21 19:15:49] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2774ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2780ms
Starting structural reductions in LI_LTL mode, iteration 1 : 65/82 places, 74/106 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2901 ms. Remains : 65/82 places, 74/106 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-08
Product exploration explored 100000 steps with 22973 reset in 101 ms.
Product exploration explored 100000 steps with 23050 reset in 99 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
RANDOM walk for 40000 steps (9138 resets) in 103 ms. (384 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (1985 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2047 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2021 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-21 19:15:53] [INFO ] Invariant cache hit.
[2024-05-21 19:15:53] [INFO ] State equation strengthened by 23 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) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 133 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 73
Applied a total of 2 rules in 2 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 64/65 places, 73/74 transitions.
RANDOM walk for 40000 steps (9121 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2016 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2021 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2025 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 7757 steps, run visited all 3 properties in 23 ms. (steps per millisecond=337 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 23 ms. (steps per millisecond=337 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p2), (F (NOT (AND (OR p2 p1) (OR (NOT p0) p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:15:54] [INFO ] Invariant cache hit.
[2024-05-21 19:15:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:15:54] [INFO ] Invariant cache hit.
[2024-05-21 19:15:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:15:54] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:15:54] [INFO ] Invariant cache hit.
[2024-05-21 19:15:54] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2736ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2736ms
Finished structural reductions in LTL mode , in 1 iterations and 2853 ms. Remains : 65/65 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
RANDOM walk for 40000 steps (9198 resets) in 125 ms. (317 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (2049 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2025 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2005 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
[2024-05-21 19:15:57] [INFO ] Invariant cache hit.
[2024-05-21 19:15:57] [INFO ] State equation strengthened by 23 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) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/108 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/139 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 73
Applied a total of 2 rules in 2 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 64/65 places, 73/74 transitions.
RANDOM walk for 40000 steps (9238 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2028 resets) in 60 ms. (655 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (2011 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2054 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
// Phase 1: matrix 73 rows 64 cols
[2024-05-21 19:15:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:15:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/111 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/137 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/111 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/137 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 73/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 64/64 places, 73/73 transitions.
RANDOM walk for 40000 steps (9181 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2024 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2055 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7757 steps, run visited all 2 properties in 15 ms. (steps per millisecond=517 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 15 ms. (steps per millisecond=517 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p2), (F (NOT (AND (OR p2 p1) (OR (NOT p0) p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 184 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Product exploration explored 100000 steps with 23049 reset in 93 ms.
Product exploration explored 100000 steps with 22802 reset in 98 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:15:59] [INFO ] Redundant transitions in 3 ms returned []
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 74 rows 65 cols
[2024-05-21 19:15:59] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:15:59] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2726ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2727ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2736 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin14443225402926313791
[2024-05-21 19:16:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14443225402926313791
Running compilation step : cd /tmp/ltsmin14443225402926313791;'/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 183 ms.
Running link step : cd /tmp/ltsmin14443225402926313791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14443225402926313791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13969162433120429372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:16:17] [INFO ] Invariant cache hit.
[2024-05-21 19:16:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:16:17] [INFO ] Invariant cache hit.
[2024-05-21 19:16:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:16:17] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:16:17] [INFO ] Invariant cache hit.
[2024-05-21 19:16:17] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/139 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2709ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2710ms
Finished structural reductions in LTL mode , in 1 iterations and 2836 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin17836152812488824172
[2024-05-21 19:16:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17836152812488824172
Running compilation step : cd /tmp/ltsmin17836152812488824172;'/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 176 ms.
Running link step : cd /tmp/ltsmin17836152812488824172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17836152812488824172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased43718518139896828.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:16:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:16:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:16:35] [INFO ] Time to serialize gal into /tmp/LTL8631625922972799042.gal : 1 ms
[2024-05-21 19:16:35] [INFO ] Time to serialize properties into /tmp/LTL15751764344241775109.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/LTL8631625922972799042.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2376441733378125341.hoa' '-atoms' '/tmp/LTL15751764344241775109.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/LTL15751764344241775109.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2376441733378125341.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:16:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:16:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:16:50] [INFO ] Time to serialize gal into /tmp/LTL542455648471413791.gal : 1 ms
[2024-05-21 19:16:50] [INFO ] Time to serialize properties into /tmp/LTL5395387803831851904.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/LTL542455648471413791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5395387803831851904.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(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...311
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F!"((s1<1)||(l133<1))" | G("((s1>=1)&&(l34...221
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:17:05] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:17:05] [INFO ] Applying decomposition
[2024-05-21 19:17:05] [INFO ] Flatten gal took : 3 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/graph8863869267466670177.txt' '-o' '/tmp/graph8863869267466670177.bin' '-w' '/tmp/graph8863869267466670177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8863869267466670177.bin' '-l' '-1' '-v' '-w' '/tmp/graph8863869267466670177.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:17:05] [INFO ] Decomposing Gal with order
[2024-05-21 19:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:17:05] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 19:17:05] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 2 ms.
[2024-05-21 19:17:05] [INFO ] Time to serialize gal into /tmp/LTL16332919386804648677.gal : 1 ms
[2024-05-21 19:17:05] [INFO ] Time to serialize properties into /tmp/LTL12913643596538482803.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/LTL16332919386804648677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12913643596538482803.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 : !((X(X(F((G(F((!("((i0.u1.s1>=1)&&(i5.u0.l345>=1))"))U(("((!((i0.u1.s1>=1)&&(i3.u13.l484>=1)))&&(!((i0.u1.s1>=1)&&(i5.u0.l345>=1))))")...421
Formula 0 simplified : XXG(FG("((i0.u1.s1>=1)&&(i5.u0.l345>=1))" M !"((!((i0.u1.s1>=1)&&(i3.u13.l484>=1)))&&(!((i0.u1.s1>=1)&&(i5.u0.l345>=1))))") & (F!"((...307
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-08 finished in 91597 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)&&p1))))'
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14878307658023623459
[2024-05-21 19:17:21] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2024-05-21 19:17:21] [INFO ] Applying decomposition
[2024-05-21 19:17:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:17:21] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2024-05-21 19:17:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:17:21] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2024-05-21 19:17:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7145509488472616693.txt' '-o' '/tmp/graph7145509488472616693.bin' '-w' '/tmp/graph7145509488472616693.weights'
[2024-05-21 19:17:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14878307658023623459
Running compilation step : cd /tmp/ltsmin14878307658023623459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7145509488472616693.bin' '-l' '-1' '-v' '-w' '/tmp/graph7145509488472616693.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:17:21] [INFO ] Decomposing Gal with order
[2024-05-21 19:17:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:17:21] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 3 ms.
[2024-05-21 19:17:21] [INFO ] Time to serialize gal into /tmp/LTLFireability18082038765829757133.gal : 2 ms
[2024-05-21 19:17:21] [INFO ] Time to serialize properties into /tmp/LTLFireability10730208828350155499.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/LTLFireability18082038765829757133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10730208828350155499.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...278
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((i0.u0.s1>=1)&&(i4.u13.l345>=1))"))U(("((!((i0.u0.s1>=1)&&(i6.u16.l484>=1)))&&(!((i0.u0.s1>=1)&&(i4.u13.l345>=1))))...432
Formula 0 simplified : XXG(FG("((i0.u0.s1>=1)&&(i4.u13.l345>=1))" M !"((!((i0.u0.s1>=1)&&(i6.u16.l484>=1)))&&(!((i0.u0.s1>=1)&&(i4.u13.l345>=1))))") & (F"(...312
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin14878307658023623459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14878307658023623459;'/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(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: LTL layer: formula: X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.004: "X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: There are 112 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.029: State length is 83, there are 119 groups
pins2lts-mc-linux64( 0/ 8), 0.029: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.029: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.029: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.029: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.046: [Blue] ~40 levels ~960 states ~2496 transitions
pins2lts-mc-linux64( 4/ 8), 0.053: [Blue] ~46 levels ~1920 states ~5192 transitions
pins2lts-mc-linux64( 2/ 8), 0.067: [Blue] ~81 levels ~3840 states ~8912 transitions
pins2lts-mc-linux64( 2/ 8), 0.092: [Blue] ~81 levels ~7680 states ~17264 transitions
pins2lts-mc-linux64( 2/ 8), 0.134: [Blue] ~81 levels ~15360 states ~33208 transitions
pins2lts-mc-linux64( 4/ 8), 0.215: [Blue] ~97 levels ~30720 states ~71200 transitions
pins2lts-mc-linux64( 7/ 8), 0.395: [Blue] ~70 levels ~61440 states ~129608 transitions
pins2lts-mc-linux64( 7/ 8), 0.712: [Blue] ~70 levels ~122880 states ~258208 transitions
pins2lts-mc-linux64( 4/ 8), 1.294: [Blue] ~285 levels ~245760 states ~618496 transitions
pins2lts-mc-linux64( 7/ 8), 2.105: [Blue] ~70 levels ~491520 states ~1058712 transitions
pins2lts-mc-linux64( 7/ 8), 3.171: [Blue] ~70 levels ~983040 states ~2132064 transitions
pins2lts-mc-linux64( 7/ 8), 4.855: [Blue] ~70 levels ~1966080 states ~4321848 transitions
pins2lts-mc-linux64( 7/ 8), 8.237: [Blue] ~70 levels ~3932160 states ~8762792 transitions
pins2lts-mc-linux64( 6/ 8), 15.770: [Blue] ~5416 levels ~7864320 states ~19907632 transitions
pins2lts-mc-linux64( 6/ 8), 30.149: [Blue] ~8434 levels ~15728640 states ~40841512 transitions
pins2lts-mc-linux64( 6/ 8), 58.956: [Blue] ~12700 levels ~31457280 states ~82131888 transitions
pins2lts-mc-linux64( 6/ 8), 117.286: [Blue] ~18049 levels ~62914560 states ~165350512 transitions
pins2lts-mc-linux64( 6/ 8), 238.564: [Blue] ~35912 levels ~125829120 states ~342525272 transitions
pins2lts-mc-linux64( 0/ 8), 290.425: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 290.504:
pins2lts-mc-linux64( 0/ 8), 290.504: Explored 139076959 states 413748644 transitions, fanout: 2.975
pins2lts-mc-linux64( 0/ 8), 290.504: Total exploration time 290.460 sec (290.360 sec minimum, 290.409 sec on average)
pins2lts-mc-linux64( 0/ 8), 290.504: States per second: 478816, Transitions per second: 1424460
pins2lts-mc-linux64( 0/ 8), 290.504:
pins2lts-mc-linux64( 0/ 8), 290.504: State space has 134217321 states, 6166610 are accepting
pins2lts-mc-linux64( 0/ 8), 290.504: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 290.504: blue states: 139076959 (103.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 290.504: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 290.504: all-red states: 6166610 (4.59%), bogus 532 (0.00%)
pins2lts-mc-linux64( 0/ 8), 290.504:
pins2lts-mc-linux64( 0/ 8), 290.504: Total memory used for local state coloring: 76.5MB
pins2lts-mc-linux64( 0/ 8), 290.504:
pins2lts-mc-linux64( 0/ 8), 290.504: Queue width: 8B, total height: 5013335, memory: 38.25MB
pins2lts-mc-linux64( 0/ 8), 290.504: Tree memory: 1228.9MB, 9.6 B/state, compr.: 2.9%
pins2lts-mc-linux64( 0/ 8), 290.504: Tree fill ratio (roots/leafs): 99.0%/80.0%
pins2lts-mc-linux64( 0/ 8), 290.504: Stored 106 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 290.504: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 290.504: Est. total memory use: 1267.2MB (~1062.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14878307658023623459;'/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(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14878307658023623459;'/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(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==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:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t9, t11, t26, t28, t29, t30, t31, t33, t34, t54, t55, t56, t62, t63, t66, t67...412
Computing Next relation with stutter on 5.07298e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:39:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:39:12] [INFO ] Time to serialize gal into /tmp/LTLFireability8660811767226572315.gal : 1 ms
[2024-05-21 19:39:12] [INFO ] Time to serialize properties into /tmp/LTLFireability2436530613698421795.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/LTLFireability8660811767226572315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2436530613698421795.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...297
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...316
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F"((s1>=1)&&(l133>=1))" | G("((s1>=1)&&(l3...222
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...451
Computing Next relation with stutter on 5.07298e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:01:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:01:03] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 20:01:03] [INFO ] Transformed 82 places.
[2024-05-21 20:01:03] [INFO ] Transformed 106 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 20:01:03] [INFO ] Time to serialize gal into /tmp/LTLFireability5403492956795700245.gal : 1 ms
[2024-05-21 20:01:03] [INFO ] Time to serialize properties into /tmp/LTLFireability1855718242569969280.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/LTLFireability5403492956795700245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1855718242569969280.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...316
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F"((s1>=1)&&(l133>=1))" | G("((s1>=1)&&(l3...222
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...451
Computing Next relation with stutter on 5.07298e+08 deadlock states

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="DBSingleClientW-PT-d0m10"
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 DBSingleClientW-PT-d0m10, 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 r092-tall-171624189400484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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