Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716794734188

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 07:25:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 07:25:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:25:35] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2024-05-27 07:25:35] [INFO ] Transformed 6690 places.
[2024-05-27 07:25:35] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:25:35] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4305 places in 41 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 1088 places :
Symmetric choice reduction at 1 with 1088 rule applications. Total rules 1207 place count 1280 transition count 7064
Iterating global reduction 1 with 1088 rules applied. Total rules applied 2295 place count 1280 transition count 7064
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 2571 place count 1280 transition count 6788
Discarding 924 places :
Symmetric choice reduction at 2 with 924 rule applications. Total rules 3495 place count 356 transition count 5864
Iterating global reduction 2 with 924 rules applied. Total rules applied 4419 place count 356 transition count 5864
Ensure Unique test removed 4693 transitions
Reduce isomorphic transitions removed 4693 transitions.
Iterating post reduction 2 with 4693 rules applied. Total rules applied 9112 place count 356 transition count 1171
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 9173 place count 295 transition count 1110
Iterating global reduction 3 with 61 rules applied. Total rules applied 9234 place count 295 transition count 1110
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 3 with 205 rules applied. Total rules applied 9439 place count 295 transition count 905
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9447 place count 287 transition count 897
Iterating global reduction 4 with 8 rules applied. Total rules applied 9455 place count 287 transition count 897
Applied a total of 9455 rules in 404 ms. Remains 287 /2385 variables (removed 2098) and now considering 897/11934 (removed 11037) transitions.
// Phase 1: matrix 897 rows 287 cols
[2024-05-27 07:25:36] [INFO ] Computed 3 invariants in 30 ms
[2024-05-27 07:25:37] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-27 07:25:37] [INFO ] Invariant cache hit.
[2024-05-27 07:25:37] [INFO ] State equation strengthened by 638 read => feed constraints.
[2024-05-27 07:25:38] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2024-05-27 07:25:38] [INFO ] Invariant cache hit.
[2024-05-27 07:25:38] [INFO ] State equation strengthened by 638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
At refinement iteration 4 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 928 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 1 (OVERLAPS) 17/279 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 3 (OVERLAPS) 8/287 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 5 (OVERLAPS) 897/1184 variables, 287/290 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1184 variables, 638/928 constraints. Problems are: Problem set: 24 solved, 872 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 872/1800 constraints. Problems are: Problem set: 24 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1800 constraints, problems are : Problem set: 24 solved, 872 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, ReadFeed: 638/638 constraints, PredecessorRefiner: 872/896 constraints, Known Traps: 0/0 constraints]
After SMT, in 63640ms problems are : Problem set: 24 solved, 872 unsolved
Search for dead transitions found 24 dead transitions in 63670ms
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 : 287/2385 places, 873/11934 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 264 transition count 862
Applied a total of 34 rules in 6 ms. Remains 264 /287 variables (removed 23) and now considering 862/873 (removed 11) transitions.
// Phase 1: matrix 862 rows 264 cols
[2024-05-27 07:26:42] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:26:42] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-27 07:26:42] [INFO ] Invariant cache hit.
[2024-05-27 07:26:42] [INFO ] State equation strengthened by 634 read => feed constraints.
[2024-05-27 07:26:43] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/2385 places, 862/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67284 ms. Remains : 264/2385 places, 862/11934 transitions.
Support contains 25 out of 264 places after structural reductions.
[2024-05-27 07:26:43] [INFO ] Flatten gal took : 100 ms
[2024-05-27 07:26:43] [INFO ] Flatten gal took : 50 ms
[2024-05-27 07:26:44] [INFO ] Input system was already deterministic with 862 transitions.
RANDOM walk for 40000 steps (6504 resets) in 2432 ms. (16 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (836 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
[2024-05-27 07:26:44] [INFO ] Invariant cache hit.
[2024-05-27 07:26:44] [INFO ] State equation strengthened by 634 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 319/396 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 91/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 1126/1126 variables, and 357 constraints, problems are : Problem set: 1 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 264/264 constraints, ReadFeed: 91/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 70 stabilizing places and 424 stable transitions
Graph (complete) has 1391 edges and 264 vertex of which 262 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 20 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:26:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:26:45] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-27 07:26:45] [INFO ] Invariant cache hit.
[2024-05-27 07:26:45] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:26:46] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-27 07:26:46] [INFO ] Invariant cache hit.
[2024-05-27 07:26:46] [INFO ] State equation strengthened by 126 read => feed constraints.
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
All remaining problems are real, not stopping.
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 8668 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]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
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
[2024-05-27 07:27:02] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 7 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:27:02] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:27:02] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-05-27 07:27:05] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:27:05] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:27:05] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 573 constraints, problems are : Problem set: 22 solved, 250 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: 6/6 constraints]
After SMT, in 39165ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 39168ms
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/264 places, 251/862 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 245
Applied a total of 24 rules in 5 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:27:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:27:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 07:27:25] [INFO ] Invariant cache hit.
[2024-05-27 07:27:25] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:27:25] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40327 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 247 ms :[(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-d1m020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 finished in 41341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 290 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 294 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 306 place count 155 transition count 217
Applied a total of 306 rules in 18 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:27:26] [INFO ] Computed 2 invariants in 9 ms
[2024-05-27 07:27:26] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 07:27:26] [INFO ] Invariant cache hit.
[2024-05-27 07:27:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:27:27] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 07:27:27] [INFO ] Invariant cache hit.
[2024-05-27 07:27:27] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:27:38] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:27:38] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:27:38] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 07:27:40] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 07:27:40] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:27:41] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 19608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 26415ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 26418ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 5 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:27:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:27:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 07:27:53] [INFO ] Invariant cache hit.
[2024-05-27 07:27:53] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:27:53] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27204 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 finished in 27310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(G((X(p1) U !p0)))||p2))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 272 place count 174 transition count 320
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 173 transition count 307
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 173 transition count 307
Applied a total of 274 rules in 18 ms. Remains 173 /264 variables (removed 91) and now considering 307/862 (removed 555) transitions.
// Phase 1: matrix 307 rows 173 cols
[2024-05-27 07:27:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:27:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 07:27:54] [INFO ] Invariant cache hit.
[2024-05-27 07:27:54] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-27 07:27:54] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-27 07:27:54] [INFO ] Invariant cache hit.
[2024-05-27 07:27:54] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 330 constraints, problems are : Problem set: 0 solved, 306 unsolved in 10426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/480 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 155/330 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 306/636 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-27 07:28:12] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:28:13] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 07:28:13] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 07:28:13] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-27 07:28:16] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:28:17] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 6/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/642 constraints. Problems are: Problem set: 22 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 642 constraints, problems are : Problem set: 22 solved, 284 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints]
After SMT, in 40947ms problems are : Problem set: 22 solved, 284 unsolved
Search for dead transitions found 22 dead transitions in 40953ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 285/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 279
Applied a total of 24 rules in 3 ms. Remains 155 /173 variables (removed 18) and now considering 279/285 (removed 6) transitions.
// Phase 1: matrix 279 rows 155 cols
[2024-05-27 07:28:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:28:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:28:35] [INFO ] Invariant cache hit.
[2024-05-27 07:28:35] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-05-27 07:28:36] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 279/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42125 ms. Remains : 155/264 places, 279/862 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (NOT p0)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 finished in 42272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U (X(!p3)&&p2)))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 495
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 494
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 478
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 230 transition count 476
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 127 place count 174 transition count 420
Iterating global reduction 3 with 56 rules applied. Total rules applied 183 place count 174 transition count 420
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 275 place count 174 transition count 328
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 276 place count 173 transition count 315
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 173 transition count 315
Applied a total of 277 rules in 24 ms. Remains 173 /264 variables (removed 91) and now considering 315/862 (removed 547) transitions.
// Phase 1: matrix 315 rows 173 cols
[2024-05-27 07:28:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:28:36] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 07:28:36] [INFO ] Invariant cache hit.
[2024-05-27 07:28:36] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-27 07:28:36] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-27 07:28:36] [INFO ] Invariant cache hit.
[2024-05-27 07:28:36] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 338 constraints, problems are : Problem set: 0 solved, 314 unsolved in 11122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/488 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 163/338 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 314/652 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-27 07:28:56] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 07:28:56] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
[2024-05-27 07:29:00] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
[2024-05-27 07:29:00] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
[2024-05-27 07:29:00] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:29:00] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/658 constraints. Problems are: Problem set: 22 solved, 292 unsolved
[2024-05-27 07:29:07] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:29:08] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 2/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/660 constraints. Problems are: Problem set: 22 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 660 constraints, problems are : Problem set: 22 solved, 292 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints]
After SMT, in 41693ms problems are : Problem set: 22 solved, 292 unsolved
Search for dead transitions found 22 dead transitions in 41699ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/264 places, 293/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 287
Applied a total of 24 rules in 8 ms. Remains 155 /173 variables (removed 18) and now considering 287/293 (removed 6) transitions.
// Phase 1: matrix 287 rows 155 cols
[2024-05-27 07:29:18] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 07:29:18] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 07:29:18] [INFO ] Invariant cache hit.
[2024-05-27 07:29:18] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-27 07:29:19] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/264 places, 287/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42806 ms. Remains : 155/264 places, 287/862 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p2) p3), true, p3, (NOT p1), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3)), p3]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 finished in 43088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 429
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 428
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 410
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 226 transition count 408
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 143 place count 162 transition count 344
Iterating global reduction 3 with 64 rules applied. Total rules applied 207 place count 162 transition count 344
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 291 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 293 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 295 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 296 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 301 place count 155 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 305 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 317 place count 155 transition count 217
Applied a total of 317 rules in 20 ms. Remains 155 /264 variables (removed 109) and now considering 217/862 (removed 645) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:29:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:29:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:29:19] [INFO ] Invariant cache hit.
[2024-05-27 07:29:19] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:29:19] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 07:29:19] [INFO ] Invariant cache hit.
[2024-05-27 07:29:19] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:29:31] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:29:31] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:29:31] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 07:29:33] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 07:29:33] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-27 07:29:33] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 19302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 25941ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 25945ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/264 places, 195/862 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 5 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:29:45] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:29:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 07:29:45] [INFO ] Invariant cache hit.
[2024-05-27 07:29:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:29:46] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/264 places, 189/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26687 ms. Remains : 137/264 places, 189/862 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 finished in 26774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 245 transition count 419
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 245 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 245 transition count 418
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 227 transition count 400
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 227 transition count 400
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 227 transition count 397
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 142 place count 163 transition count 333
Iterating global reduction 2 with 64 rules applied. Total rules applied 206 place count 163 transition count 333
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 278 place count 163 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 162 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 162 transition count 248
Applied a total of 280 rules in 18 ms. Remains 162 /264 variables (removed 102) and now considering 248/862 (removed 614) transitions.
// Phase 1: matrix 248 rows 162 cols
[2024-05-27 07:29:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:29:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:29:46] [INFO ] Invariant cache hit.
[2024-05-27 07:29:46] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-27 07:29:46] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-27 07:29:46] [INFO ] Invariant cache hit.
[2024-05-27 07:29:46] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 269 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/409 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 49/317 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-27 07:30:01] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:30:02] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 07:30:02] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-27 07:30:03] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
[2024-05-27 07:30:03] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:30:03] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 6/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/323 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/324 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 186/510 constraints. Problems are: Problem set: 22 solved, 225 unsolved
[2024-05-27 07:30:15] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/410 variables, 0/511 constraints. Problems are: Problem set: 22 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 511 constraints, problems are : Problem set: 22 solved, 225 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: 105/105 constraints, PredecessorRefiner: 235/247 constraints, Known Traps: 7/7 constraints]
After SMT, in 42166ms problems are : Problem set: 22 solved, 225 unsolved
Search for dead transitions found 22 dead transitions in 42168ms
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/264 places, 226/862 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 220
Applied a total of 24 rules in 3 ms. Remains 144 /162 variables (removed 18) and now considering 220/226 (removed 6) transitions.
// Phase 1: matrix 220 rows 144 cols
[2024-05-27 07:30:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:30:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:30:28] [INFO ] Invariant cache hit.
[2024-05-27 07:30:28] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-27 07:30:29] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/264 places, 220/862 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42965 ms. Remains : 144/264 places, 220/862 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 finished in 43270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !(!p0 U p1)))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 484
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 483
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 467
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 128 place count 174 transition count 408
Iterating global reduction 3 with 56 rules applied. Total rules applied 184 place count 174 transition count 408
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 288 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 289 place count 173 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 290 place count 173 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 172 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 172 transition count 290
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 168 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 168 transition count 286
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 324 place count 168 transition count 262
Applied a total of 324 rules in 66 ms. Remains 168 /264 variables (removed 96) and now considering 262/862 (removed 600) transitions.
// Phase 1: matrix 262 rows 168 cols
[2024-05-27 07:30:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:30:29] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:30:29] [INFO ] Invariant cache hit.
[2024-05-27 07:30:29] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 07:30:30] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-27 07:30:30] [INFO ] Redundant transitions in 14 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-27 07:30:30] [INFO ] Invariant cache hit.
[2024-05-27 07:30:30] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/430 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 285 constraints, problems are : Problem set: 0 solved, 261 unsolved in 9356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 261/546 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-27 07:30:45] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:30:46] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-05-27 07:30:48] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-27 07:30:48] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-27 07:30:48] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:30:48] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/552 constraints. Problems are: Problem set: 22 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 552 constraints, problems are : Problem set: 22 solved, 239 unsolved in 26626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 36375ms problems are : Problem set: 22 solved, 239 unsolved
Search for dead transitions found 22 dead transitions in 36377ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/264 places, 240/862 transitions.
Graph (complete) has 561 edges and 168 vertex of which 150 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 150 transition count 234
Applied a total of 7 rules in 11 ms. Remains 150 /168 variables (removed 18) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 150 cols
[2024-05-27 07:31:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:31:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:31:06] [INFO ] Invariant cache hit.
[2024-05-27 07:31:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:31:06] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/264 places, 234/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37411 ms. Remains : 150/264 places, 234/862 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
Product exploration explored 100000 steps with 18532 reset in 325 ms.
Product exploration explored 100000 steps with 18572 reset in 278 ms.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 97 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p1, p1, p1]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (7310 resets) in 224 ms. (177 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (1183 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-05-27 07:31:07] [INFO ] Invariant cache hit.
[2024-05-27 07:31:07] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
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) 170/238 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 384/384 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 47/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 258 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 14 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-27 07:31:08] [INFO ] Invariant cache hit.
[2024-05-27 07:31:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 07:31:08] [INFO ] Invariant cache hit.
[2024-05-27 07:31:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:31:08] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-27 07:31:08] [INFO ] Redundant transitions in 2 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-27 07:31:08] [INFO ] Invariant cache hit.
[2024-05-27 07:31:08] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24693ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25102 ms. Remains : 150/150 places, 234/234 transitions.
Computed a total of 25 stabilizing places and 96 stable transitions
Graph (complete) has 541 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
RANDOM walk for 637 steps (114 resets) in 15 ms. (39 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
Product exploration explored 100000 steps with 18459 reset in 208 ms.
Product exploration explored 100000 steps with 18672 reset in 217 ms.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-27 07:31:34] [INFO ] Invariant cache hit.
[2024-05-27 07:31:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:31:34] [INFO ] Invariant cache hit.
[2024-05-27 07:31:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:31:34] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-27 07:31:34] [INFO ] Redundant transitions in 5 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-27 07:31:34] [INFO ] Invariant cache hit.
[2024-05-27 07:31:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 263 constraints, problems are : Problem set: 0 solved, 233 unsolved in 7963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/384 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 111/263 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 233/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 496 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16591 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 24863ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 24866ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25321 ms. Remains : 150/150 places, 234/234 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 finished in 90503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 441
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 246 transition count 440
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 53 place count 230 transition count 424
Iterating global reduction 2 with 16 rules applied. Total rules applied 69 place count 230 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 230 transition count 423
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 130 place count 170 transition count 363
Iterating global reduction 3 with 60 rules applied. Total rules applied 190 place count 170 transition count 363
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 266 place count 170 transition count 287
Applied a total of 266 rules in 26 ms. Remains 170 /264 variables (removed 94) and now considering 287/862 (removed 575) transitions.
// Phase 1: matrix 287 rows 170 cols
[2024-05-27 07:31:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:32:00] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-27 07:32:00] [INFO ] Invariant cache hit.
[2024-05-27 07:32:00] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-27 07:32:00] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-05-27 07:32:00] [INFO ] Redundant transitions in 3 ms returned []
Running 286 sub problems to find dead transitions.
[2024-05-27 07:32:00] [INFO ] Invariant cache hit.
[2024-05-27 07:32:00] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 310 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/457 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 286/596 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-27 07:32:18] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-27 07:32:18] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-27 07:32:18] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-05-27 07:32:21] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-05-27 07:32:21] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:32:22] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 6/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/602 constraints. Problems are: Problem set: 22 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 602 constraints, problems are : Problem set: 22 solved, 264 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints]
After SMT, in 40716ms problems are : Problem set: 22 solved, 264 unsolved
Search for dead transitions found 22 dead transitions in 40720ms
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 : 170/264 places, 265/862 transitions.
Graph (complete) has 590 edges and 170 vertex of which 152 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 152 transition count 259
Applied a total of 7 rules in 12 ms. Remains 152 /170 variables (removed 18) and now considering 259/265 (removed 6) transitions.
// Phase 1: matrix 259 rows 152 cols
[2024-05-27 07:32:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:32:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:32:41] [INFO ] Invariant cache hit.
[2024-05-27 07:32:41] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:32:41] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 152/264 places, 259/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41821 ms. Remains : 152/264 places, 259/862 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Product exploration explored 100000 steps with 18071 reset in 234 ms.
Product exploration explored 100000 steps with 18177 reset in 229 ms.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1745 steps (300 resets) in 16 ms. (102 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 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-27 07:32:42] [INFO ] Invariant cache hit.
[2024-05-27 07:32:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:32:42] [INFO ] Invariant cache hit.
[2024-05-27 07:32:42] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:32:42] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-27 07:32:43] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-27 07:32:43] [INFO ] Invariant cache hit.
[2024-05-27 07:32:43] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 26928ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 26931ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27290 ms. Remains : 152/152 places, 259/259 transitions.
Computed a total of 19 stabilizing places and 97 stable transitions
Graph (complete) has 570 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 97 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 303 steps (45 resets) in 6 ms. (43 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 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18227 reset in 193 ms.
Product exploration explored 100000 steps with 17973 reset in 197 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-27 07:33:10] [INFO ] Invariant cache hit.
[2024-05-27 07:33:10] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 07:33:10] [INFO ] Invariant cache hit.
[2024-05-27 07:33:10] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 07:33:11] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-27 07:33:11] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-27 07:33:11] [INFO ] Invariant cache hit.
[2024-05-27 07:33:11] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 288 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/411 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 134/288 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 258/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/411 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 546 constraints, problems are : Problem set: 0 solved, 258 unsolved in 17897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 26466ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 26470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26845 ms. Remains : 152/152 places, 259/259 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 97773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p1||F(p2))))'
Support contains 5 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 246 transition count 431
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 246 transition count 431
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 229 transition count 414
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 229 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 229 transition count 413
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 135 place count 165 transition count 349
Iterating global reduction 2 with 64 rules applied. Total rules applied 199 place count 165 transition count 349
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 279 place count 165 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 164 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 164 transition count 256
Applied a total of 281 rules in 21 ms. Remains 164 /264 variables (removed 100) and now considering 256/862 (removed 606) transitions.
// Phase 1: matrix 256 rows 164 cols
[2024-05-27 07:33:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:33:37] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 07:33:37] [INFO ] Invariant cache hit.
[2024-05-27 07:33:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:33:38] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-27 07:33:38] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-27 07:33:38] [INFO ] Invariant cache hit.
[2024-05-27 07:33:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 255 unsolved in 7605 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/420 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 111/277 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 255/532 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-27 07:33:50] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-27 07:33:51] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-27 07:33:52] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2024-05-27 07:33:54] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
[2024-05-27 07:33:54] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:33:54] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 6/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/538 constraints. Problems are: Problem set: 22 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 538 constraints, problems are : Problem set: 22 solved, 233 unsolved in 23020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
After SMT, in 30983ms problems are : Problem set: 22 solved, 233 unsolved
Search for dead transitions found 22 dead transitions in 30987ms
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 : 164/264 places, 234/862 transitions.
Graph (complete) has 550 edges and 164 vertex of which 146 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 146 transition count 228
Applied a total of 7 rules in 5 ms. Remains 146 /164 variables (removed 18) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 146 cols
[2024-05-27 07:34:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:34:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:34:09] [INFO ] Invariant cache hit.
[2024-05-27 07:34:09] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-27 07:34:09] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/264 places, 228/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31813 ms. Remains : 146/264 places, 228/862 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 finished in 31908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 245 transition count 451
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 245 transition count 450
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 56 place count 228 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 73 place count 228 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 228 transition count 430
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 136 place count 168 transition count 370
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 168 transition count 370
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 280 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 167 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 167 transition count 273
Applied a total of 282 rules in 27 ms. Remains 167 /264 variables (removed 97) and now considering 273/862 (removed 589) transitions.
// Phase 1: matrix 273 rows 167 cols
[2024-05-27 07:34:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:34:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:34:09] [INFO ] Invariant cache hit.
[2024-05-27 07:34:09] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:34:10] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-27 07:34:10] [INFO ] Redundant transitions in 2 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-27 07:34:10] [INFO ] Invariant cache hit.
[2024-05-27 07:34:10] [INFO ] State equation strengthened by 126 read => feed constraints.
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
All remaining problems are real, not stopping.
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 8928 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]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
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
[2024-05-27 07:34:25] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:34:25] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:34:26] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-05-27 07:34:28] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
[2024-05-27 07:34:28] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 0 ms to minimize.
[2024-05-27 07:34:28] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/573 constraints. Problems are: Problem set: 22 solved, 250 unsolved
[2024-05-27 07:34:41] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 3 ms to minimize.
[2024-05-27 07:34:41] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:34:41] [INFO ] Deduced a trap composed of 68 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:34:41] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/440 variables, 4/577 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/577 constraints. Problems are: Problem set: 22 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 577 constraints, problems are : Problem set: 22 solved, 250 unsolved in 30016 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: 10/10 constraints]
After SMT, in 39321ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 39324ms
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 : 167/264 places, 251/862 transitions.
Graph (complete) has 572 edges and 167 vertex of which 149 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 149 transition count 245
Applied a total of 7 rules in 10 ms. Remains 149 /167 variables (removed 18) and now considering 245/251 (removed 6) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-05-27 07:34:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:34:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:34:49] [INFO ] Invariant cache hit.
[2024-05-27 07:34:49] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:34:49] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/264 places, 245/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40296 ms. Remains : 149/264 places, 245/862 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
Product exploration explored 100000 steps with 18121 reset in 211 ms.
Product exploration explored 100000 steps with 17891 reset in 215 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 106 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (7212 resets) in 203 ms. (196 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (1217 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-05-27 07:34:50] [INFO ] Invariant cache hit.
[2024-05-27 07:34:50] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/240 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 394/394 variables, and 201 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 50/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 281 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-27 07:34:51] [INFO ] Invariant cache hit.
[2024-05-27 07:34:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:34:51] [INFO ] Invariant cache hit.
[2024-05-27 07:34:51] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:34:51] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-27 07:34:51] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-27 07:34:51] [INFO ] Invariant cache hit.
[2024-05-27 07:34:51] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 273 constraints, problems are : Problem set: 0 solved, 244 unsolved in 7747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/394 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/273 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 244/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 517 constraints, problems are : Problem set: 0 solved, 244 unsolved in 15710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 23775ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 23777ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24191 ms. Remains : 149/149 places, 245/245 transitions.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 552 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 42 ms :[p0]
RANDOM walk for 9380 steps (1664 resets) in 29 ms. (312 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 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 :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Product exploration explored 100000 steps with 18215 reset in 179 ms.
Product exploration explored 100000 steps with 18117 reset in 192 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 245/245 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 148 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 147 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 147 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 143 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 143 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 143 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 141 transition count 208
Applied a total of 21 rules in 13 ms. Remains 141 /149 variables (removed 8) and now considering 208/245 (removed 37) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 07:35:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:35:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:35:16] [INFO ] Invariant cache hit.
[2024-05-27 07:35:16] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:35:16] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-27 07:35:16] [INFO ] Redundant transitions in 2 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-27 07:35:16] [INFO ] Invariant cache hit.
[2024-05-27 07:35:16] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 234 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/349 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 207/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 441 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 17358ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 17360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/149 places, 208/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17752 ms. Remains : 141/149 places, 208/245 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 finished in 84191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 862/862 transitions.
Graph (complete) has 1391 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 861
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 244 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 244 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 244 transition count 417
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 226 transition count 399
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 226 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 226 transition count 396
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 144 place count 162 transition count 332
Iterating global reduction 3 with 64 rules applied. Total rules applied 208 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 280 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 159 transition count 232
Applied a total of 287 rules in 22 ms. Remains 159 /264 variables (removed 105) and now considering 232/862 (removed 630) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-05-27 07:35:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:35:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:35:33] [INFO ] Invariant cache hit.
[2024-05-27 07:35:33] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:35:34] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-27 07:35:34] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-27 07:35:34] [INFO ] Invariant cache hit.
[2024-05-27 07:35:34] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 252 constraints, problems are : Problem set: 0 solved, 231 unsolved in 6450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 231/483 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-27 07:35:45] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:35:45] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 07:35:45] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:35:45] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 07:35:47] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 5 ms to minimize.
[2024-05-27 07:35:47] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 6/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 489 constraints, problems are : Problem set: 22 solved, 209 unsolved in 19378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints]
After SMT, in 26132ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 26135ms
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 : 159/264 places, 210/862 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 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 141 transition count 204
Applied a total of 7 rules in 4 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:36:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:36:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:36:00] [INFO ] Invariant cache hit.
[2024-05-27 07:36:00] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:36:00] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/264 places, 204/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26902 ms. Remains : 141/264 places, 204/862 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 finished in 26944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !(!p0 U p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
[2024-05-27 07:36:01] [INFO ] Flatten gal took : 38 ms
[2024-05-27 07:36:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-27 07:36:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 862 transitions and 3414 arcs took 10 ms.
Total runtime 625940 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d1m020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 264
TRANSITIONS: 862
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1606
MODEL NAME: /home/mcc/execution/411/model
264 places, 862 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 CANNOT_COMPUTE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 CANNOT_COMPUTE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716795780609

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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-d1m020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d1m020, 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 r333-tall-171679077600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;