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.r334-tall-171679079600084.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 RingSingleMessageInMbox-PT-d1m040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079600084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 23:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m040-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716797405214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 08:10:06] [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-27 08:10:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:10:06] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2024-05-27 08:10:06] [INFO ] Transformed 6690 places.
[2024-05-27 08:10:06] [INFO ] Transformed 11934 transitions.
[2024-05-27 08:10:06] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 35 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1085 places :
Symmetric choice reduction at 1 with 1085 rule applications. Total rules 1204 place count 1283 transition count 7611
Iterating global reduction 1 with 1085 rules applied. Total rules applied 2289 place count 1283 transition count 7611
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 2565 place count 1283 transition count 7335
Discarding 918 places :
Symmetric choice reduction at 2 with 918 rule applications. Total rules 3483 place count 365 transition count 6417
Iterating global reduction 2 with 918 rules applied. Total rules applied 4401 place count 365 transition count 6417
Ensure Unique test removed 5134 transitions
Reduce isomorphic transitions removed 5134 transitions.
Iterating post reduction 2 with 5134 rules applied. Total rules applied 9535 place count 365 transition count 1283
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 9589 place count 311 transition count 1229
Iterating global reduction 3 with 54 rules applied. Total rules applied 9643 place count 311 transition count 1229
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 3 with 182 rules applied. Total rules applied 9825 place count 311 transition count 1047
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9833 place count 303 transition count 1039
Iterating global reduction 4 with 8 rules applied. Total rules applied 9841 place count 303 transition count 1039
Applied a total of 9841 rules in 376 ms. Remains 303 /2385 variables (removed 2082) and now considering 1039/11934 (removed 10895) transitions.
// Phase 1: matrix 1039 rows 303 cols
[2024-05-27 08:10:07] [INFO ] Computed 3 invariants in 26 ms
[2024-05-27 08:10:08] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-27 08:10:08] [INFO ] Invariant cache hit.
[2024-05-27 08:10:09] [INFO ] State equation strengthened by 767 read => feed constraints.
[2024-05-27 08:10:10] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2024-05-27 08:10:10] [INFO ] Invariant cache hit.
[2024-05-27 08:10:10] [INFO ] State equation strengthened by 767 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
At refinement iteration 4 (OVERLAPS) 1039/1342 variables, 303/306 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1342 variables, 767/1073 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 1073 constraints, problems are : Problem set: 24 solved, 1014 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 303/303 constraints, ReadFeed: 767/767 constraints, PredecessorRefiner: 1038/1038 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 1014 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 1 (OVERLAPS) 17/295 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 3 (OVERLAPS) 8/303 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 5 (OVERLAPS) 1039/1342 variables, 303/306 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1342 variables, 767/1073 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1342 variables, 1014/2087 constraints. Problems are: Problem set: 24 solved, 1014 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 2087 constraints, problems are : Problem set: 24 solved, 1014 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 303/303 constraints, ReadFeed: 767/767 constraints, PredecessorRefiner: 1014/1038 constraints, Known Traps: 0/0 constraints]
After SMT, in 64311ms problems are : Problem set: 24 solved, 1014 unsolved
Search for dead transitions found 24 dead transitions in 64339ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/2385 places, 1015/11934 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 279 transition count 1003
Applied a total of 36 rules in 7 ms. Remains 279 /303 variables (removed 24) and now considering 1003/1015 (removed 12) transitions.
// Phase 1: matrix 1003 rows 279 cols
[2024-05-27 08:11:14] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:11:15] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 08:11:15] [INFO ] Invariant cache hit.
[2024-05-27 08:11:15] [INFO ] State equation strengthened by 763 read => feed constraints.
[2024-05-27 08:11:16] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 279/2385 places, 1003/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69346 ms. Remains : 279/2385 places, 1003/11934 transitions.
Support contains 29 out of 279 places after structural reductions.
[2024-05-27 08:11:16] [INFO ] Flatten gal took : 84 ms
[2024-05-27 08:11:16] [INFO ] Flatten gal took : 57 ms
[2024-05-27 08:11:17] [INFO ] Input system was already deterministic with 1003 transitions.
Support contains 28 out of 279 places (down from 29) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 12023 steps (2072 resets) in 2966 ms. (4 steps per ms) remains 0/27 properties
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 78 stabilizing places and 493 stable transitions
Graph (complete) has 1561 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(p1)||p0) U X((!p2||F(p3)))))'
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 257 transition count 536
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 257 transition count 536
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 58 place count 257 transition count 522
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 240 transition count 505
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 240 transition count 505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 95 place count 240 transition count 502
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 155 place count 180 transition count 442
Iterating global reduction 2 with 60 rules applied. Total rules applied 215 place count 180 transition count 442
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 319 place count 180 transition count 338
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 179 transition count 325
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 179 transition count 325
Applied a total of 321 rules in 18 ms. Remains 179 /279 variables (removed 100) and now considering 325/1003 (removed 678) transitions.
// Phase 1: matrix 325 rows 179 cols
[2024-05-27 08:11:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:11:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 08:11:18] [INFO ] Invariant cache hit.
[2024-05-27 08:11:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-27 08:11:18] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-27 08:11:18] [INFO ] Invariant cache hit.
[2024-05-27 08:11:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/504 variables, 179/181 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 168/349 constraints. Problems are: Problem set: 0 solved, 324 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 349 constraints, problems are : Problem set: 0 solved, 324 unsolved in 12106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 179/179 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/504 variables, 179/181 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 168/349 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 324/673 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-05-27 08:11:39] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 7 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-27 08:11:39] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-05-27 08:11:39] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
[2024-05-27 08:11:43] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
[2024-05-27 08:11:43] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:11:43] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 6/679 constraints. Problems are: Problem set: 22 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/679 constraints. Problems are: Problem set: 22 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/504 variables, 0/679 constraints. Problems are: Problem set: 22 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 679 constraints, problems are : Problem set: 22 solved, 302 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 179/179 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 6/6 constraints]
After SMT, in 42833ms problems are : Problem set: 22 solved, 302 unsolved
Search for dead transitions found 22 dead transitions in 42838ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 179/279 places, 303/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 161 transition count 297
Applied a total of 24 rules in 6 ms. Remains 161 /179 variables (removed 18) and now considering 297/303 (removed 6) transitions.
// Phase 1: matrix 297 rows 161 cols
[2024-05-27 08:12:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:12:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 08:12:01] [INFO ] Invariant cache hit.
[2024-05-27 08:12:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-27 08:12:02] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/279 places, 297/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44141 ms. Remains : 161/279 places, 297/1003 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) (NOT p1) p2), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Computed a total of 12 stabilizing places and 63 stable transitions
Graph (complete) has 626 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 30 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 finished in 45456 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 U G(p2)))||G(p1))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 256 transition count 477
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 256 transition count 477
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 256 transition count 472
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 237 transition count 453
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 237 transition count 453
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 237 transition count 450
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 160 place count 169 transition count 382
Iterating global reduction 2 with 68 rules applied. Total rules applied 228 place count 169 transition count 382
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 316 place count 169 transition count 294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 317 place count 168 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 318 place count 168 transition count 280
Applied a total of 318 rules in 54 ms. Remains 168 /279 variables (removed 111) and now considering 280/1003 (removed 723) transitions.
// Phase 1: matrix 280 rows 168 cols
[2024-05-27 08:12:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:12:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 08:12:03] [INFO ] Invariant cache hit.
[2024-05-27 08:12:03] [INFO ] State equation strengthened by 133 read => feed constraints.
[2024-05-27 08:12:04] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-27 08:12:04] [INFO ] Redundant transitions in 15 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-27 08:12:04] [INFO ] Invariant cache hit.
[2024-05-27 08:12:04] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/448 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 133/303 constraints. Problems are: Problem set: 0 solved, 279 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 303 constraints, problems are : Problem set: 0 solved, 279 unsolved in 9344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/448 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 133/303 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 279/582 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-27 08:12:20] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 3 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-27 08:12:21] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
[2024-05-27 08:12:23] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-05-27 08:12:23] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
[2024-05-27 08:12:24] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2024-05-27 08:12:24] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 6/588 constraints. Problems are: Problem set: 22 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/588 constraints. Problems are: Problem set: 22 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/448 variables, 0/588 constraints. Problems are: Problem set: 22 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 588 constraints, problems are : Problem set: 22 solved, 257 unsolved in 27042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 6/6 constraints]
After SMT, in 36851ms problems are : Problem set: 22 solved, 257 unsolved
Search for dead transitions found 22 dead transitions in 36854ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/279 places, 258/1003 transitions.
Graph (complete) has 581 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 252
Applied a total of 7 rules in 22 ms. Remains 150 /168 variables (removed 18) and now considering 252/258 (removed 6) transitions.
// Phase 1: matrix 252 rows 150 cols
[2024-05-27 08:12:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:12:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 08:12:41] [INFO ] Invariant cache hit.
[2024-05-27 08:12:41] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-05-27 08:12:41] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/279 places, 252/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37949 ms. Remains : 150/279 places, 252/1003 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-01 finished in 38026 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((((!p0&&X((p0||G(p1))))||X(G((p0||G(p1))))) U G(p1))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 255 transition count 476
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 255 transition count 476
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 60 place count 255 transition count 464
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 79 place count 236 transition count 445
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 236 transition count 445
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 236 transition count 442
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 169 place count 168 transition count 374
Iterating global reduction 2 with 68 rules applied. Total rules applied 237 place count 168 transition count 374
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 321 place count 168 transition count 290
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 166 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 166 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 165 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 165 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 165 transition count 262
Applied a total of 328 rules in 14 ms. Remains 165 /279 variables (removed 114) and now considering 262/1003 (removed 741) transitions.
// Phase 1: matrix 262 rows 165 cols
[2024-05-27 08:12:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:12:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 08:12:41] [INFO ] Invariant cache hit.
[2024-05-27 08:12:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 08:12:42] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-27 08:12:42] [INFO ] Invariant cache hit.
[2024-05-27 08:12:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/427 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 116/283 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 283 constraints, problems are : Problem set: 0 solved, 261 unsolved in 8268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/427 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 116/283 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 261/544 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-27 08:12:56] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-27 08:12:56] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-27 08:12:56] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-27 08:12:58] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-27 08:12:59] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 0 ms to minimize.
[2024-05-27 08:12:59] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 6/550 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/550 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/550 constraints. Problems are: Problem set: 22 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 550 constraints, problems are : Problem set: 22 solved, 239 unsolved in 21839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 30547ms problems are : Problem set: 22 solved, 239 unsolved
Search for dead transitions found 22 dead transitions in 30549ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 165/279 places, 240/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 234
Applied a total of 24 rules in 8 ms. Remains 147 /165 variables (removed 18) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 147 cols
[2024-05-27 08:13:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:13:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 08:13:13] [INFO ] Invariant cache hit.
[2024-05-27 08:13:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-27 08:13:13] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/279 places, 234/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31651 ms. Remains : 147/279 places, 234/1003 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 finished in 31846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||F(p0)))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 255 transition count 416
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 255 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 255 transition count 408
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 235 transition count 388
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 235 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 235 transition count 387
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 173 place count 159 transition count 311
Iterating global reduction 2 with 76 rules applied. Total rules applied 249 place count 159 transition count 311
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 317 place count 159 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 158 transition count 230
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 158 transition count 230
Applied a total of 319 rules in 33 ms. Remains 158 /279 variables (removed 121) and now considering 230/1003 (removed 773) transitions.
// Phase 1: matrix 230 rows 158 cols
[2024-05-27 08:13:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:13:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 08:13:13] [INFO ] Invariant cache hit.
[2024-05-27 08:13:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-27 08:13:14] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-27 08:13:14] [INFO ] Redundant transitions in 9 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-27 08:13:14] [INFO ] Invariant cache hit.
[2024-05-27 08:13:14] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/388 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 90/250 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 250 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/388 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 90/250 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 229/479 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-27 08:13:24] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 08:13:25] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-27 08:13:25] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
[2024-05-27 08:13:27] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
[2024-05-27 08:13:27] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-27 08:13:27] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 6/485 constraints. Problems are: Problem set: 22 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/485 constraints. Problems are: Problem set: 22 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/485 constraints. Problems are: Problem set: 22 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 485 constraints, problems are : Problem set: 22 solved, 207 unsolved in 18558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 6/6 constraints]
After SMT, in 25516ms problems are : Problem set: 22 solved, 207 unsolved
Search for dead transitions found 22 dead transitions in 25518ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/279 places, 208/1003 transitions.
Graph (complete) has 513 edges and 158 vertex of which 140 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 202
Applied a total of 7 rules in 18 ms. Remains 140 /158 variables (removed 18) and now considering 202/208 (removed 6) transitions.
// Phase 1: matrix 202 rows 140 cols
[2024-05-27 08:13:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:13:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 08:13:39] [INFO ] Invariant cache hit.
[2024-05-27 08:13:39] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-27 08:13:39] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/279 places, 202/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26292 ms. Remains : 140/279 places, 202/1003 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-04
Product exploration explored 100000 steps with 17991 reset in 203 ms.
Product exploration explored 100000 steps with 18255 reset in 254 ms.
Computed a total of 8 stabilizing places and 41 stable transitions
Graph (complete) has 493 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7322 resets) in 487 ms. (81 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1270 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
[2024-05-27 08:13:40] [INFO ] Invariant cache hit.
[2024-05-27 08:13:40] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 137/204 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 338/342 variables, and 159 constraints, problems are : Problem set: 1 solved, 0 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/140 constraints, ReadFeed: 21/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-27 08:13:41] [INFO ] Invariant cache hit.
[2024-05-27 08:13:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-27 08:13:41] [INFO ] Invariant cache hit.
[2024-05-27 08:13:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-27 08:13:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-27 08:13:41] [INFO ] Redundant transitions in 3 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-27 08:13:41] [INFO ] Invariant cache hit.
[2024-05-27 08:13:41] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/342 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 86/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 228 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/342 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 86/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 201/429 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 429 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 17930ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 17933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18236 ms. Remains : 140/140 places, 202/202 transitions.
Computed a total of 8 stabilizing places and 41 stable transitions
Graph (complete) has 493 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5636 steps (1016 resets) in 22 ms. (245 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18162 reset in 159 ms.
Product exploration explored 100000 steps with 18107 reset in 166 ms.
Built C files in :
/tmp/ltsmin15011989080500493635
[2024-05-27 08:14:00] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2024-05-27 08:14:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:00] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2024-05-27 08:14:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:00] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2024-05-27 08:14:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:00] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15011989080500493635
Running compilation step : cd /tmp/ltsmin15011989080500493635;'/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 584 ms.
Running link step : cd /tmp/ltsmin15011989080500493635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15011989080500493635;'/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/stateBased12514333344796677685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 202/202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 138 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 138 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 138 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 137 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 136 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 136 transition count 184
Applied a total of 10 rules in 16 ms. Remains 136 /140 variables (removed 4) and now considering 184/202 (removed 18) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 08:14:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:14:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 08:14:15] [INFO ] Invariant cache hit.
[2024-05-27 08:14:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 08:14:15] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-27 08:14:15] [INFO ] Redundant transitions in 2 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-27 08:14:15] [INFO ] Invariant cache hit.
[2024-05-27 08:14:15] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 209 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 183/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 392 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 15310ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 15314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/140 places, 184/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15649 ms. Remains : 136/140 places, 184/202 transitions.
Built C files in :
/tmp/ltsmin12854506513418363550
[2024-05-27 08:14:31] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2024-05-27 08:14:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:31] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2024-05-27 08:14:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:31] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2024-05-27 08:14:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:14:31] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12854506513418363550
Running compilation step : cd /tmp/ltsmin12854506513418363550;'/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 421 ms.
Running link step : cd /tmp/ltsmin12854506513418363550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12854506513418363550;'/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/stateBased15429703770755175550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 08:14:46] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:14:46] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:14:46] [INFO ] Time to serialize gal into /tmp/LTL16895575151539458979.gal : 3 ms
[2024-05-27 08:14:46] [INFO ] Time to serialize properties into /tmp/LTL5127748437008825607.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/LTL16895575151539458979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12468700168219708790.hoa' '-atoms' '/tmp/LTL5127748437008825607.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/LTL5127748437008825607.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12468700168219708790.hoa
Detected timeout of ITS tools.
[2024-05-27 08:15:01] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:15:01] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:15:01] [INFO ] Time to serialize gal into /tmp/LTL17968265349787260071.gal : 2 ms
[2024-05-27 08:15:01] [INFO ] Time to serialize properties into /tmp/LTL1446989981850921022.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/LTL17968265349787260071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1446989981850921022.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=1))")
Detected timeout of ITS tools.
[2024-05-27 08:15:16] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:15:16] [INFO ] Applying decomposition
[2024-05-27 08:15:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17218085949771144625.txt' '-o' '/tmp/graph17218085949771144625.bin' '-w' '/tmp/graph17218085949771144625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17218085949771144625.bin' '-l' '-1' '-v' '-w' '/tmp/graph17218085949771144625.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:15:16] [INFO ] Decomposing Gal with order
[2024-05-27 08:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:15:16] [INFO ] Removed a total of 203 redundant transitions.
[2024-05-27 08:15:16] [INFO ] Flatten gal took : 53 ms
[2024-05-27 08:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 14 ms.
[2024-05-27 08:15:16] [INFO ] Time to serialize gal into /tmp/LTL11866582675990531572.gal : 4 ms
[2024-05-27 08:15:16] [INFO ] Time to serialize properties into /tmp/LTL4851860267016393952.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/LTL11866582675990531572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4851860267016393952.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((F("((i6.u1.s1<1)||(i0.u5.l2896<1))"))||(X(("((i0.u5.p208>=1)&&(i6.u1.l0>=1))")||(F("((i6.u1.s1<1)||(i0.u5.l2896<1))"))))))))
Formula 0 simplified : G(FG!"((i6.u1.s1<1)||(i0.u5.l2896<1))" & F!"((i0.u5.p208>=1)&&(i6.u1.l0>=1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-04 finished in 138038 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(F(X(G(X(X((!(p0 U p1)||X(!p0)))))))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 255 transition count 474
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 255 transition count 474
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 59 place count 255 transition count 463
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 236 transition count 444
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 236 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 236 transition count 442
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 167 place count 168 transition count 374
Iterating global reduction 2 with 68 rules applied. Total rules applied 235 place count 168 transition count 374
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 327 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 167 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 166 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 166 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 335 place count 162 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 339 place count 162 transition count 264
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 359 place count 162 transition count 244
Applied a total of 359 rules in 20 ms. Remains 162 /279 variables (removed 117) and now considering 244/1003 (removed 759) transitions.
// Phase 1: matrix 244 rows 162 cols
[2024-05-27 08:15:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:15:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-27 08:15:31] [INFO ] Invariant cache hit.
[2024-05-27 08:15:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:15:32] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-27 08:15:32] [INFO ] Invariant cache hit.
[2024-05-27 08:15:32] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 8169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 243/509 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-27 08:15:45] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:15:45] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:15:45] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:15:47] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-27 08:15:48] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-27 08:15:48] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 515 constraints, problems are : Problem set: 22 solved, 221 unsolved in 22336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 6/6 constraints]
After SMT, in 30822ms problems are : Problem set: 22 solved, 221 unsolved
Search for dead transitions found 22 dead transitions in 30825ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/279 places, 222/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 216
Applied a total of 24 rules in 6 ms. Remains 144 /162 variables (removed 18) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:16:02] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:16:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 08:16:03] [INFO ] Invariant cache hit.
[2024-05-27 08:16:03] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:16:03] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/279 places, 216/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31647 ms. Remains : 144/279 places, 216/1003 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
Product exploration explored 100000 steps with 18445 reset in 184 ms.
Product exploration explored 100000 steps with 18330 reset in 191 ms.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (7253 resets) in 132 ms. (300 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1327 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-27 08:16:04] [INFO ] Invariant cache hit.
[2024-05-27 08:16:04] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/223 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 38/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 360/360 variables, and 184 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 38/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 311 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:16:04] [INFO ] Invariant cache hit.
[2024-05-27 08:16:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 08:16:04] [INFO ] Invariant cache hit.
[2024-05-27 08:16:05] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:16:05] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-27 08:16:05] [INFO ] Invariant cache hit.
[2024-05-27 08:16:05] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 244 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 459 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20463ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20465ms
Finished structural reductions in LTL mode , in 1 iterations and 20800 ms. Remains : 144/144 places, 216/216 transitions.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 820 steps (142 resets) in 7 ms. (102 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 18405 reset in 180 ms.
Product exploration explored 100000 steps with 18345 reset in 187 ms.
Built C files in :
/tmp/ltsmin4903407327934682642
[2024-05-27 08:16:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4903407327934682642
Running compilation step : cd /tmp/ltsmin4903407327934682642;'/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 397 ms.
Running link step : cd /tmp/ltsmin4903407327934682642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4903407327934682642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11373138036592095820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:16:42] [INFO ] Invariant cache hit.
[2024-05-27 08:16:42] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 08:16:42] [INFO ] Invariant cache hit.
[2024-05-27 08:16:42] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:16:42] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-27 08:16:42] [INFO ] Invariant cache hit.
[2024-05-27 08:16:42] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 244 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 459 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20428ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20430ms
Finished structural reductions in LTL mode , in 1 iterations and 20762 ms. Remains : 144/144 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin16410699019983894413
[2024-05-27 08:17:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16410699019983894413
Running compilation step : cd /tmp/ltsmin16410699019983894413;'/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 396 ms.
Running link step : cd /tmp/ltsmin16410699019983894413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16410699019983894413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18376523969684217438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 08:17:18] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:17:18] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:17:18] [INFO ] Time to serialize gal into /tmp/LTL12840788854873362209.gal : 2 ms
[2024-05-27 08:17:18] [INFO ] Time to serialize properties into /tmp/LTL9865451043130942748.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12840788854873362209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12386604757269826704.hoa' '-atoms' '/tmp/LTL9865451043130942748.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/LTL9865451043130942748.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12386604757269826704.hoa
Detected timeout of ITS tools.
[2024-05-27 08:17:33] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:17:33] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:17:33] [INFO ] Time to serialize gal into /tmp/LTL10124350706070838326.gal : 1 ms
[2024-05-27 08:17:33] [INFO ] Time to serialize properties into /tmp/LTL4172449757714919210.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/LTL10124350706070838326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4172449757714919210.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((s1>=1)&&(l3931>=1))")U("((s1>=1)&&(l3921>=1))")))||(X("((s1<1)||(l3931<1))"))))))))))
Formula 0 simplified : GF(("((s1>=1)&&(l3931>=1))" U "((s1>=1)&&(l3921>=1))") & X!"((s1<1)||(l3931<1))")
Detected timeout of ITS tools.
[2024-05-27 08:17:48] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:17:48] [INFO ] Applying decomposition
[2024-05-27 08:17:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5582670549791593028.txt' '-o' '/tmp/graph5582670549791593028.bin' '-w' '/tmp/graph5582670549791593028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5582670549791593028.bin' '-l' '-1' '-v' '-w' '/tmp/graph5582670549791593028.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:17:48] [INFO ] Decomposing Gal with order
[2024-05-27 08:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:17:48] [INFO ] Removed a total of 250 redundant transitions.
[2024-05-27 08:17:48] [INFO ] Flatten gal took : 18 ms
[2024-05-27 08:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 6 ms.
[2024-05-27 08:17:48] [INFO ] Time to serialize gal into /tmp/LTL13342740354627252471.gal : 3 ms
[2024-05-27 08:17:48] [INFO ] Time to serialize properties into /tmp/LTL11438846040661162486.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/LTL13342740354627252471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11438846040661162486.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((i0.u0.s1>=1)&&(i0.u0.l3931>=1))")U("((i0.u0.s1>=1)&&(i0.u0.l3921>=1))")))||(X("((i0.u0.s1<1)||(i0.u0.l3931<1))")...164
Formula 0 simplified : GF(("((i0.u0.s1>=1)&&(i0.u0.l3931>=1))" U "((i0.u0.s1>=1)&&(i0.u0.l3921>=1))") & X!"((i0.u0.s1<1)||(i0.u0.l3931<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 finished in 151736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 256 transition count 504
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 256 transition count 504
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 58 place count 256 transition count 492
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 238 transition count 474
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 238 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 238 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 160 place count 174 transition count 408
Iterating global reduction 2 with 64 rules applied. Total rules applied 224 place count 174 transition count 408
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 304 place count 174 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 173 transition count 315
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 173 transition count 315
Applied a total of 306 rules in 22 ms. Remains 173 /279 variables (removed 106) and now considering 315/1003 (removed 688) transitions.
// Phase 1: matrix 315 rows 173 cols
[2024-05-27 08:18:03] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:18:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-27 08:18:03] [INFO ] Invariant cache hit.
[2024-05-27 08:18:03] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-27 08:18:04] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-27 08:18:04] [INFO ] Invariant cache hit.
[2024-05-27 08:18:04] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 338 constraints, problems are : Problem set: 0 solved, 314 unsolved in 11131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 314/652 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-27 08:18:22] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 08:18:23] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 08:18:23] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-05-27 08:18:26] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 2 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
[2024-05-27 08:18:26] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2024-05-27 08:18:27] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/488 variables, 0/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 658 constraints, problems are : Problem set: 22 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 6/6 constraints]
After SMT, in 41642ms problems are : Problem set: 22 solved, 292 unsolved
Search for dead transitions found 22 dead transitions in 41645ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/279 places, 293/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 287
Applied a total of 24 rules in 2 ms. Remains 155 /173 variables (removed 18) and now considering 287/293 (removed 6) transitions.
// Phase 1: matrix 287 rows 155 cols
[2024-05-27 08:18:45] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 08:18:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 08:18:45] [INFO ] Invariant cache hit.
[2024-05-27 08:18:45] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-27 08:18:46] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/279 places, 287/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42864 ms. Remains : 155/279 places, 287/1003 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 605 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 finished in 43647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 254 transition count 444
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 254 transition count 444
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 60 place count 254 transition count 434
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 80 place count 234 transition count 414
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 234 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 234 transition count 412
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 174 place count 162 transition count 340
Iterating global reduction 2 with 72 rules applied. Total rules applied 246 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 326 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 328 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 336 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 340 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 352 place count 155 transition count 217
Applied a total of 352 rules in 21 ms. Remains 155 /279 variables (removed 124) and now considering 217/1003 (removed 786) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 08:18:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:18:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 08:18:47] [INFO ] Invariant cache hit.
[2024-05-27 08:18:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 08:18:47] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 08:18:47] [INFO ] Invariant cache hit.
[2024-05-27 08:18:47] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 08:18:58] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 08:18:58] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 08:18:58] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 08:19:00] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 08:19:00] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 08:19:00] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 19058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25937ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25941ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/279 places, 195/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 2 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:19:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:19:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 08:19:13] [INFO ] Invariant cache hit.
[2024-05-27 08:19:13] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:19:13] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/279 places, 189/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26644 ms. Remains : 137/279 places, 189/1003 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 finished in 27075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 254 transition count 446
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 254 transition count 446
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 61 place count 254 transition count 435
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 234 transition count 415
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 234 transition count 415
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 234 transition count 412
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 176 place count 162 transition count 340
Iterating global reduction 2 with 72 rules applied. Total rules applied 248 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 328 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 354 place count 155 transition count 217
Applied a total of 354 rules in 33 ms. Remains 155 /279 variables (removed 124) and now considering 217/1003 (removed 786) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 08:19:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:19:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:19:14] [INFO ] Invariant cache hit.
[2024-05-27 08:19:14] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 08:19:14] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-27 08:19:14] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-27 08:19:14] [INFO ] Invariant cache hit.
[2024-05-27 08:19:14] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 08:19:24] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-27 08:19:25] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 08:19:25] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 08:19:25] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
[2024-05-27 08:19:26] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 08:19:27] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 16565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 23230ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 23232ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/279 places, 195/1003 transitions.
Graph (complete) has 494 edges and 155 vertex of which 137 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 137 transition count 189
Applied a total of 7 rules in 10 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:19:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:19:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 08:19:37] [INFO ] Invariant cache hit.
[2024-05-27 08:19:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:19:38] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/279 places, 189/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23991 ms. Remains : 137/279 places, 189/1003 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 finished in 24035 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((X(X(G(p0)))&&(p1||(p2&&X(!p0))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 256 transition count 446
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 256 transition count 446
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 256 transition count 438
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 74 place count 236 transition count 418
Iterating global reduction 1 with 20 rules applied. Total rules applied 94 place count 236 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 236 transition count 416
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 168 place count 164 transition count 344
Iterating global reduction 2 with 72 rules applied. Total rules applied 240 place count 164 transition count 344
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 164 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 322 place count 162 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 162 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 161 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 161 transition count 237
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 330 place count 157 transition count 233
Iterating global reduction 3 with 4 rules applied. Total rules applied 334 place count 157 transition count 233
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 346 place count 157 transition count 221
Applied a total of 346 rules in 22 ms. Remains 157 /279 variables (removed 122) and now considering 221/1003 (removed 782) transitions.
// Phase 1: matrix 221 rows 157 cols
[2024-05-27 08:19:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:19:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:19:38] [INFO ] Invariant cache hit.
[2024-05-27 08:19:38] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-27 08:19:38] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-27 08:19:38] [INFO ] Invariant cache hit.
[2024-05-27 08:19:38] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/378 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 82/241 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 241 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/378 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 82/241 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 220/461 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-27 08:19:50] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-27 08:19:51] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
[2024-05-27 08:19:52] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
[2024-05-27 08:19:52] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-05-27 08:19:53] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-27 08:19:53] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 6/467 constraints. Problems are: Problem set: 22 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/467 constraints. Problems are: Problem set: 22 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/467 constraints. Problems are: Problem set: 22 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 467 constraints, problems are : Problem set: 22 solved, 198 unsolved in 19245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 6/6 constraints]
After SMT, in 27086ms problems are : Problem set: 22 solved, 198 unsolved
Search for dead transitions found 22 dead transitions in 27092ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 157/279 places, 199/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 139 transition count 193
Applied a total of 24 rules in 5 ms. Remains 139 /157 variables (removed 18) and now considering 193/199 (removed 6) transitions.
// Phase 1: matrix 193 rows 139 cols
[2024-05-27 08:20:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:20:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 08:20:05] [INFO ] Invariant cache hit.
[2024-05-27 08:20:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-27 08:20:06] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 139/279 places, 193/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27878 ms. Remains : 139/279 places, 193/1003 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-13
Stuttering criterion allowed to conclude after 22 steps with 3 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 finished in 28100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 255 transition count 445
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 255 transition count 445
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 255 transition count 436
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 235 transition count 416
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 235 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 235 transition count 414
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 171 place count 163 transition count 342
Iterating global reduction 2 with 72 rules applied. Total rules applied 243 place count 163 transition count 342
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 323 place count 163 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 162 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 162 transition count 249
Applied a total of 325 rules in 35 ms. Remains 162 /279 variables (removed 117) and now considering 249/1003 (removed 754) transitions.
// Phase 1: matrix 249 rows 162 cols
[2024-05-27 08:20:06] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 08:20:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 08:20:06] [INFO ] Invariant cache hit.
[2024-05-27 08:20:06] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 08:20:06] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-27 08:20:06] [INFO ] Redundant transitions in 2 ms returned []
Running 248 sub problems to find dead transitions.
[2024-05-27 08:20:06] [INFO ] Invariant cache hit.
[2024-05-27 08:20:06] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 270 constraints, problems are : Problem set: 0 solved, 248 unsolved in 7949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 248/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-27 08:20:20] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-27 08:20:20] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 6 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:20:22] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 08:20:22] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-05-27 08:20:22] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 08:20:23] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 6/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 524 constraints, problems are : Problem set: 22 solved, 226 unsolved in 22030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 6/6 constraints]
After SMT, in 30315ms problems are : Problem set: 22 solved, 226 unsolved
Search for dead transitions found 22 dead transitions in 30319ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/279 places, 227/1003 transitions.
Graph (complete) has 539 edges and 162 vertex of which 144 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 144 transition count 221
Applied a total of 7 rules in 14 ms. Remains 144 /162 variables (removed 18) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 144 cols
[2024-05-27 08:20:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:20:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 08:20:37] [INFO ] Invariant cache hit.
[2024-05-27 08:20:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:20:37] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/279 places, 221/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31164 ms. Remains : 144/279 places, 221/1003 transitions.
Stuttering acceptance computed with spot in 155 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-14
Product exploration explored 100000 steps with 18161 reset in 189 ms.
Product exploration explored 100000 steps with 18174 reset in 199 ms.
Computed a total of 7 stabilizing places and 41 stable transitions
Graph (complete) has 519 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 118 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (7230 resets) in 268 ms. (148 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (1021 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (798 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-05-27 08:20:38] [INFO ] Invariant cache hit.
[2024-05-27 08:20:38] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 166/234 variables, 68/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 47/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 365/365 variables, and 193 constraints, problems are : Problem set: 2 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 47/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F p1), (F p0), (F (NOT (OR p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 17 factoid took 289 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 152 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2024-05-27 08:20:39] [INFO ] Invariant cache hit.
[2024-05-27 08:20:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 08:20:39] [INFO ] Invariant cache hit.
[2024-05-27 08:20:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:20:39] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-27 08:20:39] [INFO ] Redundant transitions in 3 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-27 08:20:39] [INFO ] Invariant cache hit.
[2024-05-27 08:20:39] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/365 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 248 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/365 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 220/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 468 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 20483ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 20487ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20834 ms. Remains : 144/144 places, 221/221 transitions.
Computed a total of 7 stabilizing places and 41 stable transitions
Graph (complete) has 519 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 118 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (7256 resets) in 196 ms. (203 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (1009 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (825 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2024-05-27 08:21:00] [INFO ] Invariant cache hit.
[2024-05-27 08:21:00] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 166/234 variables, 68/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 47/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 365/365 variables, and 193 constraints, problems are : Problem set: 2 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 47/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F p1), (F p0), (F (NOT (OR p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 17 factoid took 289 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 175 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 174 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 18348 reset in 192 ms.
Product exploration explored 100000 steps with 18301 reset in 200 ms.
Built C files in :
/tmp/ltsmin11769145067027056987
[2024-05-27 08:21:01] [INFO ] Computing symmetric may disable matrix : 221 transitions.
[2024-05-27 08:21:01] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:01] [INFO ] Computing symmetric may enable matrix : 221 transitions.
[2024-05-27 08:21:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:01] [INFO ] Computing Do-Not-Accords matrix : 221 transitions.
[2024-05-27 08:21:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:01] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11769145067027056987
Running compilation step : cd /tmp/ltsmin11769145067027056987;'/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 521 ms.
Running link step : cd /tmp/ltsmin11769145067027056987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11769145067027056987;'/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/stateBased11227239692682634323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 221/221 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2024-05-27 08:21:16] [INFO ] Invariant cache hit.
[2024-05-27 08:21:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:21:17] [INFO ] Invariant cache hit.
[2024-05-27 08:21:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:21:17] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-27 08:21:17] [INFO ] Redundant transitions in 2 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-27 08:21:17] [INFO ] Invariant cache hit.
[2024-05-27 08:21:17] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/365 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 248 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/365 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 220/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 468 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 20130ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 20134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20507 ms. Remains : 144/144 places, 221/221 transitions.
Built C files in :
/tmp/ltsmin4143373067310526316
[2024-05-27 08:21:37] [INFO ] Computing symmetric may disable matrix : 221 transitions.
[2024-05-27 08:21:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:37] [INFO ] Computing symmetric may enable matrix : 221 transitions.
[2024-05-27 08:21:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:37] [INFO ] Computing Do-Not-Accords matrix : 221 transitions.
[2024-05-27 08:21:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:21:37] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4143373067310526316
Running compilation step : cd /tmp/ltsmin4143373067310526316;'/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 512 ms.
Running link step : cd /tmp/ltsmin4143373067310526316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4143373067310526316;'/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/stateBased1001910441736878674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 08:21:52] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:21:52] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:21:52] [INFO ] Time to serialize gal into /tmp/LTL2373537620590535402.gal : 2 ms
[2024-05-27 08:21:52] [INFO ] Time to serialize properties into /tmp/LTL10200778483408097368.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/LTL2373537620590535402.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6928947669150533581.hoa' '-atoms' '/tmp/LTL10200778483408097368.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10200778483408097368.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6928947669150533581.hoa
Detected timeout of ITS tools.
[2024-05-27 08:22:07] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:22:07] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:22:07] [INFO ] Time to serialize gal into /tmp/LTL1847844712662781674.gal : 1 ms
[2024-05-27 08:22:07] [INFO ] Time to serialize properties into /tmp/LTL1677189177507509076.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/LTL1847844712662781674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1677189177507509076.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((s1>=1)&&(l3414>=1))")))&&(F(G(!("((s1>=1)&&(l3922>=1))"))))))U(G(!("((s1>=1)&&(l192>=1))")))))
Formula 0 simplified : F(G"((s1>=1)&&(l3414>=1))" | GF"((s1>=1)&&(l3922>=1))") R F"((s1>=1)&&(l192>=1))"
Detected timeout of ITS tools.
[2024-05-27 08:22:22] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:22:22] [INFO ] Applying decomposition
[2024-05-27 08:22:22] [INFO ] Flatten gal took : 6 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/graph16389274747248364761.txt' '-o' '/tmp/graph16389274747248364761.bin' '-w' '/tmp/graph16389274747248364761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16389274747248364761.bin' '-l' '-1' '-v' '-w' '/tmp/graph16389274747248364761.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:22:22] [INFO ] Decomposing Gal with order
[2024-05-27 08:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:22:22] [INFO ] Removed a total of 237 redundant transitions.
[2024-05-27 08:22:22] [INFO ] Flatten gal took : 24 ms
[2024-05-27 08:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 7 ms.
[2024-05-27 08:22:22] [INFO ] Time to serialize gal into /tmp/LTL9856483687267222700.gal : 3 ms
[2024-05-27 08:22:22] [INFO ] Time to serialize properties into /tmp/LTL11166535127828143538.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/LTL9856483687267222700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11166535127828143538.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((i6.u0.s1>=1)&&(i2.u16.l3414>=1))")))&&(F(G(!("((i6.u0.s1>=1)&&(i2.u16.l3922>=1))"))))))U(G(!("((i6.u0.s1>=1)&&(i2.u16.l1...168
Formula 0 simplified : F(G"((i6.u0.s1>=1)&&(i2.u16.l3414>=1))" | GF"((i6.u0.s1>=1)&&(i2.u16.l3922>=1))") R F"((i6.u0.s1>=1)&&(i2.u16.l192>=1))"
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-14 finished in 151641 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 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 254 transition count 446
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 254 transition count 446
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 61 place count 254 transition count 435
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 234 transition count 415
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 234 transition count 415
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 234 transition count 412
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 176 place count 162 transition count 340
Iterating global reduction 2 with 72 rules applied. Total rules applied 248 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 328 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 354 place count 155 transition count 217
Applied a total of 354 rules in 26 ms. Remains 155 /279 variables (removed 124) and now considering 217/1003 (removed 786) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 08:22:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:22:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 08:22:37] [INFO ] Invariant cache hit.
[2024-05-27 08:22:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 08:22:38] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 08:22:38] [INFO ] Invariant cache hit.
[2024-05-27 08:22:38] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 08:22:48] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 08:22:49] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 08:22:49] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
[2024-05-27 08:22:50] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 08:22:50] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 0 ms to minimize.
[2024-05-27 08:22:50] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 18006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 24394ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 24397ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/279 places, 195/1003 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 5 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:23:02] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:23:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 08:23:02] [INFO ] Invariant cache hit.
[2024-05-27 08:23:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:23:02] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/279 places, 189/1003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25088 ms. Remains : 137/279 places, 189/1003 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-15 finished in 25193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||F(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(G(X(X((!(p0 U p1)||X(!p0)))))))))'
Found a Lengthening insensitive property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 279/279 places, 1003/1003 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 255 transition count 474
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 255 transition count 474
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 59 place count 255 transition count 463
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 236 transition count 444
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 236 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 236 transition count 442
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 167 place count 168 transition count 374
Iterating global reduction 2 with 68 rules applied. Total rules applied 235 place count 168 transition count 374
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 327 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 167 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 166 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 166 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 335 place count 162 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 339 place count 162 transition count 264
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 359 place count 162 transition count 244
Applied a total of 359 rules in 29 ms. Remains 162 /279 variables (removed 117) and now considering 244/1003 (removed 759) transitions.
// Phase 1: matrix 244 rows 162 cols
[2024-05-27 08:23:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:23:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 08:23:03] [INFO ] Invariant cache hit.
[2024-05-27 08:23:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-27 08:23:03] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-27 08:23:03] [INFO ] Invariant cache hit.
[2024-05-27 08:23:03] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 7947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/406 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 243/509 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-27 08:23:16] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:23:17] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:23:17] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:23:18] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-27 08:23:19] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-05-27 08:23:19] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 515 constraints, problems are : Problem set: 22 solved, 221 unsolved in 22141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 6/6 constraints]
After SMT, in 30399ms problems are : Problem set: 22 solved, 221 unsolved
Search for dead transitions found 22 dead transitions in 30401ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 162/279 places, 222/1003 transitions.
Graph (complete) has 532 edges and 162 vertex of which 144 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 144 transition count 216
Applied a total of 7 rules in 9 ms. Remains 144 /162 variables (removed 18) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:23:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:23:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 08:23:34] [INFO ] Invariant cache hit.
[2024-05-27 08:23:34] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:23:34] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 144/279 places, 216/1003 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 31156 ms. Remains : 144/279 places, 216/1003 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
Product exploration explored 100000 steps with 18193 reset in 183 ms.
Product exploration explored 100000 steps with 18302 reset in 192 ms.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 112 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (7255 resets) in 114 ms. (347 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1315 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-27 08:23:35] [INFO ] Invariant cache hit.
[2024-05-27 08:23:35] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/223 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 38/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 360/360 variables, and 184 constraints, problems are : Problem set: 1 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 38/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 320 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:23:35] [INFO ] Invariant cache hit.
[2024-05-27 08:23:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 08:23:36] [INFO ] Invariant cache hit.
[2024-05-27 08:23:36] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:23:36] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-27 08:23:36] [INFO ] Invariant cache hit.
[2024-05-27 08:23:36] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 244 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 459 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20428ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20430ms
Finished structural reductions in LTL mode , in 1 iterations and 20766 ms. Remains : 144/144 places, 216/216 transitions.
Computed a total of 19 stabilizing places and 78 stable transitions
Graph (complete) has 512 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 1196 steps (218 resets) in 17 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 18211 reset in 180 ms.
Product exploration explored 100000 steps with 18240 reset in 186 ms.
Built C files in :
/tmp/ltsmin93373388253483738
[2024-05-27 08:23:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin93373388253483738
Running compilation step : cd /tmp/ltsmin93373388253483738;'/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 403 ms.
Running link step : cd /tmp/ltsmin93373388253483738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin93373388253483738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7606502885009802172.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:24:13] [INFO ] Invariant cache hit.
[2024-05-27 08:24:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 08:24:13] [INFO ] Invariant cache hit.
[2024-05-27 08:24:13] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:24:13] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-27 08:24:13] [INFO ] Invariant cache hit.
[2024-05-27 08:24:13] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 244 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/360 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 98/244 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 215/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 459 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20059ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20063ms
Finished structural reductions in LTL mode , in 1 iterations and 20410 ms. Remains : 144/144 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin13789667320057848722
[2024-05-27 08:24:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13789667320057848722
Running compilation step : cd /tmp/ltsmin13789667320057848722;'/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 382 ms.
Running link step : cd /tmp/ltsmin13789667320057848722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13789667320057848722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5019417578479781096.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 08:24:48] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:24:48] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:24:48] [INFO ] Time to serialize gal into /tmp/LTL12939271644985333801.gal : 2 ms
[2024-05-27 08:24:48] [INFO ] Time to serialize properties into /tmp/LTL15969880461900442512.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12939271644985333801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11773412835102918251.hoa' '-atoms' '/tmp/LTL15969880461900442512.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...320
Loading property file /tmp/LTL15969880461900442512.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11773412835102918251.hoa
Detected timeout of ITS tools.
[2024-05-27 08:25:03] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:25:03] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:25:03] [INFO ] Time to serialize gal into /tmp/LTL5596376726981560186.gal : 2 ms
[2024-05-27 08:25:03] [INFO ] Time to serialize properties into /tmp/LTL3588888606112914156.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/LTL5596376726981560186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3588888606112914156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((s1>=1)&&(l3931>=1))")U("((s1>=1)&&(l3921>=1))")))||(X("((s1<1)||(l3931<1))"))))))))))
Formula 0 simplified : GF(("((s1>=1)&&(l3931>=1))" U "((s1>=1)&&(l3921>=1))") & X!"((s1<1)||(l3931<1))")
Detected timeout of ITS tools.
[2024-05-27 08:25:18] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:25:18] [INFO ] Applying decomposition
[2024-05-27 08:25:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2455967851339168560.txt' '-o' '/tmp/graph2455967851339168560.bin' '-w' '/tmp/graph2455967851339168560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2455967851339168560.bin' '-l' '-1' '-v' '-w' '/tmp/graph2455967851339168560.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:25:18] [INFO ] Decomposing Gal with order
[2024-05-27 08:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:25:19] [INFO ] Removed a total of 203 redundant transitions.
[2024-05-27 08:25:19] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:25:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 7 ms.
[2024-05-27 08:25:19] [INFO ] Time to serialize gal into /tmp/LTL13082535817923901746.gal : 3 ms
[2024-05-27 08:25:19] [INFO ] Time to serialize properties into /tmp/LTL16969804572083341591.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/LTL13082535817923901746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16969804572083341591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((i1.u0.s1>=1)&&(i1.u0.l3931>=1))")U("((i1.u0.s1>=1)&&(i1.u0.l3921>=1))")))||(X("((i1.u0.s1<1)||(i1.u0.l3931<1))")...164
Formula 0 simplified : GF(("((i1.u0.s1>=1)&&(i1.u0.l3931>=1))" U "((i1.u0.s1>=1)&&(i1.u0.l3921>=1))") & X!"((i1.u0.s1<1)||(i1.u0.l3931<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 finished in 150912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
[2024-05-27 08:25:34] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1139741379143837345
[2024-05-27 08:25:34] [INFO ] Applying decomposition
[2024-05-27 08:25:34] [INFO ] Computing symmetric may disable matrix : 1003 transitions.
[2024-05-27 08:25:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 08:25:34] [INFO ] Flatten gal took : 22 ms
[2024-05-27 08:25:34] [INFO ] Computing symmetric may enable matrix : 1003 transitions.
[2024-05-27 08:25:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5997380191230992682.txt' '-o' '/tmp/graph5997380191230992682.bin' '-w' '/tmp/graph5997380191230992682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5997380191230992682.bin' '-l' '-1' '-v' '-w' '/tmp/graph5997380191230992682.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:25:34] [INFO ] Decomposing Gal with order
[2024-05-27 08:25:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:25:34] [INFO ] Removed a total of 818 redundant transitions.
[2024-05-27 08:25:34] [INFO ] Computing Do-Not-Accords matrix : 1003 transitions.
[2024-05-27 08:25:34] [INFO ] Flatten gal took : 65 ms
[2024-05-27 08:25:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 16 ms.
[2024-05-27 08:25:34] [INFO ] Time to serialize gal into /tmp/LTLFireability13801499648283953644.gal : 6 ms
[2024-05-27 08:25:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15822299812176317230.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/LTLFireability13801499648283953644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15822299812176317230.ltl' '-c' '-stutter-deadlock'
[2024-05-27 08:25:34] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
[2024-05-27 08:25:34] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1139741379143837345
Running compilation step : cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
Checking formula 0 : !((F(G((F("((u0.s1<1)||(u7.l2896<1))"))||(X(("((i1.u6.p208>=1)&&(i4.u4.l0>=1))")||(F("((u0.s1<1)||(u7.l2896<1))"))))))))
Formula 0 simplified : G(FG!"((u0.s1<1)||(u7.l2896<1))" & F!"((i1.u6.p208>=1)&&(i4.u4.l0>=1))")
Compilation finished in 3708 ms.
Running link step : cd /tmp/ltsmin1139741379143837345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X([](X(X((!((LTLAPp2==true) U (LTLAPp3==true))||X(!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X([](X(X((!((LTLAPp2==true) U (LTLAPp3==true))||X(!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>(!(LTLAPp4==true))&&<>([](!(LTLAPp5==true))))) U [](!(LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>(!(LTLAPp4==true))&&<>([](!(LTLAPp5==true))))) U [](!(LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-27 08:50:44] [INFO ] Flatten gal took : 94 ms
[2024-05-27 08:50:44] [INFO ] Time to serialize gal into /tmp/LTLFireability2239654774017050205.gal : 7 ms
[2024-05-27 08:50:44] [INFO ] Time to serialize properties into /tmp/LTLFireability2049245763019362821.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/LTLFireability2239654774017050205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2049245763019362821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.170: LTL layer: formula: <>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.170: "<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.171: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.172: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.211: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.339: There are 1011 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.339: State length is 280, there are 1009 groups
pins2lts-mc-linux64( 0/ 8), 0.339: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.339: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.339: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.339: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.375: [Blue] ~49 levels ~960 states ~2336 transitions
pins2lts-mc-linux64( 5/ 8), 0.402: [Blue] ~49 levels ~1920 states ~4432 transitions
pins2lts-mc-linux64( 5/ 8), 0.450: [Blue] ~54 levels ~3840 states ~7880 transitions
pins2lts-mc-linux64( 5/ 8), 0.594: [Blue] ~54 levels ~7680 states ~15176 transitions
pins2lts-mc-linux64( 6/ 8), 0.781: [Blue] ~289 levels ~15360 states ~53528 transitions
pins2lts-mc-linux64( 5/ 8), 1.250: [Blue] ~76 levels ~30720 states ~61096 transitions
pins2lts-mc-linux64( 5/ 8), 1.980: [Blue] ~182 levels ~61440 states ~124864 transitions
pins2lts-mc-linux64( 3/ 8), 3.523: [Blue] ~196 levels ~122880 states ~266960 transitions
pins2lts-mc-linux64( 3/ 8), 6.230: [Blue] ~196 levels ~245760 states ~527024 transitions
pins2lts-mc-linux64( 3/ 8), 11.258: [Blue] ~196 levels ~491520 states ~1045856 transitions
pins2lts-mc-linux64( 4/ 8), 20.980: [Blue] ~5307 levels ~983040 states ~2243456 transitions
pins2lts-mc-linux64( 4/ 8), 40.155: [Blue] ~8151 levels ~1966080 states ~4432888 transitions
pins2lts-mc-linux64( 3/ 8), 77.810: [Blue] ~196 levels ~3932160 states ~8304368 transitions
pins2lts-mc-linux64( 3/ 8), 153.146: [Blue] ~15351 levels ~7864320 states ~17173608 transitions
pins2lts-mc-linux64( 2/ 8), 303.298: [Blue] ~199 levels ~15728640 states ~34143152 transitions
pins2lts-mc-linux64( 0/ 8), 604.907: [Blue] ~199 levels ~31457280 states ~70279968 transitions
pins2lts-mc-linux64( 3/ 8), 671.915: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 672.519:
pins2lts-mc-linux64( 0/ 8), 672.519: Explored 34630654 states 81940772 transitions, fanout: 2.366
pins2lts-mc-linux64( 0/ 8), 672.519: Total exploration time 672.160 sec (671.560 sec minimum, 671.715 sec on average)
pins2lts-mc-linux64( 0/ 8), 672.519: States per second: 51521, Transitions per second: 121907
pins2lts-mc-linux64( 0/ 8), 672.519:
pins2lts-mc-linux64( 0/ 8), 672.519: State space has 39519839 states, 46545 are accepting
pins2lts-mc-linux64( 0/ 8), 672.519: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 672.519: blue states: 34630654 (87.63%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 672.519: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 672.519: all-red states: 46545 (0.12%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 672.520:
pins2lts-mc-linux64( 0/ 8), 672.520: Total memory used for local state coloring: 19.9MB
pins2lts-mc-linux64( 0/ 8), 672.520:
pins2lts-mc-linux64( 0/ 8), 672.520: Queue width: 8B, total height: 1307255, memory: 9.97MB
pins2lts-mc-linux64( 0/ 8), 672.520: Tree memory: 557.5MB, 14.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 672.520: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 672.520: Stored 1014 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 672.521: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 672.521: Est. total memory use: 567.5MB (~1034.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1139741379143837345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-27 09:06:46] [INFO ] Flatten gal took : 21 ms
[2024-05-27 09:06:46] [INFO ] Input system was already deterministic with 1003 transitions.
[2024-05-27 09:06:46] [INFO ] Transformed 279 places.
[2024-05-27 09:06:46] [INFO ] Transformed 1003 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-27 09:06:46] [INFO ] Time to serialize gal into /tmp/LTLFireability6908640607790341944.gal : 5 ms
[2024-05-27 09:06:46] [INFO ] Time to serialize properties into /tmp/LTLFireability14456613134579910815.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/LTLFireability6908640607790341944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14456613134579910815.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 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="RingSingleMessageInMbox-PT-d1m040"
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 RingSingleMessageInMbox-PT-d1m040, 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 r334-tall-171679079600084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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