Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716897156471

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 11:52:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 11:52:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:52:39] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2024-05-28 11:52:39] [INFO ] Transformed 1295 places.
[2024-05-28 11:52:39] [INFO ] Transformed 749 transitions.
[2024-05-28 11:52:39] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 19 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 374
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 196 transition count 368
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 385 place count 166 transition count 338
Iterating global reduction 2 with 30 rules applied. Total rules applied 415 place count 166 transition count 338
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 426 place count 166 transition count 327
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 440 place count 152 transition count 311
Iterating global reduction 3 with 14 rules applied. Total rules applied 454 place count 152 transition count 311
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 484 place count 152 transition count 281
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 486 place count 150 transition count 277
Iterating global reduction 4 with 2 rules applied. Total rules applied 488 place count 150 transition count 277
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 490 place count 148 transition count 275
Iterating global reduction 4 with 2 rules applied. Total rules applied 492 place count 148 transition count 275
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 493 place count 147 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 494 place count 147 transition count 274
Applied a total of 494 rules in 148 ms. Remains 147 /259 variables (removed 112) and now considering 274/749 (removed 475) transitions.
// Phase 1: matrix 274 rows 147 cols
[2024-05-28 11:52:39] [INFO ] Computed 5 invariants in 27 ms
[2024-05-28 11:52:40] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-28 11:52:40] [INFO ] Invariant cache hit.
[2024-05-28 11:52:40] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-28 11:52:40] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-05-28 11:52:40] [INFO ] Invariant cache hit.
[2024-05-28 11:52:41] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 1/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 21 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 11:52:49] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:52:49] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 274/421 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 174/333 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 11:52:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 0/421 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 334 constraints, problems are : Problem set: 3 solved, 270 unsolved in 28607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/147 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 7/13 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 274/421 variables, 147/160 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 174/334 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 270/604 constraints. Problems are: Problem set: 3 solved, 270 unsolved
[2024-05-28 11:53:22] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-28 11:53:22] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 2/606 constraints. Problems are: Problem set: 3 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 606 constraints, problems are : Problem set: 3 solved, 270 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 270/273 constraints, Known Traps: 10/10 constraints]
After SMT, in 59563ms problems are : Problem set: 3 solved, 270 unsolved
Search for dead transitions found 3 dead transitions in 59589ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 271/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 271
Applied a total of 3 rules in 6 ms. Remains 144 /147 variables (removed 3) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 144 cols
[2024-05-28 11:53:40] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 11:53:40] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-28 11:53:40] [INFO ] Invariant cache hit.
[2024-05-28 11:53:40] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-28 11:53:41] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/259 places, 271/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61749 ms. Remains : 144/259 places, 271/749 transitions.
Support contains 26 out of 144 places after structural reductions.
[2024-05-28 11:53:41] [INFO ] Flatten gal took : 92 ms
[2024-05-28 11:53:41] [INFO ] Flatten gal took : 45 ms
[2024-05-28 11:53:41] [INFO ] Input system was already deterministic with 271 transitions.
RANDOM walk for 40000 steps (8987 resets) in 3559 ms. (11 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (205 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (159 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (167 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (181 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (198 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (196 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (189 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (195 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (193 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (186 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (186 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (211 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (186 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (191 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (220 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (181 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (193 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (180 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (206 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (199 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (408 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 265120 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :14 out of 21
Probabilistic random walk after 265120 steps, saw 121619 distinct states, run finished after 3020 ms. (steps per millisecond=87 ) properties seen :14
[2024-05-28 11:53:46] [INFO ] Invariant cache hit.
[2024-05-28 11:53:46] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 199/312 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 101/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 103/415 variables, 31/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 72/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/415 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 321 constraints, problems are : Problem set: 0 solved, 7 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 144/144 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 11:53:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 199/312 variables, 113/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 101/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 103/415 variables, 31/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 72/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/415 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 329 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 144/144 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2038ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 17189 ms.
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 271/271 transitions.
Graph (complete) has 495 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 269
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 132 transition count 206
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 132 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 132 transition count 205
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 123 transition count 196
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 123 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 123 transition count 193
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 116 transition count 186
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 116 transition count 186
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 75 place count 116 transition count 172
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 77 place count 114 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 114 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 112 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 112 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 110 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 110 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 93 place count 110 transition count 159
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 95 place count 108 transition count 157
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 108 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 107 transition count 156
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 107 transition count 156
Applied a total of 99 rules in 70 ms. Remains 107 /144 variables (removed 37) and now considering 156/271 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 107/144 places, 156/271 transitions.
RANDOM walk for 40000 steps (8902 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1955 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1918 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1945 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 354879 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 7
Probabilistic random walk after 354879 steps, saw 154219 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 156 rows 107 cols
[2024-05-28 11:54:09] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 11:54:09] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 11:54:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 143/211 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 52/263 variables, 39/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 194 constraints, problems are : Problem set: 0 solved, 7 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 143/211 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 52/263 variables, 39/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 11:54:10] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 11 ms to minimize.
[2024-05-28 11:54:10] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1775ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 7044 ms.
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 156/156 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 105 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 105 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 104 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 104 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 104 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 103 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 103 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 102 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 102 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 101 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 101 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 100 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 100 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 145
Applied a total of 17 rules in 38 ms. Remains 99 /107 variables (removed 8) and now considering 145/156 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 99/107 places, 145/156 transitions.
RANDOM walk for 40000 steps (8875 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1939 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1923 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1902 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 306046 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 6
Probabilistic random walk after 306046 steps, saw 132784 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 145 rows 99 cols
[2024-05-28 11:54:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 11:54:21] [INFO ] State equation strengthened by 78 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) 107/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 125/238 variables, 87/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 38/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/244 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 180 constraints, problems are : Problem set: 0 solved, 6 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 125/238 variables, 87/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 38/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 6/244 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 11:54:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1744ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 9774 ms.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 145/145 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 99/99 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 145/145 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-05-28 11:54:33] [INFO ] Invariant cache hit.
[2024-05-28 11:54:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 11:54:33] [INFO ] Invariant cache hit.
[2024-05-28 11:54:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-28 11:54:33] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-28 11:54:33] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-28 11:54:33] [INFO ] Invariant cache hit.
[2024-05-28 11:54:33] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 145/244 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 78/181 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-28 11:54:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/244 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/244 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 182 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9825 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 145/244 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 78/182 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 144/326 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 326 constraints, problems are : Problem set: 0 solved, 144 unsolved in 12594 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints]
After SMT, in 22596ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 22599ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23042 ms. Remains : 99/99 places, 145/145 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 99 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 93 transition count 138
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 93 transition count 123
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 78 transition count 123
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 71 transition count 116
Applied a total of 57 rules in 18 ms. Remains 71 /99 variables (removed 28) and now considering 116/145 (removed 29) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 116 rows 71 cols
[2024-05-28 11:54:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:54:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 11:54:56] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 11:54:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 11:54:56] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 1
[2024-05-28 11:54:56] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-28 11:54:57] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1062 ms.
Computed a total of 30 stabilizing places and 47 stable transitions
Graph (complete) has 550 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!p0))) U (p1 U p2)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 107 transition count 145
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 107 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 89 place count 107 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 104 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 104 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 101 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 101 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 100 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 97 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 97 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 95 transition count 122
Applied a total of 113 rules in 26 ms. Remains 95 /144 variables (removed 49) and now considering 122/271 (removed 149) transitions.
// Phase 1: matrix 122 rows 95 cols
[2024-05-28 11:54:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:54:57] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 11:54:57] [INFO ] Invariant cache hit.
[2024-05-28 11:54:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 11:54:58] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-28 11:54:58] [INFO ] Invariant cache hit.
[2024-05-28 11:54:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/217 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 159 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/217 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 121/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 11:55:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 281 constraints, problems are : Problem set: 0 solved, 121 unsolved in 11405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints]
After SMT, in 16899ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 16903ms
Starting structural reductions in LTL mode, iteration 1 : 95/144 places, 122/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17507 ms. Remains : 95/144 places, 122/271 transitions.
Stuttering acceptance computed with spot in 461 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, true, (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-00
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 finished in 18087 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(F(p0))&&F(((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 130 transition count 173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 118 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 118 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 118 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 108 transition count 146
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 108 transition count 146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 87 place count 108 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 106 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 104 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 104 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 103 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 103 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 102 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 102 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 101 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 101 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 100 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 100 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 125
Applied a total of 107 rules in 24 ms. Remains 98 /144 variables (removed 46) and now considering 125/271 (removed 146) transitions.
// Phase 1: matrix 125 rows 98 cols
[2024-05-28 11:55:15] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:55:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 11:55:15] [INFO ] Invariant cache hit.
[2024-05-28 11:55:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 11:55:16] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-28 11:55:16] [INFO ] Invariant cache hit.
[2024-05-28 11:55:16] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 5 (OVERLAPS) 125/223 variables, 98/102 constraints. Problems are: Problem set: 2 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 62/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 164 constraints, problems are : Problem set: 2 solved, 122 unsolved in 6145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 122 unsolved
[2024-05-28 11:55:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 125/222 variables, 97/102 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 62/164 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 15/179 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 1/223 variables, 1/180 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 107/287 constraints. Problems are: Problem set: 2 solved, 122 unsolved
[2024-05-28 11:55:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 1/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 288 constraints, problems are : Problem set: 2 solved, 122 unsolved in 19408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/124 constraints, Known Traps: 2/2 constraints]
After SMT, in 25766ms problems are : Problem set: 2 solved, 122 unsolved
Search for dead transitions found 2 dead transitions in 25769ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 123/271 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 123
Applied a total of 2 rules in 1 ms. Remains 96 /98 variables (removed 2) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 96 cols
[2024-05-28 11:55:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:55:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 11:55:42] [INFO ] Invariant cache hit.
[2024-05-28 11:55:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 11:55:42] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/144 places, 123/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26865 ms. Remains : 96/144 places, 123/271 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 27190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 91 place count 106 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 103 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 94 transition count 121
Applied a total of 115 rules in 37 ms. Remains 94 /144 variables (removed 50) and now considering 121/271 (removed 150) transitions.
// Phase 1: matrix 121 rows 94 cols
[2024-05-28 11:55:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:55:42] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 11:55:42] [INFO ] Invariant cache hit.
[2024-05-28 11:55:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 11:55:43] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 11:55:43] [INFO ] Invariant cache hit.
[2024-05-28 11:55:43] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 11:55:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 159 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/215 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 120/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 279 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 19855ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 19858ms
Starting structural reductions in LTL mode, iteration 1 : 94/144 places, 121/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20484 ms. Remains : 94/144 places, 121/271 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 finished in 20675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F(!p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 102 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 92 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 90 transition count 113
Applied a total of 127 rules in 74 ms. Remains 90 /144 variables (removed 54) and now considering 113/271 (removed 158) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-05-28 11:56:03] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 11:56:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-28 11:56:03] [INFO ] Invariant cache hit.
[2024-05-28 11:56:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 11:56:04] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-28 11:56:04] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 11:56:04] [INFO ] Invariant cache hit.
[2024-05-28 11:56:04] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 11:56:08] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/203 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 149 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/203 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 112/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 261 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 16564ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 16568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/144 places, 113/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17238 ms. Remains : 90/144 places, 113/271 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 17404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 162
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 161
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 147
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 114 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 103 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 103 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 87 transition count 102
Applied a total of 131 rules in 9 ms. Remains 87 /144 variables (removed 57) and now considering 102/271 (removed 169) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 11:56:20] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:56:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 11:56:20] [INFO ] Invariant cache hit.
[2024-05-28 11:56:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 11:56:21] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-28 11:56:21] [INFO ] Invariant cache hit.
[2024-05-28 11:56:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 11:56:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 11:56:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8608 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
After SMT, in 14908ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 14911ms
Starting structural reductions in LTL mode, iteration 1 : 87/144 places, 102/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15310 ms. Remains : 87/144 places, 102/271 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 finished in 15390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 152
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 137
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 137
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 114 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 104 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 104 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 104 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 100 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 96 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 94 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 94 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 94 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 92 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 92 transition count 99
Applied a total of 121 rules in 15 ms. Remains 92 /144 variables (removed 52) and now considering 99/271 (removed 172) transitions.
// Phase 1: matrix 99 rows 92 cols
[2024-05-28 11:56:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:56:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 11:56:36] [INFO ] Invariant cache hit.
[2024-05-28 11:56:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 11:56:36] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 11:56:36] [INFO ] Invariant cache hit.
[2024-05-28 11:56:36] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/191 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 135 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/191 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 98/233 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 11:56:43] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:56:44] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
[2024-05-28 11:56:44] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 236 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9537 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 13841ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 13843ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 99/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14203 ms. Remains : 92/144 places, 99/271 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 finished in 14366 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 127 transition count 151
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 127 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 127 transition count 150
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 50 place count 112 transition count 135
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 112 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 112 transition count 128
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 101 transition count 117
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 101 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 101 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 96 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 96 transition count 105
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 91 transition count 100
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 88 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 88 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 88 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 85 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 84 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 83 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 82 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 81 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 81 transition count 87
Applied a total of 142 rules in 23 ms. Remains 81 /144 variables (removed 63) and now considering 87/271 (removed 184) transitions.
// Phase 1: matrix 87 rows 81 cols
[2024-05-28 11:56:50] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 11:56:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 11:56:50] [INFO ] Invariant cache hit.
[2024-05-28 11:56:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 11:56:50] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-28 11:56:50] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-28 11:56:50] [INFO ] Invariant cache hit.
[2024-05-28 11:56:50] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 11:56:53] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 11291ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/144 places, 87/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11616 ms. Remains : 81/144 places, 87/271 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
Product exploration explored 100000 steps with 22454 reset in 399 ms.
Product exploration explored 100000 steps with 22361 reset in 390 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 252 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8941 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1607 steps, run visited all 1 properties in 8 ms. (steps per millisecond=200 )
Probabilistic random walk after 1607 steps, saw 795 distinct states, run finished after 20 ms. (steps per millisecond=80 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-28 11:57:03] [INFO ] Invariant cache hit.
[2024-05-28 11:57:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 11:57:03] [INFO ] Invariant cache hit.
[2024-05-28 11:57:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 11:57:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-28 11:57:03] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-28 11:57:03] [INFO ] Invariant cache hit.
[2024-05-28 11:57:03] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 11:57:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4904 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 9636ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 9641ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9941 ms. Remains : 81/81 places, 87/87 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 252 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8941 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1607 steps, run visited all 1 properties in 29 ms. (steps per millisecond=55 )
Probabilistic random walk after 1607 steps, saw 795 distinct states, run finished after 29 ms. (steps per millisecond=55 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22483 reset in 118 ms.
Product exploration explored 100000 steps with 22569 reset in 126 ms.
Built C files in :
/tmp/ltsmin5863491729194628846
[2024-05-28 11:57:14] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2024-05-28 11:57:14] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:14] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2024-05-28 11:57:14] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:14] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2024-05-28 11:57:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:14] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5863491729194628846
Running compilation step : cd /tmp/ltsmin5863491729194628846;'/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 800 ms.
Running link step : cd /tmp/ltsmin5863491729194628846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin5863491729194628846;'/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/stateBased3265379700074987383.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-28 11:57:29] [INFO ] Invariant cache hit.
[2024-05-28 11:57:29] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 11:57:29] [INFO ] Invariant cache hit.
[2024-05-28 11:57:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 11:57:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-28 11:57:29] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-28 11:57:29] [INFO ] Invariant cache hit.
[2024-05-28 11:57:29] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/168 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 11:57:31] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 121 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/168 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 86/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 7887ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 7888ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8208 ms. Remains : 81/81 places, 87/87 transitions.
Built C files in :
/tmp/ltsmin5371571340109822455
[2024-05-28 11:57:37] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2024-05-28 11:57:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:37] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2024-05-28 11:57:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:37] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2024-05-28 11:57:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:57:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5371571340109822455
Running compilation step : cd /tmp/ltsmin5371571340109822455;'/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 570 ms.
Running link step : cd /tmp/ltsmin5371571340109822455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5371571340109822455;'/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/stateBased9114826271407997413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 11:57:52] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:57:52] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:57:52] [INFO ] Time to serialize gal into /tmp/LTL14713702680004319741.gal : 4 ms
[2024-05-28 11:57:52] [INFO ] Time to serialize properties into /tmp/LTL4319800320769575652.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14713702680004319741.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13920574152053028817.hoa' '-atoms' '/tmp/LTL4319800320769575652.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/LTL4319800320769575652.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13920574152053028817.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t51, t53, t54, t108, t226, t227, t228, t229, t230, t231, t232, t235, t239, t243, t248, t2...287
Computing Next relation with stutter on 2.20061e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-28 11:58:07] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:58:07] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:58:07] [INFO ] Time to serialize gal into /tmp/LTL43077290574248402.gal : 2 ms
[2024-05-28 11:58:07] [INFO ] Time to serialize properties into /tmp/LTL12127739011938760.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/LTL43077290574248402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12127739011938760.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...271
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t51, t53, t54, t108, t226, t227, t228, t229, t230, t231, t232, t235, t239, t243, t248, t2...287
Computing Next relation with stutter on 2.20061e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-28 11:58:22] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:58:22] [INFO ] Applying decomposition
[2024-05-28 11:58:22] [INFO ] Flatten gal took : 7 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/graph322103520899735429.txt' '-o' '/tmp/graph322103520899735429.bin' '-w' '/tmp/graph322103520899735429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph322103520899735429.bin' '-l' '-1' '-v' '-w' '/tmp/graph322103520899735429.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:58:23] [INFO ] Decomposing Gal with order
[2024-05-28 11:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:58:23] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 11:58:23] [INFO ] Flatten gal took : 89 ms
[2024-05-28 11:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 16 ms.
[2024-05-28 11:58:23] [INFO ] Time to serialize gal into /tmp/LTL18037636408530297006.gal : 8 ms
[2024-05-28 11:58:23] [INFO ] Time to serialize properties into /tmp/LTL6515805277844071951.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/LTL18037636408530297006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6515805277844071951.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u0.s1<1)||(u17.l950<1))"))))
Formula 0 simplified : GF!"((i5.u0.s1<1)||(u17.l950<1))"
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 107718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 153
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 138
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 114 transition count 131
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 103 transition count 120
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 103 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 99 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 95 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 95 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 92 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 92 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 89 transition count 97
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 88 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 88 transition count 96
Applied a total of 128 rules in 17 ms. Remains 88 /144 variables (removed 56) and now considering 96/271 (removed 175) transitions.
// Phase 1: matrix 96 rows 88 cols
[2024-05-28 11:58:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:58:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 11:58:38] [INFO ] Invariant cache hit.
[2024-05-28 11:58:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 11:58:38] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-28 11:58:38] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-28 11:58:38] [INFO ] Invariant cache hit.
[2024-05-28 11:58:38] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/184 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 131 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/184 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 95/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 11:58:45] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 2 ms to minimize.
[2024-05-28 11:58:45] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-28 11:58:45] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints]
After SMT, in 12874ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 96/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13258 ms. Remains : 88/144 places, 96/271 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 13312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p1||X(p2)))&&p0) U X(p1))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 163
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 163
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 115 transition count 149
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 115 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 115 transition count 143
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 104 transition count 132
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 104 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 104 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 100 transition count 119
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 100 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 96 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 96 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 95 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 94 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 94 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 93 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 93 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 92 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 91 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 91 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 90 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 90 transition count 108
Applied a total of 122 rules in 14 ms. Remains 90 /144 variables (removed 54) and now considering 108/271 (removed 163) transitions.
// Phase 1: matrix 108 rows 90 cols
[2024-05-28 11:58:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:58:51] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 11:58:51] [INFO ] Invariant cache hit.
[2024-05-28 11:58:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 11:58:51] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 11:58:51] [INFO ] Invariant cache hit.
[2024-05-28 11:58:51] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/198 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 51/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 11:58:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/198 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/198 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 51/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 13528ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 13529ms
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 108/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13862 ms. Remains : 90/144 places, 108/271 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 14179 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 U p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 129 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 116 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 116 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 116 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 106 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 106 transition count 144
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 102 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 96 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 94 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 92 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 90 transition count 113
Applied a total of 127 rules in 23 ms. Remains 90 /144 variables (removed 54) and now considering 113/271 (removed 158) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-05-28 11:59:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:59:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 11:59:05] [INFO ] Invariant cache hit.
[2024-05-28 11:59:05] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 11:59:06] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-28 11:59:06] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 11:59:06] [INFO ] Invariant cache hit.
[2024-05-28 11:59:06] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 148 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 112/260 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 11:59:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 261 constraints, problems are : Problem set: 0 solved, 112 unsolved in 9799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 15616ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 15619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/144 places, 113/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16078 ms. Remains : 90/144 places, 113/271 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 finished in 16173 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)) U p0))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 128 transition count 162
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 128 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 128 transition count 161
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 114 transition count 147
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 114 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 114 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 103 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 103 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 103 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 87 transition count 102
Applied a total of 131 rules in 24 ms. Remains 87 /144 variables (removed 57) and now considering 102/271 (removed 169) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 11:59:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:59:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 11:59:22] [INFO ] Invariant cache hit.
[2024-05-28 11:59:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 11:59:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-28 11:59:22] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 11:59:22] [INFO ] Invariant cache hit.
[2024-05-28 11:59:22] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 11:59:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
After SMT, in 12831ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 12832ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/144 places, 102/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13214 ms. Remains : 87/144 places, 102/271 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 13306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 165
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 130 transition count 163
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 117 transition count 150
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 117 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 117 transition count 144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 72 place count 107 transition count 134
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 107 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 107 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 103 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 97 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 97 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 97 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 95 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 95 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 92 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 91 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 91 transition count 108
Applied a total of 122 rules in 18 ms. Remains 91 /144 variables (removed 53) and now considering 108/271 (removed 163) transitions.
// Phase 1: matrix 108 rows 91 cols
[2024-05-28 11:59:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:59:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 11:59:35] [INFO ] Invariant cache hit.
[2024-05-28 11:59:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 11:59:35] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-28 11:59:35] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-28 11:59:35] [INFO ] Invariant cache hit.
[2024-05-28 11:59:35] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/199 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 144 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/199 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 107/251 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 11:59:42] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 252 constraints, problems are : Problem set: 0 solved, 107 unsolved in 9327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 14059ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 14060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/144 places, 108/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14421 ms. Remains : 91/144 places, 108/271 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 14534 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)&&F(G((p1||X(p2)))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 271/271 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 129 transition count 164
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 129 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 117 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 117 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 117 transition count 145
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 108 transition count 136
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 108 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 108 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 104 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 104 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 100 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 100 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 98 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 98 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 98 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 96 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 96 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 95 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 93 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 93 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 92 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 92 transition count 110
Applied a total of 119 rules in 17 ms. Remains 92 /144 variables (removed 52) and now considering 110/271 (removed 161) transitions.
// Phase 1: matrix 110 rows 92 cols
[2024-05-28 11:59:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:59:49] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 11:59:49] [INFO ] Invariant cache hit.
[2024-05-28 11:59:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 11:59:50] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 11:59:50] [INFO ] Invariant cache hit.
[2024-05-28 11:59:50] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 11:59:52] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/202 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 49/146 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 11:59:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:59:54] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 148 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 110/202 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 109/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 257 constraints, problems are : Problem set: 0 solved, 109 unsolved in 10749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 17961ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 17964ms
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 110/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18493 ms. Remains : 92/144 places, 110/271 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 finished in 18634 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)))'
[2024-05-28 12:00:08] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15419464297544427826
[2024-05-28 12:00:08] [INFO ] Computing symmetric may disable matrix : 271 transitions.
[2024-05-28 12:00:08] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:00:08] [INFO ] Applying decomposition
[2024-05-28 12:00:08] [INFO ] Computing symmetric may enable matrix : 271 transitions.
[2024-05-28 12:00:08] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:00:08] [INFO ] Flatten gal took : 31 ms
[2024-05-28 12:00:08] [INFO ] Computing Do-Not-Accords matrix : 271 transitions.
[2024-05-28 12:00:08] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:00:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15419464297544427826
Running compilation step : cd /tmp/ltsmin15419464297544427826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2706958476568952801.txt' '-o' '/tmp/graph2706958476568952801.bin' '-w' '/tmp/graph2706958476568952801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2706958476568952801.bin' '-l' '-1' '-v' '-w' '/tmp/graph2706958476568952801.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:00:09] [INFO ] Decomposing Gal with order
[2024-05-28 12:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:00:09] [INFO ] Removed a total of 269 redundant transitions.
[2024-05-28 12:00:09] [INFO ] Flatten gal took : 141 ms
[2024-05-28 12:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 23 ms.
[2024-05-28 12:00:09] [INFO ] Time to serialize gal into /tmp/LTLFireability4397370309515311535.gal : 12 ms
[2024-05-28 12:00:09] [INFO ] Time to serialize properties into /tmp/LTLFireability4502279922634156027.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/LTLFireability4397370309515311535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4502279922634156027.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u0.s1<1)||(u20.l950<1))"))))
Formula 0 simplified : GF!"((i0.u0.s1<1)||(u20.l950<1))"
Compilation finished in 1350 ms.
Running link step : cd /tmp/ltsmin15419464297544427826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15419464297544427826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 12:22:40] [INFO ] Flatten gal took : 58 ms
[2024-05-28 12:22:40] [INFO ] Time to serialize gal into /tmp/LTLFireability17610551462598359106.gal : 20 ms
[2024-05-28 12:22:40] [INFO ] Time to serialize properties into /tmp/LTLFireability14392721257176186083.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/LTLFireability17610551462598359106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14392721257176186083.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...299
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"
Detected timeout of ITS tools.
[2024-05-28 12:45:11] [INFO ] Flatten gal took : 32 ms
[2024-05-28 12:45:11] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-28 12:45:11] [INFO ] Transformed 144 places.
[2024-05-28 12:45:11] [INFO ] Transformed 271 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-28 12:45:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13952928855746275069.gal : 3 ms
[2024-05-28 12:45:11] [INFO ] Time to serialize properties into /tmp/LTLFireability4312344672037012013.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/LTLFireability13952928855746275069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4312344672037012013.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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