Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264200436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r184-tall-174889264200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1749079905161

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 202505121319
[2025-06-04 23:31:46] [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]
[2025-06-04 23:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 23:31:46] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2025-06-04 23:31:46] [INFO ] Transformed 6690 places.
[2025-06-04 23:31:46] [INFO ] Transformed 11934 transitions.
[2025-06-04 23:31:46] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4305 places in 30 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-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 1093 places :
Symmetric choice reduction at 1 with 1093 rule applications. Total rules 1212 place count 1275 transition count 5699
Iterating global reduction 1 with 1093 rules applied. Total rules applied 2305 place count 1275 transition count 5699
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 2521 place count 1275 transition count 5483
Discarding 922 places :
Symmetric choice reduction at 2 with 922 rule applications. Total rules 3443 place count 353 transition count 4561
Iterating global reduction 2 with 922 rules applied. Total rules applied 4365 place count 353 transition count 4561
Ensure Unique test removed 3568 transitions
Reduce isomorphic transitions removed 3568 transitions.
Iterating post reduction 2 with 3568 rules applied. Total rules applied 7933 place count 353 transition count 993
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 8015 place count 271 transition count 911
Iterating global reduction 3 with 82 rules applied. Total rules applied 8097 place count 271 transition count 911
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 8351 place count 271 transition count 657
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 8359 place count 263 transition count 649
Iterating global reduction 4 with 8 rules applied. Total rules applied 8367 place count 263 transition count 649
Applied a total of 8367 rules in 341 ms. Remains 263 /2385 variables (removed 2122) and now considering 649/11934 (removed 11285) transitions.
// Phase 1: matrix 649 rows 263 cols
[2025-06-04 23:31:47] [INFO ] Computed 3 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:31:47] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-04 23:31:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:31:48] [INFO ] State equation strengthened by 409 read => feed constraints.
[2025-06-04 23:31:49] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
Running 648 sub problems to find dead transitions.
[2025-06-04 23:31:49] [INFO ] Invariant cache hit.
[2025-06-04 23:31:49] [INFO ] State equation strengthened by 409 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 1/263 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
At refinement iteration 4 (OVERLAPS) 649/912 variables, 263/266 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 409/675 constraints. Problems are: Problem set: 24 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/912 variables, and 675 constraints, problems are : Problem set: 24 solved, 624 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 263/263 constraints, ReadFeed: 409/409 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 624 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 17/255 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 3 (OVERLAPS) 8/263 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 5 (OVERLAPS) 649/912 variables, 263/266 constraints. Problems are: Problem set: 24 solved, 624 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 409/675 constraints. Problems are: Problem set: 24 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/912 variables, and 1299 constraints, problems are : Problem set: 24 solved, 624 unsolved in 30447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 263/263 constraints, ReadFeed: 409/409 constraints, PredecessorRefiner: 624/648 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61650ms problems are : Problem set: 24 solved, 624 unsolved
Search for dead transitions found 24 dead transitions in 61667ms
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 : 263/2385 places, 625/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 239 transition count 613
Applied a total of 36 rules in 7 ms. Remains 239 /263 variables (removed 24) and now considering 613/625 (removed 12) transitions.
// Phase 1: matrix 613 rows 239 cols
[2025-06-04 23:32:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:51] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-04 23:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:51] [INFO ] State equation strengthened by 405 read => feed constraints.
[2025-06-04 23:32:57] [INFO ] Implicit Places using invariants and state equation in 6515 ms returned []
Implicit Place search using SMT with State Equation took 6619 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/2385 places, 613/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70613 ms. Remains : 239/2385 places, 613/11934 transitions.
Support contains 24 out of 239 places after structural reductions.
[2025-06-04 23:32:58] [INFO ] Flatten gal took : 62 ms
[2025-06-04 23:32:58] [INFO ] Flatten gal took : 36 ms
[2025-06-04 23:32:58] [INFO ] Input system was already deterministic with 613 transitions.
Support contains 23 out of 239 places (down from 24) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 21848 steps (3805 resets) in 2222 ms. (9 steps per ms) remains 0/22 properties
Computed a total of 59 stabilizing places and 294 stable transitions
Graph (complete) has 1098 edges and 239 vertex of which 238 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p1||X(p2)))&&p0)))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 390
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 390
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 45 place count 221 transition count 381
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 210 transition count 370
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 210 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 210 transition count 369
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 108 place count 170 transition count 329
Iterating global reduction 2 with 40 rules applied. Total rules applied 148 place count 170 transition count 329
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 184 place count 170 transition count 293
Applied a total of 184 rules in 17 ms. Remains 170 /239 variables (removed 69) and now considering 293/613 (removed 320) transitions.
// Phase 1: matrix 293 rows 170 cols
[2025-06-04 23:32:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-04 23:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:32:59] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-04 23:33:01] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-04 23:33:01] [INFO ] Invariant cache hit.
[2025-06-04 23:33:01] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 316 constraints, problems are : Problem set: 0 solved, 292 unsolved in 27271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 292/608 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 13 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:52] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:52] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:53] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:53] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 6/614 constraints. Problems are: Problem set: 22 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 614 constraints, problems are : Problem set: 22 solved, 270 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57466ms problems are : Problem set: 22 solved, 270 unsolved
Search for dead transitions found 22 dead transitions in 57469ms
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 : 170/239 places, 271/613 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 152 transition count 265
Applied a total of 24 rules in 2 ms. Remains 152 /170 variables (removed 18) and now considering 265/271 (removed 6) transitions.
// Phase 1: matrix 265 rows 152 cols
[2025-06-04 23:33:59] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:33:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 23:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:33:59] [INFO ] State equation strengthened by 140 read => feed constraints.
[2025-06-04 23:34:00] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/239 places, 265/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61300 ms. Remains : 152/239 places, 265/613 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 finished in 61675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(((X(G(p0)) U p1)&&X(p2))))&&!p2))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 390
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 221 transition count 382
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 209 transition count 370
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 209 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 209 transition count 368
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 110 place count 169 transition count 328
Iterating global reduction 2 with 40 rules applied. Total rules applied 150 place count 169 transition count 328
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 194 place count 169 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 195 place count 168 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 168 transition count 271
Applied a total of 196 rules in 15 ms. Remains 168 /239 variables (removed 71) and now considering 271/613 (removed 342) transitions.
// Phase 1: matrix 271 rows 168 cols
[2025-06-04 23:34:00] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 23:34:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:01] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-04 23:34:03] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 2643 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-04 23:34:03] [INFO ] Invariant cache hit.
[2025-06-04 23:34:03] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/439 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 123/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 293 constraints, problems are : Problem set: 0 solved, 270 unsolved in 22613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/439 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 123/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 270/563 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 563 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52784ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 52787ms
Starting structural reductions in LTL mode, iteration 1 : 168/239 places, 271/613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55449 ms. Remains : 168/239 places, 271/613 transitions.
Stuttering acceptance computed with spot in 948 ms :[true, true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-01
Stuttering criterion allowed to conclude after 2 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 56428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 396
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 396
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 220 transition count 388
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 208 transition count 376
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 208 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 208 transition count 374
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 112 place count 168 transition count 334
Iterating global reduction 2 with 40 rules applied. Total rules applied 152 place count 168 transition count 334
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 200 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 201 place count 167 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 167 transition count 273
Applied a total of 202 rules in 15 ms. Remains 167 /239 variables (removed 72) and now considering 273/613 (removed 340) transitions.
// Phase 1: matrix 273 rows 167 cols
[2025-06-04 23:34:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 23:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:34:57] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-04 23:34:58] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-04 23:34:58] [INFO ] Invariant cache hit.
[2025-06-04 23:34:58] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 22256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:35:41] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:35:42] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:35:42] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 3 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 570 constraints, problems are : Problem set: 12 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52418ms problems are : Problem set: 12 solved, 260 unsolved
Search for dead transitions found 12 dead transitions in 52420ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/239 places, 261/613 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 159 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 155 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 155 transition count 257
Applied a total of 16 rules in 3 ms. Remains 155 /167 variables (removed 12) and now considering 257/261 (removed 4) transitions.
// Phase 1: matrix 257 rows 155 cols
[2025-06-04 23:35:51] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 23:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:51] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-04 23:35:53] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/239 places, 257/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56500 ms. Remains : 155/239 places, 257/613 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 3 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 finished in 56640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 219 transition count 354
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 219 transition count 354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 219 transition count 348
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 205 transition count 334
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 205 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 205 transition count 332
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 124 place count 157 transition count 284
Iterating global reduction 2 with 48 rules applied. Total rules applied 172 place count 157 transition count 284
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 216 place count 157 transition count 240
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 218 place count 155 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 155 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 154 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 154 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 154 transition count 212
Applied a total of 223 rules in 41 ms. Remains 154 /239 variables (removed 85) and now considering 212/613 (removed 401) transitions.
// Phase 1: matrix 212 rows 154 cols
[2025-06-04 23:35:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 23:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:35:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-04 23:35:54] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:35:54] [INFO ] Redundant transitions in 13 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-04 23:35:54] [INFO ] Invariant cache hit.
[2025-06-04 23:35:54] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 231 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 211/442 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:19] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:19] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:20] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 4 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:24] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 3 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:25] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:25] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 6/448 constraints. Problems are: Problem set: 22 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:36] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 449 constraints, problems are : Problem set: 22 solved, 189 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41752ms problems are : Problem set: 22 solved, 189 unsolved
Search for dead transitions found 22 dead transitions in 41753ms
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 : 154/239 places, 190/613 transitions.
Graph (complete) has 488 edges and 154 vertex of which 136 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 136 transition count 184
Applied a total of 7 rules in 16 ms. Remains 136 /154 variables (removed 18) and now considering 184/190 (removed 6) transitions.
// Phase 1: matrix 184 rows 136 cols
[2025-06-04 23:36:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:36] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 23:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:36] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-04 23:36:36] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 136/239 places, 184/613 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43022 ms. Remains : 136/239 places, 184/613 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-04
Product exploration explored 100000 steps with 20572 reset in 244 ms.
Product exploration explored 100000 steps with 20362 reset in 215 ms.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 468 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 1471 steps (284 resets) in 25 ms. (56 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 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2025-06-04 23:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 23:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:36:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-04 23:36:38] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:36:38] [INFO ] Redundant transitions in 10 ms returned []
Running 183 sub problems to find dead transitions.
[2025-06-04 23:36:38] [INFO ] Invariant cache hit.
[2025-06-04 23:36:38] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 8870 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:36:56] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:37:09] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:37:09] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:37:09] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 396 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30014 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: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38973ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 38973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39563 ms. Remains : 136/136 places, 184/184 transitions.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 468 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 3614 steps (735 resets) in 24 ms. (144 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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20510 reset in 173 ms.
Product exploration explored 100000 steps with 20478 reset in 178 ms.
Built C files in :
/tmp/ltsmin902957986253514213
[2025-06-04 23:37:18] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-04 23:37:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:37:18] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-04 23:37:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:37:18] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-04 23:37:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:37:18] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin902957986253514213
Running compilation step : cd /tmp/ltsmin902957986253514213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin902957986253514213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin902957986253514213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15537392777262595521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 184/184 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2025-06-04 23:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:37:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 23:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:37:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-04 23:37:33] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:37:33] [INFO ] Redundant transitions in 2 ms returned []
Running 183 sub problems to find dead transitions.
[2025-06-04 23:37:33] [INFO ] Invariant cache hit.
[2025-06-04 23:37:33] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 8976 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:37:52] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:38:04] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:38:04] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:38:04] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 396 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30013 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: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39058ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 39059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39620 ms. Remains : 136/136 places, 184/184 transitions.
Built C files in :
/tmp/ltsmin2293906979590042388
[2025-06-04 23:38:12] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-04 23:38:12] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:38:12] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-04 23:38:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:38:12] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-04 23:38:12] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:38:12] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2293906979590042388
Running compilation step : cd /tmp/ltsmin2293906979590042388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 388 ms.
Running link step : cd /tmp/ltsmin2293906979590042388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2293906979590042388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1191637077240354848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 23:38:28] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:38:28] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:38:28] [INFO ] Time to serialize gal into /tmp/LTL7702229329769491656.gal : 3 ms
[2025-06-04 23:38:28] [INFO ] Time to serialize properties into /tmp/LTL10225035022837005273.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7702229329769491656.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15851710097116227953.hoa' '-atoms' '/tmp/LTL10225035022837005273.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10225035022837005273.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15851710097116227953.hoa
Detected timeout of ITS tools.
[2025-06-04 23:38:43] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:38:43] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:38:43] [INFO ] Time to serialize gal into /tmp/LTL2487842976344739277.gal : 2 ms
[2025-06-04 23:38:43] [INFO ] Time to serialize properties into /tmp/LTL5841885548574170731.ltl : 4 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2487842976344739277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5841885548574170731.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l3250<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3250<1))"
Detected timeout of ITS tools.
[2025-06-04 23:38:58] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:38:58] [INFO ] Applying decomposition
[2025-06-04 23:38:58] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph1246326274469566013.txt' '-o' '/tmp/graph1246326274469566013.bin' '-w' '/tmp/graph1246326274469566013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1246326274469566013.bin' '-l' '-1' '-v' '-w' '/tmp/graph1246326274469566013.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:38:58] [INFO ] Decomposing Gal with order
[2025-06-04 23:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:38:58] [INFO ] Removed a total of 196 redundant transitions.
[2025-06-04 23:38:58] [INFO ] Flatten gal took : 51 ms
[2025-06-04 23:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 12 ms.
[2025-06-04 23:38:58] [INFO ] Time to serialize gal into /tmp/LTL13227319396316135897.gal : 4 ms
[2025-06-04 23:38:58] [INFO ] Time to serialize properties into /tmp/LTL14127727656347180989.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13227319396316135897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14127727656347180989.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u0.s1<1)||(i5.u5.l3250<1))"))))
Formula 0 simplified : GF!"((i0.u0.s1<1)||(i5.u5.l3250<1))"
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-04 finished in 199573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 403
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 403
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 220 transition count 396
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 208 transition count 384
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 208 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 208 transition count 382
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 111 place count 168 transition count 342
Iterating global reduction 2 with 40 rules applied. Total rules applied 151 place count 168 transition count 342
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 211 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 167 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 166 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 166 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 162 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 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 243 place count 162 transition count 244
Applied a total of 243 rules in 39 ms. Remains 162 /239 variables (removed 77) and now considering 244/613 (removed 369) transitions.
// Phase 1: matrix 244 rows 162 cols
[2025-06-04 23:39:13] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:39:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-04 23:39:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:39:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 23:39:15] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:39:15] [INFO ] Redundant transitions in 5 ms returned []
Running 243 sub problems to find dead transitions.
[2025-06-04 23:39:15] [INFO ] Invariant cache hit.
[2025-06-04 23:39:15] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 18381 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:47] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:50] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:50] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 4 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:55] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 3 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:56] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:39:56] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/515 constraints. Problems are: Problem set: 22 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 515 constraints, problems are : Problem set: 22 solved, 221 unsolved in 30019 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 48548ms problems are : Problem set: 22 solved, 221 unsolved
Search for dead transitions found 22 dead transitions in 48548ms
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/239 places, 222/613 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.1 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 10 ms. Remains 144 /162 variables (removed 18) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 144 cols
[2025-06-04 23:40:03] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:40:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 23:40:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:40:03] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-04 23:40:04] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/239 places, 216/613 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51105 ms. Remains : 144/239 places, 216/613 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 finished in 51230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((G(!p1)||(!p1&&X(F((!p2||G(F(!p2)))))))))&&p0)))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 389
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 389
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 47 place count 220 transition count 380
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 208 transition count 368
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 208 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 208 transition count 366
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 113 place count 168 transition count 326
Iterating global reduction 2 with 40 rules applied. Total rules applied 153 place count 168 transition count 326
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 189 place count 168 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 167 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 167 transition count 277
Applied a total of 191 rules in 17 ms. Remains 167 /239 variables (removed 72) and now considering 277/613 (removed 336) transitions.
// Phase 1: matrix 277 rows 167 cols
[2025-06-04 23:40:04] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:40:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 23:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:40:04] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-06-04 23:40:07] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned []
Implicit Place search using SMT with State Equation took 2408 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-04 23:40:07] [INFO ] Invariant cache hit.
[2025-06-04 23:40:07] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/444 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 130/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 299 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22794 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/444 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 130/299 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 276/575 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:49] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:50] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:50] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 5 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:59] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 4 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:59] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:40:59] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 581 constraints, problems are : Problem set: 22 solved, 254 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52970ms problems are : Problem set: 22 solved, 254 unsolved
Search for dead transitions found 22 dead transitions in 52973ms
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 : 167/239 places, 255/613 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 149 transition count 249
Applied a total of 24 rules in 2 ms. Remains 149 /167 variables (removed 18) and now considering 249/255 (removed 6) transitions.
// Phase 1: matrix 249 rows 149 cols
[2025-06-04 23:41:00] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:41:00] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 23:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:41:00] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-04 23:41:01] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/239 places, 249/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56422 ms. Remains : 149/239 places, 249/613 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 finished in 56630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 397
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 397
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 43 place count 221 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 209 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 209 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 209 transition count 376
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 109 place count 169 transition count 336
Iterating global reduction 2 with 40 rules applied. Total rules applied 149 place count 169 transition count 336
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 201 place count 169 transition count 284
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 167 transition count 258
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 167 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 166 transition count 257
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 166 transition count 257
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 211 place count 162 transition count 253
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 162 transition count 253
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 231 place count 162 transition count 237
Applied a total of 231 rules in 18 ms. Remains 162 /239 variables (removed 77) and now considering 237/613 (removed 376) transitions.
// Phase 1: matrix 237 rows 162 cols
[2025-06-04 23:41:01] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:41:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 23:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:41:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-04 23:41:02] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-04 23:41:02] [INFO ] Invariant cache hit.
[2025-06-04 23:41:02] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/399 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 94/258 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:19] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:19] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/399 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 260 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 237/399 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 236/496 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:45] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:45] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:46] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:46] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:41:52] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 5/501 constraints. Problems are: Problem set: 22 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 501 constraints, problems are : Problem set: 22 solved, 214 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 22 solved, 214 unsolved
Search for dead transitions found 22 dead transitions in 60150ms
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/239 places, 215/613 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 209
Applied a total of 24 rules in 4 ms. Remains 144 /162 variables (removed 18) and now considering 209/215 (removed 6) transitions.
// Phase 1: matrix 209 rows 144 cols
[2025-06-04 23:42:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:42:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 23:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:42:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:42:03] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/239 places, 209/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61940 ms. Remains : 144/239 places, 209/613 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-08
Product exploration explored 100000 steps with 18601 reset in 276 ms.
Product exploration explored 100000 steps with 18414 reset in 266 ms.
Computed a total of 19 stabilizing places and 71 stable transitions
Graph (complete) has 507 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 71 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 60 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (7316 resets) in 316 ms. (126 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1418 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
[2025-06-04 23:42:04] [INFO ] Invariant cache hit.
[2025-06-04 23:42:04] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/226 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 353/353 variables, and 185 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 39/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2025-06-04 23:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:42:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 23:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:42:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:42:05] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-04 23:42:05] [INFO ] Invariant cache hit.
[2025-06-04 23:42:05] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47981ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47984ms
Finished structural reductions in LTL mode , in 1 iterations and 48851 ms. Remains : 144/144 places, 209/209 transitions.
Computed a total of 19 stabilizing places and 71 stable transitions
Graph (complete) has 507 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 71 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 675 steps (112 resets) in 15 ms. (42 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 18377 reset in 258 ms.
Product exploration explored 100000 steps with 18335 reset in 341 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 14 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:42:55] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2025-06-04 23:42:55] [INFO ] Invariant cache hit.
[2025-06-04 23:42:55] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47628ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47628ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47653 ms. Remains : 144/144 places, 209/209 transitions.
Built C files in :
/tmp/ltsmin1916276349819727959
[2025-06-04 23:43:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1916276349819727959
Running compilation step : cd /tmp/ltsmin1916276349819727959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin1916276349819727959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1916276349819727959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8456360812066299617.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 LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2025-06-04 23:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:43:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 23:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:43:58] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:43:59] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-04 23:43:59] [INFO ] Invariant cache hit.
[2025-06-04 23:43:59] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47376ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47377ms
Finished structural reductions in LTL mode , in 1 iterations and 48080 ms. Remains : 144/144 places, 209/209 transitions.
Built C files in :
/tmp/ltsmin7676151694458380820
[2025-06-04 23:44:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7676151694458380820
Running compilation step : cd /tmp/ltsmin7676151694458380820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin7676151694458380820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7676151694458380820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11092963695405716908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 23:45:01] [INFO ] Flatten gal took : 12 ms
[2025-06-04 23:45:01] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:45:01] [INFO ] Time to serialize gal into /tmp/LTL2007146694449126679.gal : 2 ms
[2025-06-04 23:45:01] [INFO ] Time to serialize properties into /tmp/LTL11379752983218422006.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2007146694449126679.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17886206420902911.hoa' '-atoms' '/tmp/LTL11379752983218422006.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL11379752983218422006.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17886206420902911.hoa
Detected timeout of ITS tools.
[2025-06-04 23:45:16] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:45:16] [INFO ] Flatten gal took : 9 ms
[2025-06-04 23:45:16] [INFO ] Time to serialize gal into /tmp/LTL4799103673358195211.gal : 1 ms
[2025-06-04 23:45:16] [INFO ] Time to serialize properties into /tmp/LTL14954051478387343581.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4799103673358195211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14954051478387343581.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((s1<1)||(l3939<1))"))||("(((s1<1)||(l3911<1))&&((s1<1)||(l2793<1)))"))))))
Formula 0 simplified : XXF(!"(((s1<1)||(l3911<1))&&((s1<1)||(l2793<1)))" & F!"((s1<1)||(l3939<1))")
Detected timeout of ITS tools.
[2025-06-04 23:45:31] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:45:31] [INFO ] Applying decomposition
[2025-06-04 23:45:31] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16015970759947359396.txt' '-o' '/tmp/graph16015970759947359396.bin' '-w' '/tmp/graph16015970759947359396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16015970759947359396.bin' '-l' '-1' '-v' '-w' '/tmp/graph16015970759947359396.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:45:31] [INFO ] Decomposing Gal with order
[2025-06-04 23:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:45:31] [INFO ] Removed a total of 251 redundant transitions.
[2025-06-04 23:45:31] [INFO ] Flatten gal took : 21 ms
[2025-06-04 23:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 7 ms.
[2025-06-04 23:45:31] [INFO ] Time to serialize gal into /tmp/LTL14987258617925358739.gal : 2 ms
[2025-06-04 23:45:31] [INFO ] Time to serialize properties into /tmp/LTL9738113954714943833.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14987258617925358739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9738113954714943833.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((i1.u0.s1<1)||(i1.u8.l3939<1))"))||("(((i1.u0.s1<1)||(i1.u7.l3911<1))&&((i1.u0.s1<1)||(u5.l2793<1)))"))))))
Formula 0 simplified : XXF(!"(((i1.u0.s1<1)||(i1.u7.l3911<1))&&((i1.u0.s1<1)||(u5.l2793<1)))" & F!"((i1.u0.s1<1)||(i1.u8.l3939<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 finished in 285670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(p1)))))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 379
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 379
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 220 transition count 372
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 208 transition count 360
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 208 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 208 transition count 359
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 114 place count 164 transition count 315
Iterating global reduction 2 with 44 rules applied. Total rules applied 158 place count 164 transition count 315
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 210 place count 164 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 211 place count 163 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 163 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 162 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 162 transition count 249
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 218 place count 158 transition count 245
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 158 transition count 245
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 238 place count 158 transition count 229
Applied a total of 238 rules in 26 ms. Remains 158 /239 variables (removed 81) and now considering 229/613 (removed 384) transitions.
// Phase 1: matrix 229 rows 158 cols
[2025-06-04 23:45:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:45:47] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 23:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:45:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:45:48] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-04 23:45:48] [INFO ] Invariant cache hit.
[2025-06-04 23:45:48] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/387 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 90/250 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:45:56] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:45:57] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 3 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:45:57] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 3/253 constraints. Problems are: Problem set: 20 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:46:10] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:46:11] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 4 ms to minimize.
Problem TDEAD188 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:46:11] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 4 ms to minimize.
Problem TDEAD192 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 3/256 constraints. Problems are: Problem set: 22 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 256 constraints, problems are : Problem set: 22 solved, 206 unsolved in 30008 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: 228/228 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 3 (OVERLAPS) 8/148 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 229/377 variables, 148/150 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 90/240 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 39/279 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/279 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 10/387 variables, 10/289 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 167/456 constraints. Problems are: Problem set: 22 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 6/462 constraints. Problems are: Problem set: 22 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 462 constraints, problems are : Problem set: 22 solved, 206 unsolved in 30017 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: 206/228 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 22 solved, 206 unsolved
Search for dead transitions found 22 dead transitions in 60187ms
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 : 158/239 places, 207/613 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 140 transition count 201
Applied a total of 24 rules in 4 ms. Remains 140 /158 variables (removed 18) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 140 cols
[2025-06-04 23:46:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:46:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 23:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:46:48] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-04 23:46:49] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 140/239 places, 201/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62122 ms. Remains : 140/239 places, 201/613 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-09 finished in 62486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(X(X(G(p1))))))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 372
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 220 transition count 365
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 207 transition count 352
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 207 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 207 transition count 350
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 117 place count 163 transition count 306
Iterating global reduction 2 with 44 rules applied. Total rules applied 161 place count 163 transition count 306
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 205 place count 163 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 162 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 162 transition count 249
Applied a total of 207 rules in 16 ms. Remains 162 /239 variables (removed 77) and now considering 249/613 (removed 364) transitions.
// Phase 1: matrix 249 rows 162 cols
[2025-06-04 23:46:49] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:46:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 23:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:46:49] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-04 23:46:50] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-04 23:46:50] [INFO ] Invariant cache hit.
[2025-06-04 23:46:50] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 16831 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:22] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:22] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:23] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 4 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:30] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:30] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:31] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 6/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 524 constraints, problems are : Problem set: 22 solved, 226 unsolved in 30018 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 47019ms problems are : Problem set: 22 solved, 226 unsolved
Search for dead transitions found 22 dead transitions in 47020ms
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/239 places, 227/613 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 221
Applied a total of 24 rules in 2 ms. Remains 144 /162 variables (removed 18) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 144 cols
[2025-06-04 23:47:37] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:47:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 23:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:47:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 23:47:38] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/239 places, 221/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49115 ms. Remains : 144/239 places, 221/613 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-10 finished in 49539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0)))&&(p1||(p2&&X(!p0))))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 373
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 373
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 221 transition count 367
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 208 transition count 354
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 208 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 208 transition count 352
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 114 place count 164 transition count 308
Iterating global reduction 2 with 44 rules applied. Total rules applied 158 place count 164 transition count 308
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 202 place count 164 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 162 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 162 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 161 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 161 transition count 237
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 212 place count 157 transition count 233
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 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 228 place count 157 transition count 221
Applied a total of 228 rules in 17 ms. Remains 157 /239 variables (removed 82) and now considering 221/613 (removed 392) transitions.
// Phase 1: matrix 221 rows 157 cols
[2025-06-04 23:47:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:47:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 23:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:47:39] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-04 23:47:39] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-04 23:47:39] [INFO ] Invariant cache hit.
[2025-06-04 23:47:39] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:46] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 4 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:46] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:47:46] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 3/244 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/244 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/244 constraints. Problems are: Problem set: 20 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 244 constraints, problems are : Problem set: 20 solved, 200 unsolved in 21855 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: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 8/149 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 221/370 variables, 149/151 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 82/233 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 41/274 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/274 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 8/378 variables, 8/282 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 159/441 constraints. Problems are: Problem set: 20 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/444 constraints. Problems are: Problem set: 20 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:48:26] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 4 ms to minimize.
Problem TDEAD180 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:48:30] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 4 ms to minimize.
Problem TDEAD184 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:48:31] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/447 constraints. Problems are: Problem set: 22 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 447 constraints, problems are : Problem set: 22 solved, 198 unsolved in 30015 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: 200/220 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52006ms problems are : Problem set: 22 solved, 198 unsolved
Search for dead transitions found 22 dead transitions in 52008ms
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/239 places, 199/613 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 1 ms. Remains 139 /157 variables (removed 18) and now considering 193/199 (removed 6) transitions.
// Phase 1: matrix 193 rows 139 cols
[2025-06-04 23:48:31] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:48:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 23:48:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:48:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-04 23:48:32] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 139/239 places, 193/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53728 ms. Remains : 139/239 places, 193/613 transitions.
Stuttering acceptance computed with spot in 252 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 5 steps with 1 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 finished in 54004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 220 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 220 transition count 372
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 220 transition count 365
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 207 transition count 352
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 207 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 207 transition count 350
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 117 place count 163 transition count 306
Iterating global reduction 2 with 44 rules applied. Total rules applied 161 place count 163 transition count 306
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 205 place count 163 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 162 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 162 transition count 249
Applied a total of 207 rules in 22 ms. Remains 162 /239 variables (removed 77) and now considering 249/613 (removed 364) transitions.
// Phase 1: matrix 249 rows 162 cols
[2025-06-04 23:48:33] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:48:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 23:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:48:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-04 23:48:34] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:48:34] [INFO ] Redundant transitions in 4 ms returned []
Running 248 sub problems to find dead transitions.
[2025-06-04 23:48:34] [INFO ] Invariant cache hit.
[2025-06-04 23:48:34] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 16783 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:05] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:06] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:06] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 5 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:13] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 3 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:14] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:14] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 6/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 524 constraints, problems are : Problem set: 22 solved, 226 unsolved in 30019 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 46987ms problems are : Problem set: 22 solved, 226 unsolved
Search for dead transitions found 22 dead transitions in 46989ms
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/239 places, 227/613 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.1 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 8 ms. Remains 144 /162 variables (removed 18) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 144 cols
[2025-06-04 23:49:21] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:49:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 23:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:49:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 23:49:22] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/239 places, 221/613 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49097 ms. Remains : 144/239 places, 221/613 transitions.
Stuttering acceptance computed with spot in 157 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 18394 reset in 336 ms.
Product exploration explored 100000 steps with 18113 reset in 280 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.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 p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 133 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)))]
RANDOM walk for 40000 steps (7149 resets) in 198 ms. (201 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (858 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1043 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2025-06-04 23:49:23] [INFO ] Invariant cache hit.
[2025-06-04 23:49:23] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 apf4 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 apf2 is UNSAT
After SMT solving in domain Real declared 365/365 variables, and 193 constraints, problems are : Problem set: 2 solved, 0 unsolved in 116 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms 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 p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p1)))]
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 308 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 168 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 185 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 8 ms. Remains 144 /144 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2025-06-04 23:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:49:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-04 23:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:49:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 23:49:25] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:49:25] [INFO ] Redundant transitions in 2 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-04 23:49:25] [INFO ] Invariant cache hit.
[2025-06-04 23:49:25] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15993 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:49:59] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 469 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30023 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, Known Traps Along Path: 1/1 constraints]
After SMT, in 46135ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 46136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46960 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.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 p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 129 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 154 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (7238 resets) in 173 ms. (229 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (838 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (989 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-06-04 23:50:11] [INFO ] Invariant cache hit.
[2025-06-04 23:50:11] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 apf4 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 apf2 is UNSAT
After SMT solving in domain Real declared 365/365 variables, and 193 constraints, problems are : Problem set: 2 solved, 0 unsolved in 89 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms 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 p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p1)))]
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 266 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 145 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 129 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 136 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 18307 reset in 244 ms.
Product exploration explored 100000 steps with 18245 reset in 242 ms.
Built C files in :
/tmp/ltsmin9686216806194486371
[2025-06-04 23:50:12] [INFO ] Computing symmetric may disable matrix : 221 transitions.
[2025-06-04 23:50:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:50:12] [INFO ] Computing symmetric may enable matrix : 221 transitions.
[2025-06-04 23:50:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:50:12] [INFO ] Computing Do-Not-Accords matrix : 221 transitions.
[2025-06-04 23:50:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:50:12] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9686216806194486371
Running compilation step : cd /tmp/ltsmin9686216806194486371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 451 ms.
Running link step : cd /tmp/ltsmin9686216806194486371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9686216806194486371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11575298832165229332.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 10 ms. Remains 144 /144 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2025-06-04 23:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:50:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 23:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:50:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 23:50:28] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:50:28] [INFO ] Redundant transitions in 2 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-04 23:50:28] [INFO ] Invariant cache hit.
[2025-06-04 23:50:28] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 15684 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 469 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30028 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, Known Traps Along Path: 1/1 constraints]
After SMT, in 45866ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 45868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46695 ms. Remains : 144/144 places, 221/221 transitions.
Built C files in :
/tmp/ltsmin15079861697254607656
[2025-06-04 23:51:14] [INFO ] Computing symmetric may disable matrix : 221 transitions.
[2025-06-04 23:51:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:51:14] [INFO ] Computing symmetric may enable matrix : 221 transitions.
[2025-06-04 23:51:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:51:14] [INFO ] Computing Do-Not-Accords matrix : 221 transitions.
[2025-06-04 23:51:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:51:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15079861697254607656
Running compilation step : cd /tmp/ltsmin15079861697254607656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 490 ms.
Running link step : cd /tmp/ltsmin15079861697254607656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15079861697254607656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14899803722923506785.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 23:51:29] [INFO ] Flatten gal took : 17 ms
[2025-06-04 23:51:29] [INFO ] Flatten gal took : 13 ms
[2025-06-04 23:51:29] [INFO ] Time to serialize gal into /tmp/LTL14290062835132080218.gal : 2 ms
[2025-06-04 23:51:29] [INFO ] Time to serialize properties into /tmp/LTL14791746647512663086.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14290062835132080218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2859529437139242476.hoa' '-atoms' '/tmp/LTL14791746647512663086.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14791746647512663086.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2859529437139242476.hoa
Detected timeout of ITS tools.
[2025-06-04 23:51:44] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:51:44] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:51:44] [INFO ] Time to serialize gal into /tmp/LTL13397495260107275619.gal : 2 ms
[2025-06-04 23:51:44] [INFO ] Time to serialize properties into /tmp/LTL9500251800679358144.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13397495260107275619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9500251800679358144.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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.
[2025-06-04 23:52:00] [INFO ] Flatten gal took : 11 ms
[2025-06-04 23:52:00] [INFO ] Applying decomposition
[2025-06-04 23:52:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4738164588644648393.txt' '-o' '/tmp/graph4738164588644648393.bin' '-w' '/tmp/graph4738164588644648393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4738164588644648393.bin' '-l' '-1' '-v' '-w' '/tmp/graph4738164588644648393.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:52:00] [INFO ] Decomposing Gal with order
[2025-06-04 23:52:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:52:00] [INFO ] Removed a total of 207 redundant transitions.
[2025-06-04 23:52:00] [INFO ] Flatten gal took : 17 ms
[2025-06-04 23:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 5 ms.
[2025-06-04 23:52:00] [INFO ] Time to serialize gal into /tmp/LTL6769459036034732253.gal : 3 ms
[2025-06-04 23:52:00] [INFO ] Time to serialize properties into /tmp/LTL2858568783817528444.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6769459036034732253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2858568783817528444.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((u0.s1>=1)&&(u0.l3414>=1))")))&&(F(G(!("((u0.s1>=1)&&(u0.l3922>=1))"))))))U(G(!("((u0.s1>=1)&&(u0.l192>=1))")))))
Formula 0 simplified : F(G"((u0.s1>=1)&&(u0.l3414>=1))" | GF"((u0.s1>=1)&&(u0.l3922>=1))") R F"((u0.s1>=1)&&(u0.l192>=1))"
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-14 finished in 222051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 219 transition count 378
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 219 transition count 378
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 219 transition count 371
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 206 transition count 358
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 206 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 206 transition count 356
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 119 place count 162 transition count 312
Iterating global reduction 2 with 44 rules applied. Total rules applied 163 place count 162 transition count 312
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 215 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 220 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 225 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 229 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 241 place count 155 transition count 217
Applied a total of 241 rules in 16 ms. Remains 155 /239 variables (removed 84) and now considering 217/613 (removed 396) transitions.
// Phase 1: matrix 217 rows 155 cols
[2025-06-04 23:52:15] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:52:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 23:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:52:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-06-04 23:52:15] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-04 23:52:15] [INFO ] Invariant cache hit.
[2025-06-04 23:52:15] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:21] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 4 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/238 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/238 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/238 constraints. Problems are: Problem set: 10 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 238 constraints, problems are : Problem set: 10 solved, 206 unsolved in 18357 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: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 4/151 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 217/368 variables, 151/154 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 80/234 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 45/279 constraints. Problems are: Problem set: 10 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:41] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 1/280 constraints. Problems are: Problem set: 10 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:49] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:52] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/282 constraints. Problems are: Problem set: 10 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/282 constraints. Problems are: Problem set: 10 solved, 206 unsolved
SMT process timed out in 48500ms, After SMT, problems are : Problem set: 10 solved, 206 unsolved
Search for dead transitions found 10 dead transitions in 48502ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/239 places, 207/613 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 147 transition count 205
Applied a total of 10 rules in 2 ms. Remains 147 /155 variables (removed 8) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 147 cols
[2025-06-04 23:53:04] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 23:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-04 23:53:05] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/239 places, 205/613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50052 ms. Remains : 147/239 places, 205/613 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-15
Stuttering criterion allowed to conclude after 3 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 50131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Found a Lengthening insensitive property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-08
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 239/239 places, 613/613 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 397
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 397
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 43 place count 221 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 209 transition count 378
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 209 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 209 transition count 376
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 109 place count 169 transition count 336
Iterating global reduction 2 with 40 rules applied. Total rules applied 149 place count 169 transition count 336
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 201 place count 169 transition count 284
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 167 transition count 258
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 167 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 166 transition count 257
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 166 transition count 257
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 211 place count 162 transition count 253
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 162 transition count 253
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 231 place count 162 transition count 237
Applied a total of 231 rules in 23 ms. Remains 162 /239 variables (removed 77) and now considering 237/613 (removed 376) transitions.
// Phase 1: matrix 237 rows 162 cols
[2025-06-04 23:53:05] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:05] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 23:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-04 23:53:06] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-04 23:53:06] [INFO ] Invariant cache hit.
[2025-06-04 23:53:06] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/399 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 94/258 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:23] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:23] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/399 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 260 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 237/399 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 236/496 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 5 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:56] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 5/501 constraints. Problems are: Problem set: 22 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 501 constraints, problems are : Problem set: 22 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 22 solved, 214 unsolved
Search for dead transitions found 22 dead transitions in 60181ms
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/239 places, 215/613 transitions.
Graph (complete) has 527 edges and 162 vertex of which 144 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 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 209
Applied a total of 7 rules in 5 ms. Remains 144 /162 variables (removed 18) and now considering 209/215 (removed 6) transitions.
// Phase 1: matrix 209 rows 144 cols
[2025-06-04 23:54:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 23:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:54:07] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 144/239 places, 209/613 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 61882 ms. Remains : 144/239 places, 209/613 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-08
Product exploration explored 100000 steps with 18403 reset in 230 ms.
Product exploration explored 100000 steps with 18331 reset in 222 ms.
Computed a total of 19 stabilizing places and 71 stable transitions
Graph (complete) has 507 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 71 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (7331 resets) in 110 ms. (360 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (1395 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-06-04 23:54:08] [INFO ] Invariant cache hit.
[2025-06-04 23:54:08] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/226 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 353/353 variables, and 185 constraints, problems are : Problem set: 1 solved, 0 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 39/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2025-06-04 23:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 23:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:54:09] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-04 23:54:09] [INFO ] Invariant cache hit.
[2025-06-04 23:54:09] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47548ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47550ms
Finished structural reductions in LTL mode , in 1 iterations and 48262 ms. Remains : 144/144 places, 209/209 transitions.
Computed a total of 19 stabilizing places and 71 stable transitions
Graph (complete) has 507 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1356 steps (237 resets) in 9 ms. (135 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 18360 reset in 221 ms.
Product exploration explored 100000 steps with 18410 reset in 241 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:54:58] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2025-06-04 23:54:58] [INFO ] Invariant cache hit.
[2025-06-04 23:54:58] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47636ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47637ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47651 ms. Remains : 144/144 places, 209/209 transitions.
Built C files in :
/tmp/ltsmin8602686284175463526
[2025-06-04 23:55:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8602686284175463526
Running compilation step : cd /tmp/ltsmin8602686284175463526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin8602686284175463526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8602686284175463526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6617430680130189075.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 LTL mode, iteration 0 : 144/144 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2025-06-04 23:56:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:56:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-04 23:56:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:56:01] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 23:56:02] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-04 23:56:02] [INFO ] Invariant cache hit.
[2025-06-04 23:56:02] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 236 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17419 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/353 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 90/236 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 208/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47566ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47567ms
Finished structural reductions in LTL mode , in 1 iterations and 48321 ms. Remains : 144/144 places, 209/209 transitions.
Built C files in :
/tmp/ltsmin8227907451150960277
[2025-06-04 23:56:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8227907451150960277
Running compilation step : cd /tmp/ltsmin8227907451150960277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 320 ms.
Running link step : cd /tmp/ltsmin8227907451150960277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8227907451150960277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased857865030669176562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 23:57:04] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:57:04] [INFO ] Flatten gal took : 5 ms
[2025-06-04 23:57:04] [INFO ] Time to serialize gal into /tmp/LTL396471021425365733.gal : 1 ms
[2025-06-04 23:57:04] [INFO ] Time to serialize properties into /tmp/LTL6683765755935429206.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL396471021425365733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15873085592629853190.hoa' '-atoms' '/tmp/LTL6683765755935429206.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6683765755935429206.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15873085592629853190.hoa
Detected timeout of ITS tools.
[2025-06-04 23:57:20] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:57:20] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:57:20] [INFO ] Time to serialize gal into /tmp/LTL10473569527727501486.gal : 1 ms
[2025-06-04 23:57:20] [INFO ] Time to serialize properties into /tmp/LTL1351621542188439849.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10473569527727501486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1351621542188439849.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((s1<1)||(l3939<1))"))||("(((s1<1)||(l3911<1))&&((s1<1)||(l2793<1)))"))))))
Formula 0 simplified : XXF(!"(((s1<1)||(l3911<1))&&((s1<1)||(l2793<1)))" & F!"((s1<1)||(l3939<1))")
Detected timeout of ITS tools.
[2025-06-04 23:57:35] [INFO ] Flatten gal took : 6 ms
[2025-06-04 23:57:35] [INFO ] Applying decomposition
[2025-06-04 23:57:35] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph17519504666500342324.txt' '-o' '/tmp/graph17519504666500342324.bin' '-w' '/tmp/graph17519504666500342324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17519504666500342324.bin' '-l' '-1' '-v' '-w' '/tmp/graph17519504666500342324.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:57:35] [INFO ] Decomposing Gal with order
[2025-06-04 23:57:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:57:35] [INFO ] Removed a total of 218 redundant transitions.
[2025-06-04 23:57:35] [INFO ] Flatten gal took : 21 ms
[2025-06-04 23:57:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 4 ms.
[2025-06-04 23:57:35] [INFO ] Time to serialize gal into /tmp/LTL15520739747645604381.gal : 2 ms
[2025-06-04 23:57:35] [INFO ] Time to serialize properties into /tmp/LTL8833657403584025154.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15520739747645604381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8833657403584025154.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G("((u1.s1<1)||(i1.u5.l3939<1))"))||("(((u1.s1<1)||(i1.u5.l3911<1))&&((u1.s1<1)||(u4.l2793<1)))"))))))
Formula 0 simplified : XXF(!"(((u1.s1<1)||(i1.u5.l3911<1))&&((u1.s1<1)||(u4.l2793<1)))" & F!"((u1.s1<1)||(i1.u5.l3939<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 finished in 284842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
[2025-06-04 23:57:50] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9043844018630829021
[2025-06-04 23:57:50] [INFO ] Applying decomposition
[2025-06-04 23:57:50] [INFO ] Computing symmetric may disable matrix : 613 transitions.
[2025-06-04 23:57:50] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:57:50] [INFO ] Flatten gal took : 16 ms
[2025-06-04 23:57:50] [INFO ] Computing symmetric may enable matrix : 613 transitions.
[2025-06-04 23:57:50] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph6365758451914818197.txt' '-o' '/tmp/graph6365758451914818197.bin' '-w' '/tmp/graph6365758451914818197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6365758451914818197.bin' '-l' '-1' '-v' '-w' '/tmp/graph6365758451914818197.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:57:50] [INFO ] Decomposing Gal with order
[2025-06-04 23:57:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:57:50] [INFO ] Computing Do-Not-Accords matrix : 613 transitions.
[2025-06-04 23:57:50] [INFO ] Removed a total of 427 redundant transitions.
[2025-06-04 23:57:50] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:57:50] [INFO ] Flatten gal took : 33 ms
[2025-06-04 23:57:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 7 ms.
[2025-06-04 23:57:50] [INFO ] Time to serialize gal into /tmp/LTLFireability14160944604288889389.gal : 3 ms
[2025-06-04 23:57:50] [INFO ] Time to serialize properties into /tmp/LTLFireability14211556855303549487.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14160944604288889389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14211556855303549487.ltl' '-c' '-stutter-deadlock'
[2025-06-04 23:57:50] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9043844018630829021
Running compilation step : cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("((u0.s1<1)||(u0.l3250<1))"))))
Formula 0 simplified : GF!"((u0.s1<1)||(u0.l3250<1))"
Compilation finished in 1760 ms.
Running link step : cd /tmp/ltsmin9043844018630829021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>(!(LTLAPp3==true))&&<>([](!(LTLAPp4==true))))) U [](!(LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>(!(LTLAPp3==true))&&<>([](!(LTLAPp4==true))))) U [](!(LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9043844018630829021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 00:26:31] [INFO ] Flatten gal took : 75 ms
[2025-06-05 00:26:31] [INFO ] Time to serialize gal into /tmp/LTLFireability780108562448758331.gal : 11 ms
[2025-06-05 00:26:31] [INFO ] Time to serialize properties into /tmp/LTLFireability5336834988259436113.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability780108562448758331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5336834988259436113.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 3 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l3250<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3250<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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r184-tall-174889264200436"
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.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 ;